/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:38:51,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:38:51,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:38:51,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:38:51,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:38:51,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:38:51,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:38:51,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:38:51,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:38:51,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:38:51,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:38:51,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:38:51,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:38:51,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:38:51,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:38:51,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:38:51,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:38:51,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:38:51,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:38:51,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:38:51,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:38:51,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:38:51,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:38:51,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:38:51,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:38:51,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:38:51,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:38:51,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:38:51,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:38:51,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:38:51,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:38:51,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:38:51,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:38:51,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:38:51,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:38:51,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:38:51,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:38:51,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:38:51,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:38:51,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:38:51,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:38:51,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:38:51,367 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:38:51,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:38:51,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:38:51,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:38:51,369 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:38:51,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:38:51,370 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:38:51,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:38:51,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:38:51,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:38:51,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:38:51,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:38:51,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:38:51,372 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:38:51,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:38:51,373 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:38:51,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:38:51,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:38:51,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:38:51,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:38:51,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:38:51,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:38:51,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:38:51,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:38:51,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:38:51,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:38:51,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:38:51,375 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:38:51,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:38:51,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:38:51,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:38:51,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:38:51,726 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:38:51,728 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:38:51,729 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-16 04:38:51,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da174f2a/e594dd9714b8483a9db00aa5b992b63a/FLAGa2613cc83 [2020-10-16 04:38:52,326 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:38:52,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-16 04:38:52,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da174f2a/e594dd9714b8483a9db00aa5b992b63a/FLAGa2613cc83 [2020-10-16 04:38:52,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1da174f2a/e594dd9714b8483a9db00aa5b992b63a [2020-10-16 04:38:52,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:38:52,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:38:52,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:38:52,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:38:52,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:38:52,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:38:52" (1/1) ... [2020-10-16 04:38:52,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e86016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:52, skipping insertion in model container [2020-10-16 04:38:52,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:38:52" (1/1) ... [2020-10-16 04:38:52,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:38:52,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:38:53,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:38:53,373 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:38:53,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:38:53,507 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:38:53,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53 WrapperNode [2020-10-16 04:38:53,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:38:53,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:38:53,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:38:53,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:38:53,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:38:53,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:38:53,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:38:53,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:38:53,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... [2020-10-16 04:38:53,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:38:53,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:38:53,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:38:53,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:38:53,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:38:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:38:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:38:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:38:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:38:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:38:53,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:38:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:38:53,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:38:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:38:53,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:38:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:38:53,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:38:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:38:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:38:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:38:53,713 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:38:56,007 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:38:56,007 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:38:56,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:38:56 BoogieIcfgContainer [2020-10-16 04:38:56,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:38:56,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:38:56,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:38:56,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:38:56,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:38:52" (1/3) ... [2020-10-16 04:38:56,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b825b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:38:56, skipping insertion in model container [2020-10-16 04:38:56,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:53" (2/3) ... [2020-10-16 04:38:56,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b825b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:38:56, skipping insertion in model container [2020-10-16 04:38:56,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:38:56" (3/3) ... [2020-10-16 04:38:56,020 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2020-10-16 04:38:56,032 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:38:56,042 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:38:56,043 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:38:56,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,091 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,094 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,094 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,100 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,108 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,109 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,113 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,113 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,121 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,121 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:38:56,140 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:38:56,163 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:38:56,163 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:38:56,164 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:38:56,167 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:38:56,167 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:38:56,167 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:38:56,167 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:38:56,174 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:38:56,197 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-16 04:38:56,276 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-16 04:38:56,276 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:38:56,284 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 04:38:56,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2020-10-16 04:38:56,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2020-10-16 04:38:56,298 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:38:56,302 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2020-10-16 04:38:56,305 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2020-10-16 04:38:56,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2020-10-16 04:38:56,350 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-16 04:38:56,351 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:38:56,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 04:38:56,357 INFO L117 LiptonReduction]: Number of co-enabled transitions 2816 [2020-10-16 04:38:56,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:56,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:56,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:56,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:56,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:56,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:56,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:56,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:56,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:56,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:56,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:56,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:56,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:56,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:56,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:56,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:56,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:56,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:56,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:56,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:56,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:56,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:56,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:56,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:56,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:56,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:57,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:38:57,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:57,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:57,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:57,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:57,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:57,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:57,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:57,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:57,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,743 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 04:38:57,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:57,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:57,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:57,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:57,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:58,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:38:58,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:58,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:58,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 1] term [2020-10-16 04:38:58,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:58,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:38:58,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:58,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:38:58,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,366 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-16 04:38:59,479 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:38:59,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:38:59,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:38:59,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:38:59,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:38:59,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:38:59,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:00,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:00,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:00,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:00,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:00,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:00,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:00,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:00,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:00,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:00,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:39:00,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:39:00,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:39:00,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:00,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:39:00,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:39:00,740 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 04:39:00,877 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 04:39:00,896 INFO L132 LiptonReduction]: Checked pairs total: 8388 [2020-10-16 04:39:00,896 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 04:39:00,899 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4603 [2020-10-16 04:39:00,905 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 04:39:00,906 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:00,906 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:00,907 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:39:00,907 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1156621551, now seen corresponding path program 1 times [2020-10-16 04:39:00,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:00,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067818287] [2020-10-16 04:39:00,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:01,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067818287] [2020-10-16 04:39:01,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:01,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:39:01,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375928640] [2020-10-16 04:39:01,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:39:01,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:39:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:39:01,243 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 207 [2020-10-16 04:39:01,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states. [2020-10-16 04:39:01,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:01,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 207 [2020-10-16 04:39:01,253 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:01,474 INFO L129 PetriNetUnfolder]: 133/295 cut-off events. [2020-10-16 04:39:01,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:01,477 INFO L80 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 295 events. 133/295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1519 event pairs, 87 based on Foata normal form. 21/277 useless extension candidates. Maximal degree in co-relation 503. Up to 153 conditions per place. [2020-10-16 04:39:01,482 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 11 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2020-10-16 04:39:01,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 110 flow [2020-10-16 04:39:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:39:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:39:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2020-10-16 04:39:01,507 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8904991948470209 [2020-10-16 04:39:01,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2020-10-16 04:39:01,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2020-10-16 04:39:01,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:01,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2020-10-16 04:39:01,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:39:01,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:39:01,536 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:39:01,539 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 553 transitions. [2020-10-16 04:39:01,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 110 flow [2020-10-16 04:39:01,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 106 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:39:01,546 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2020-10-16 04:39:01,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2020-10-16 04:39:01,550 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2020-10-16 04:39:01,550 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2020-10-16 04:39:01,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:39:01,550 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:01,550 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:01,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:39:01,551 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:01,551 INFO L82 PathProgramCache]: Analyzing trace with hash 398865326, now seen corresponding path program 1 times [2020-10-16 04:39:01,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:01,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724020807] [2020-10-16 04:39:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:01,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724020807] [2020-10-16 04:39:01,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:01,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:39:01,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593003123] [2020-10-16 04:39:01,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:39:01,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:39:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:39:01,742 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 207 [2020-10-16 04:39:01,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand 4 states. [2020-10-16 04:39:01,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:01,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 207 [2020-10-16 04:39:01,743 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:01,799 INFO L129 PetriNetUnfolder]: 1/42 cut-off events. [2020-10-16 04:39:01,799 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:39:01,800 INFO L80 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 42 events. 1/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 56. Up to 5 conditions per place. [2020-10-16 04:39:01,800 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 2 selfloop transitions, 2 changer transitions 5/35 dead transitions. [2020-10-16 04:39:01,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 100 flow [2020-10-16 04:39:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 901 transitions. [2020-10-16 04:39:01,805 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8705314009661835 [2020-10-16 04:39:01,805 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 901 transitions. [2020-10-16 04:39:01,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 901 transitions. [2020-10-16 04:39:01,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:01,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 901 transitions. [2020-10-16 04:39:01,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:01,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:01,812 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:01,812 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 901 transitions. [2020-10-16 04:39:01,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 100 flow [2020-10-16 04:39:01,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:39:01,814 INFO L241 Difference]: Finished difference. Result has 47 places, 30 transitions, 80 flow [2020-10-16 04:39:01,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2020-10-16 04:39:01,815 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2020-10-16 04:39:01,816 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 80 flow [2020-10-16 04:39:01,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:39:01,816 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:01,816 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:01,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:39:01,817 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:01,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1061456810, now seen corresponding path program 1 times [2020-10-16 04:39:01,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:01,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735642301] [2020-10-16 04:39:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:02,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735642301] [2020-10-16 04:39:02,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:02,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:39:02,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845796720] [2020-10-16 04:39:02,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:02,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:02,018 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 207 [2020-10-16 04:39:02,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 80 flow. Second operand 5 states. [2020-10-16 04:39:02,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:02,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 207 [2020-10-16 04:39:02,020 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:02,211 INFO L129 PetriNetUnfolder]: 181/348 cut-off events. [2020-10-16 04:39:02,211 INFO L130 PetriNetUnfolder]: For 100/104 co-relation queries the response was YES. [2020-10-16 04:39:02,213 INFO L80 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 348 events. 181/348 cut-off events. For 100/104 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1727 event pairs, 24 based on Foata normal form. 26/366 useless extension candidates. Maximal degree in co-relation 694. Up to 193 conditions per place. [2020-10-16 04:39:02,216 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 12 selfloop transitions, 6 changer transitions 14/53 dead transitions. [2020-10-16 04:39:02,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 194 flow [2020-10-16 04:39:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:39:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:39:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1176 transitions. [2020-10-16 04:39:02,220 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8115942028985508 [2020-10-16 04:39:02,220 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1176 transitions. [2020-10-16 04:39:02,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1176 transitions. [2020-10-16 04:39:02,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:02,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1176 transitions. [2020-10-16 04:39:02,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:39:02,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:39:02,228 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:39:02,228 INFO L185 Difference]: Start difference. First operand has 47 places, 30 transitions, 80 flow. Second operand 7 states and 1176 transitions. [2020-10-16 04:39:02,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 194 flow [2020-10-16 04:39:02,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 186 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:39:02,232 INFO L241 Difference]: Finished difference. Result has 51 places, 34 transitions, 123 flow [2020-10-16 04:39:02,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=123, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2020-10-16 04:39:02,233 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2020-10-16 04:39:02,233 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 123 flow [2020-10-16 04:39:02,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:02,233 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:02,233 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:02,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:39:02,234 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash -211120503, now seen corresponding path program 1 times [2020-10-16 04:39:02,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:02,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159225834] [2020-10-16 04:39:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:02,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159225834] [2020-10-16 04:39:02,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:02,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:39:02,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858461813] [2020-10-16 04:39:02,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:02,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:02,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:02,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:02,477 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 207 [2020-10-16 04:39:02,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 123 flow. Second operand 5 states. [2020-10-16 04:39:02,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:02,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 207 [2020-10-16 04:39:02,483 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:02,892 INFO L129 PetriNetUnfolder]: 676/1150 cut-off events. [2020-10-16 04:39:02,892 INFO L130 PetriNetUnfolder]: For 1588/1715 co-relation queries the response was YES. [2020-10-16 04:39:02,900 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3078 conditions, 1150 events. 676/1150 cut-off events. For 1588/1715 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6603 event pairs, 202 based on Foata normal form. 82/1141 useless extension candidates. Maximal degree in co-relation 3063. Up to 572 conditions per place. [2020-10-16 04:39:02,909 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 13 selfloop transitions, 7 changer transitions 11/55 dead transitions. [2020-10-16 04:39:02,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 233 flow [2020-10-16 04:39:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:39:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:39:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 999 transitions. [2020-10-16 04:39:02,914 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8043478260869565 [2020-10-16 04:39:02,914 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 999 transitions. [2020-10-16 04:39:02,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 999 transitions. [2020-10-16 04:39:02,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:02,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 999 transitions. [2020-10-16 04:39:02,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:39:02,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:39:02,920 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:39:02,921 INFO L185 Difference]: Start difference. First operand has 51 places, 34 transitions, 123 flow. Second operand 6 states and 999 transitions. [2020-10-16 04:39:02,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 233 flow [2020-10-16 04:39:02,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 226 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:39:02,932 INFO L241 Difference]: Finished difference. Result has 54 places, 39 transitions, 165 flow [2020-10-16 04:39:02,933 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2020-10-16 04:39:02,933 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2020-10-16 04:39:02,933 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 165 flow [2020-10-16 04:39:02,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:02,933 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:02,933 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:02,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:39:02,934 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash -73342781, now seen corresponding path program 1 times [2020-10-16 04:39:02,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:02,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244953547] [2020-10-16 04:39:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:03,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244953547] [2020-10-16 04:39:03,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:03,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:03,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555572425] [2020-10-16 04:39:03,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:39:03,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:39:03,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:39:03,065 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 207 [2020-10-16 04:39:03,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 165 flow. Second operand 6 states. [2020-10-16 04:39:03,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:03,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 207 [2020-10-16 04:39:03,066 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:03,399 INFO L129 PetriNetUnfolder]: 586/982 cut-off events. [2020-10-16 04:39:03,399 INFO L130 PetriNetUnfolder]: For 1837/2173 co-relation queries the response was YES. [2020-10-16 04:39:03,407 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 982 events. 586/982 cut-off events. For 1837/2173 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5435 event pairs, 373 based on Foata normal form. 52/947 useless extension candidates. Maximal degree in co-relation 3082. Up to 618 conditions per place. [2020-10-16 04:39:03,418 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 13 selfloop transitions, 8 changer transitions 10/55 dead transitions. [2020-10-16 04:39:03,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 290 flow [2020-10-16 04:39:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 818 transitions. [2020-10-16 04:39:03,424 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7903381642512077 [2020-10-16 04:39:03,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 818 transitions. [2020-10-16 04:39:03,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 818 transitions. [2020-10-16 04:39:03,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:03,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 818 transitions. [2020-10-16 04:39:03,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:03,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:03,429 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:03,430 INFO L185 Difference]: Start difference. First operand has 54 places, 39 transitions, 165 flow. Second operand 5 states and 818 transitions. [2020-10-16 04:39:03,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 290 flow [2020-10-16 04:39:03,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 282 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:39:03,436 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 218 flow [2020-10-16 04:39:03,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2020-10-16 04:39:03,436 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2020-10-16 04:39:03,437 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 218 flow [2020-10-16 04:39:03,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:39:03,437 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:03,437 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:03,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:39:03,437 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:03,438 INFO L82 PathProgramCache]: Analyzing trace with hash -173476497, now seen corresponding path program 1 times [2020-10-16 04:39:03,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:03,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247634765] [2020-10-16 04:39:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:03,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247634765] [2020-10-16 04:39:03,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:03,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:39:03,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877469670] [2020-10-16 04:39:03,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:39:03,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:39:03,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:39:03,634 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 207 [2020-10-16 04:39:03,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 218 flow. Second operand 7 states. [2020-10-16 04:39:03,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:03,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 207 [2020-10-16 04:39:03,635 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:04,047 INFO L129 PetriNetUnfolder]: 655/1111 cut-off events. [2020-10-16 04:39:04,048 INFO L130 PetriNetUnfolder]: For 3189/3740 co-relation queries the response was YES. [2020-10-16 04:39:04,056 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4416 conditions, 1111 events. 655/1111 cut-off events. For 3189/3740 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6170 event pairs, 205 based on Foata normal form. 91/1113 useless extension candidates. Maximal degree in co-relation 4396. Up to 586 conditions per place. [2020-10-16 04:39:04,067 INFO L132 encePairwiseOnDemand]: 198/207 looper letters, 25 selfloop transitions, 11 changer transitions 9/69 dead transitions. [2020-10-16 04:39:04,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 471 flow [2020-10-16 04:39:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:39:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:39:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1148 transitions. [2020-10-16 04:39:04,071 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7922705314009661 [2020-10-16 04:39:04,072 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1148 transitions. [2020-10-16 04:39:04,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1148 transitions. [2020-10-16 04:39:04,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:04,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1148 transitions. [2020-10-16 04:39:04,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:39:04,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:39:04,078 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:39:04,078 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 218 flow. Second operand 7 states and 1148 transitions. [2020-10-16 04:39:04,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 471 flow [2020-10-16 04:39:04,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 458 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:39:04,085 INFO L241 Difference]: Finished difference. Result has 62 places, 50 transitions, 309 flow [2020-10-16 04:39:04,086 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2020-10-16 04:39:04,086 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2020-10-16 04:39:04,086 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 309 flow [2020-10-16 04:39:04,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:39:04,086 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:04,087 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:04,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:39:04,087 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:04,087 INFO L82 PathProgramCache]: Analyzing trace with hash -985096173, now seen corresponding path program 2 times [2020-10-16 04:39:04,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:04,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802357103] [2020-10-16 04:39:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:04,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802357103] [2020-10-16 04:39:04,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:04,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:04,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045757595] [2020-10-16 04:39:04,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:39:04,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:04,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:39:04,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:39:04,206 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 207 [2020-10-16 04:39:04,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 309 flow. Second operand 6 states. [2020-10-16 04:39:04,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:04,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 207 [2020-10-16 04:39:04,207 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:04,644 INFO L129 PetriNetUnfolder]: 741/1244 cut-off events. [2020-10-16 04:39:04,644 INFO L130 PetriNetUnfolder]: For 5516/6410 co-relation queries the response was YES. [2020-10-16 04:39:04,652 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 1244 events. 741/1244 cut-off events. For 5516/6410 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6811 event pairs, 280 based on Foata normal form. 75/1220 useless extension candidates. Maximal degree in co-relation 6103. Up to 698 conditions per place. [2020-10-16 04:39:04,667 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 23 selfloop transitions, 14 changer transitions 9/70 dead transitions. [2020-10-16 04:39:04,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 592 flow [2020-10-16 04:39:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:39:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:39:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1018 transitions. [2020-10-16 04:39:04,671 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8196457326892109 [2020-10-16 04:39:04,671 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1018 transitions. [2020-10-16 04:39:04,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1018 transitions. [2020-10-16 04:39:04,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:04,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1018 transitions. [2020-10-16 04:39:04,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:39:04,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:39:04,678 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:39:04,678 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 309 flow. Second operand 6 states and 1018 transitions. [2020-10-16 04:39:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 592 flow [2020-10-16 04:39:04,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 553 flow, removed 14 selfloop flow, removed 2 redundant places. [2020-10-16 04:39:04,690 INFO L241 Difference]: Finished difference. Result has 66 places, 58 transitions, 419 flow [2020-10-16 04:39:04,690 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2020-10-16 04:39:04,691 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2020-10-16 04:39:04,691 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 419 flow [2020-10-16 04:39:04,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:39:04,691 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:04,692 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:04,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:39:04,692 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash -802538782, now seen corresponding path program 1 times [2020-10-16 04:39:04,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:04,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536404519] [2020-10-16 04:39:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:04,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536404519] [2020-10-16 04:39:04,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:04,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:04,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315890226] [2020-10-16 04:39:04,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:04,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:04,871 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 207 [2020-10-16 04:39:04,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 419 flow. Second operand 5 states. [2020-10-16 04:39:04,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:04,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 207 [2020-10-16 04:39:04,873 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:05,301 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] L865-->L881: Formula: (let ((.cse30 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse29 (= (mod v_~x$r_buff0_thd0~0_230 256) 0)) (.cse25 (= (mod v_~x$r_buff1_thd0~0_167 256) 0))) (let ((.cse10 (= (mod v_~weak$$choice2~0_78 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_473 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_341 256) 0)) (.cse22 (not .cse25)) (.cse3 (not .cse29)) (.cse31 (= (mod v_~x$w_buff0_used~0_474 256) 0)) (.cse7 (and .cse25 .cse29)) (.cse8 (and .cse30 .cse29))) (let ((.cse15 (or .cse31 .cse7 .cse8)) (.cse14 (not .cse31)) (.cse13 (or .cse31 .cse29)) (.cse2 (or .cse3 (not .cse30))) (.cse0 (or .cse3 .cse22)) (.cse23 (not .cse24)) (.cse5 (or .cse29 .cse9)) (.cse1 (not .cse9)) (.cse11 (not .cse10))) (and (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite49_39| |v_ULTIMATE.start_main_#t~ite49_44|))) (or (and (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite49_44| |v_ULTIMATE.start_main_#t~ite50_36|) .cse2 (let ((.cse4 (= |v_ULTIMATE.start_main_#t~ite49_44| 0))) (or (and .cse3 .cse4 .cse1) (and .cse4 .cse5)))) (and (= v_~x$w_buff1_used~0_342 |v_ULTIMATE.start_main_#t~ite50_36|) .cse6 (or .cse7 .cse8 .cse9))) .cse10 (= v_~x$w_buff1_used~0_341 |v_ULTIMATE.start_main_#t~ite50_36|)) (and .cse6 (= v_~x$w_buff1_used~0_342 v_~x$w_buff1_used~0_341) .cse11 (= |v_ULTIMATE.start_main_#t~ite50_36| |v_ULTIMATE.start_main_#t~ite50_31|)))) (= (ite (= (ite (not (and (= 2 v_~x~0_217) (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (or (and (= v_~x~0_217 v_~x~0_187) .cse10) (and (= v_~x$mem_tmp~0_22 v_~x~0_187) .cse11)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite46_51|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite47_39| |v_ULTIMATE.start_main_#t~ite47_44|) (= v_~x$w_buff0_used~0_474 v_~x$w_buff0_used~0_473) .cse11) (and (= v_~x$w_buff0_used~0_473 |v_ULTIMATE.start_main_#t~ite47_44|) (or (and .cse0 (or (and .cse13 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite46_56|)) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite46_56| 0) .cse14)) .cse14 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite47_44|) .cse2) (and .cse12 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite47_44|) .cse15)) .cse10))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite40_57|))) (or (and .cse10 (= v_~x$w_buff0~0_107 |v_ULTIMATE.start_main_#t~ite41_56|) (or (and .cse16 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite41_56|) .cse15) (and .cse0 (let ((.cse17 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite40_62|))) (or (and .cse17 .cse13) (and .cse3 .cse17 .cse14))) (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite41_56|) .cse14 .cse2))) (and .cse16 (= |v_ULTIMATE.start_main_#t~ite41_56| |v_ULTIMATE.start_main_#t~ite41_51|) (= v_~x$w_buff0~0_107 v_~x$w_buff0~0_108) .cse11))) (= |v_ULTIMATE.start_main_#t~nondet37_27| v_~weak$$choice2~0_78) (= |v_ULTIMATE.start_main_#t~nondet36_25| v_~weak$$choice0~0_11) (let ((.cse18 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite55_45|))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite56_46| |v_ULTIMATE.start_main_#t~ite56_41|) (= v_~x$r_buff1_thd0~0_167 v_~x$r_buff1_thd0~0_166) .cse11) (and (let ((.cse19 (= (mod v_~x$r_buff0_thd0~0_229 256) 0))) (or (let ((.cse21 (not .cse19))) (and (let ((.cse20 (= |v_ULTIMATE.start_main_#t~ite55_50| 0))) (or (and (or .cse19 .cse9) .cse20) (and .cse21 .cse1 .cse20))) (or .cse21 .cse22) .cse1 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite56_46|) (or .cse21 .cse23))) (and (= v_~x$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite56_46|) .cse18 (or (and .cse19 .cse24) (and .cse19 .cse25) .cse9)))) .cse10 (= v_~x$r_buff1_thd0~0_166 |v_ULTIMATE.start_main_#t~ite56_46|)))) (= v_~x$flush_delayed~0_36 0) (let ((.cse26 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite43_45|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_40| |v_ULTIMATE.start_main_#t~ite44_35|) (= v_~x$w_buff1~0_115 v_~x$w_buff1~0_114) .cse26 .cse11) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_114) (or (and .cse15 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_115) .cse26) (and .cse0 (let ((.cse27 (= |v_ULTIMATE.start_main_#t~ite43_50| v_~x$w_buff1~0_115))) (or (and .cse13 .cse27) (and .cse3 .cse14 .cse27))) .cse14 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite44_40|) .cse2))))) (or (and (= |v_ULTIMATE.start_main_#t~ite38_42| |v_ULTIMATE.start_main_#t~ite38_37|) .cse15 (= v_~x~0_189 v_~x~0_217)) (and (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x~0_217) .cse0 .cse14 (or (and .cse3 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite38_42|) .cse14) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x$w_buff1~0_115))) .cse2)) (= v_~x$mem_tmp~0_22 v_~x~0_189) (let ((.cse28 (= |v_ULTIMATE.start_main_#t~ite52_59| |v_ULTIMATE.start_main_#t~ite52_64|))) (or (and (or (and .cse0 (or .cse3 .cse23) .cse1 (or (and (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite52_64|) .cse5) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite52_64| 0) .cse1)) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite52_64|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite53_58|) (or .cse7 (and .cse24 .cse29) .cse9))) .cse10 (= v_~x$r_buff0_thd0~0_229 |v_ULTIMATE.start_main_#t~ite53_58|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff0_thd0~0_229) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite53_53|) .cse11))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_108, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_41|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_57|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_27|, ~x~0=v_~x~0_189} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_24|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_30|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_40|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_229, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ~x$w_buff1~0=v_~x$w_buff1~0_114, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_28|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_30|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_166, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_30|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_52|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_40|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, ~weak$$choice0~0=v_~weak$$choice0~0_11, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_56|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_26|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_187} AuxVars[|v_ULTIMATE.start_main_#t~ite40_62|, |v_ULTIMATE.start_main_#t~ite49_44|, |v_ULTIMATE.start_main_#t~ite47_44|, |v_ULTIMATE.start_main_#t~ite43_50|, |v_ULTIMATE.start_main_#t~ite44_40|, |v_ULTIMATE.start_main_#t~ite46_56|, |v_ULTIMATE.start_main_#t~ite50_36|, |v_ULTIMATE.start_main_#t~ite53_58|, |v_ULTIMATE.start_main_#t~ite38_42|, |v_ULTIMATE.start_main_#t~ite55_50|, |v_ULTIMATE.start_main_#t~ite52_64|, v_~x~0_217, |v_ULTIMATE.start_main_#t~ite56_46|, |v_ULTIMATE.start_main_#t~ite41_56|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet36, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet37, ~weak$$choice2~0, ~x~0][50], [Black: 184#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), P2Thread1of1ForFork3InUse, Black: 187#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), Black: 190#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), 199#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 71#L881true, Black: 135#(<= ~__unbuffered_p3_EAX~0 0), Black: 200#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 203#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 212#(= ~y~0 1), Black: 145#(and (= ~__unbuffered_p2_EAX~0 0) (<= ~__unbuffered_cnt~0 0)), Black: 146#(not (= ~__unbuffered_p2_EAX~0 1)), Black: 149#(and (= ~__unbuffered_p2_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (<= ~__unbuffered_cnt~0 0)), 99#L797true, Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (not (= 2 ~x$w_buff0~0)) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 161#(and (not (= 2 ~x$w_buff0~0)) (not (= 2 ~x~0)) (not (= 2 ~x$w_buff1~0))), 51#L820true, Black: 177#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~x~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), Black: 173#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), 52#P0EXITtrue, 118#P1EXITtrue, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse]) [2020-10-16 04:39:05,301 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2020-10-16 04:39:05,302 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2020-10-16 04:39:05,302 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2020-10-16 04:39:05,302 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2020-10-16 04:39:05,460 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] L865-->L881: Formula: (let ((.cse30 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse29 (= (mod v_~x$r_buff0_thd0~0_230 256) 0)) (.cse25 (= (mod v_~x$r_buff1_thd0~0_167 256) 0))) (let ((.cse10 (= (mod v_~weak$$choice2~0_78 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_473 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_341 256) 0)) (.cse22 (not .cse25)) (.cse3 (not .cse29)) (.cse31 (= (mod v_~x$w_buff0_used~0_474 256) 0)) (.cse7 (and .cse25 .cse29)) (.cse8 (and .cse30 .cse29))) (let ((.cse15 (or .cse31 .cse7 .cse8)) (.cse14 (not .cse31)) (.cse13 (or .cse31 .cse29)) (.cse2 (or .cse3 (not .cse30))) (.cse0 (or .cse3 .cse22)) (.cse23 (not .cse24)) (.cse5 (or .cse29 .cse9)) (.cse1 (not .cse9)) (.cse11 (not .cse10))) (and (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite49_39| |v_ULTIMATE.start_main_#t~ite49_44|))) (or (and (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite49_44| |v_ULTIMATE.start_main_#t~ite50_36|) .cse2 (let ((.cse4 (= |v_ULTIMATE.start_main_#t~ite49_44| 0))) (or (and .cse3 .cse4 .cse1) (and .cse4 .cse5)))) (and (= v_~x$w_buff1_used~0_342 |v_ULTIMATE.start_main_#t~ite50_36|) .cse6 (or .cse7 .cse8 .cse9))) .cse10 (= v_~x$w_buff1_used~0_341 |v_ULTIMATE.start_main_#t~ite50_36|)) (and .cse6 (= v_~x$w_buff1_used~0_342 v_~x$w_buff1_used~0_341) .cse11 (= |v_ULTIMATE.start_main_#t~ite50_36| |v_ULTIMATE.start_main_#t~ite50_31|)))) (= (ite (= (ite (not (and (= 2 v_~x~0_217) (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (or (and (= v_~x~0_217 v_~x~0_187) .cse10) (and (= v_~x$mem_tmp~0_22 v_~x~0_187) .cse11)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite46_51|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite47_39| |v_ULTIMATE.start_main_#t~ite47_44|) (= v_~x$w_buff0_used~0_474 v_~x$w_buff0_used~0_473) .cse11) (and (= v_~x$w_buff0_used~0_473 |v_ULTIMATE.start_main_#t~ite47_44|) (or (and .cse0 (or (and .cse13 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite46_56|)) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite46_56| 0) .cse14)) .cse14 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite47_44|) .cse2) (and .cse12 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite47_44|) .cse15)) .cse10))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite40_57|))) (or (and .cse10 (= v_~x$w_buff0~0_107 |v_ULTIMATE.start_main_#t~ite41_56|) (or (and .cse16 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite41_56|) .cse15) (and .cse0 (let ((.cse17 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite40_62|))) (or (and .cse17 .cse13) (and .cse3 .cse17 .cse14))) (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite41_56|) .cse14 .cse2))) (and .cse16 (= |v_ULTIMATE.start_main_#t~ite41_56| |v_ULTIMATE.start_main_#t~ite41_51|) (= v_~x$w_buff0~0_107 v_~x$w_buff0~0_108) .cse11))) (= |v_ULTIMATE.start_main_#t~nondet37_27| v_~weak$$choice2~0_78) (= |v_ULTIMATE.start_main_#t~nondet36_25| v_~weak$$choice0~0_11) (let ((.cse18 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite55_45|))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite56_46| |v_ULTIMATE.start_main_#t~ite56_41|) (= v_~x$r_buff1_thd0~0_167 v_~x$r_buff1_thd0~0_166) .cse11) (and (let ((.cse19 (= (mod v_~x$r_buff0_thd0~0_229 256) 0))) (or (let ((.cse21 (not .cse19))) (and (let ((.cse20 (= |v_ULTIMATE.start_main_#t~ite55_50| 0))) (or (and (or .cse19 .cse9) .cse20) (and .cse21 .cse1 .cse20))) (or .cse21 .cse22) .cse1 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite56_46|) (or .cse21 .cse23))) (and (= v_~x$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite56_46|) .cse18 (or (and .cse19 .cse24) (and .cse19 .cse25) .cse9)))) .cse10 (= v_~x$r_buff1_thd0~0_166 |v_ULTIMATE.start_main_#t~ite56_46|)))) (= v_~x$flush_delayed~0_36 0) (let ((.cse26 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite43_45|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_40| |v_ULTIMATE.start_main_#t~ite44_35|) (= v_~x$w_buff1~0_115 v_~x$w_buff1~0_114) .cse26 .cse11) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_114) (or (and .cse15 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_115) .cse26) (and .cse0 (let ((.cse27 (= |v_ULTIMATE.start_main_#t~ite43_50| v_~x$w_buff1~0_115))) (or (and .cse13 .cse27) (and .cse3 .cse14 .cse27))) .cse14 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite44_40|) .cse2))))) (or (and (= |v_ULTIMATE.start_main_#t~ite38_42| |v_ULTIMATE.start_main_#t~ite38_37|) .cse15 (= v_~x~0_189 v_~x~0_217)) (and (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x~0_217) .cse0 .cse14 (or (and .cse3 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite38_42|) .cse14) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x$w_buff1~0_115))) .cse2)) (= v_~x$mem_tmp~0_22 v_~x~0_189) (let ((.cse28 (= |v_ULTIMATE.start_main_#t~ite52_59| |v_ULTIMATE.start_main_#t~ite52_64|))) (or (and (or (and .cse0 (or .cse3 .cse23) .cse1 (or (and (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite52_64|) .cse5) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite52_64| 0) .cse1)) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite52_64|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite53_58|) (or .cse7 (and .cse24 .cse29) .cse9))) .cse10 (= v_~x$r_buff0_thd0~0_229 |v_ULTIMATE.start_main_#t~ite53_58|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff0_thd0~0_229) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite53_53|) .cse11))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_108, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_41|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_57|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_27|, ~x~0=v_~x~0_189} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_24|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_30|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_40|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_229, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ~x$w_buff1~0=v_~x$w_buff1~0_114, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_28|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_30|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_166, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_30|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_52|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_40|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, ~weak$$choice0~0=v_~weak$$choice0~0_11, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_56|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_26|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_187} AuxVars[|v_ULTIMATE.start_main_#t~ite40_62|, |v_ULTIMATE.start_main_#t~ite49_44|, |v_ULTIMATE.start_main_#t~ite47_44|, |v_ULTIMATE.start_main_#t~ite43_50|, |v_ULTIMATE.start_main_#t~ite44_40|, |v_ULTIMATE.start_main_#t~ite46_56|, |v_ULTIMATE.start_main_#t~ite50_36|, |v_ULTIMATE.start_main_#t~ite53_58|, |v_ULTIMATE.start_main_#t~ite38_42|, |v_ULTIMATE.start_main_#t~ite55_50|, |v_ULTIMATE.start_main_#t~ite52_64|, v_~x~0_217, |v_ULTIMATE.start_main_#t~ite56_46|, |v_ULTIMATE.start_main_#t~ite41_56|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet36, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet37, ~weak$$choice2~0, ~x~0][50], [Black: 184#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), P2Thread1of1ForFork3InUse, Black: 187#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), Black: 190#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), 71#L881true, 199#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 135#(<= ~__unbuffered_p3_EAX~0 0), Black: 200#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 203#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 212#(= ~y~0 1), Black: 145#(and (= ~__unbuffered_p2_EAX~0 0) (<= ~__unbuffered_cnt~0 0)), Black: 146#(not (= ~__unbuffered_p2_EAX~0 1)), Black: 149#(and (= ~__unbuffered_p2_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (<= ~__unbuffered_cnt~0 0)), 96#L830true, 99#L797true, Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (not (= 2 ~x$w_buff0~0)) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 161#(and (not (= 2 ~x$w_buff0~0)) (not (= 2 ~x~0)) (not (= 2 ~x$w_buff1~0))), Black: 177#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~x~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), Black: 173#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), 52#P0EXITtrue, 118#P1EXITtrue, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse]) [2020-10-16 04:39:05,460 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2020-10-16 04:39:05,460 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2020-10-16 04:39:05,460 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2020-10-16 04:39:05,461 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2020-10-16 04:39:05,530 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] L865-->L881: Formula: (let ((.cse30 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse29 (= (mod v_~x$r_buff0_thd0~0_230 256) 0)) (.cse25 (= (mod v_~x$r_buff1_thd0~0_167 256) 0))) (let ((.cse10 (= (mod v_~weak$$choice2~0_78 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_473 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_341 256) 0)) (.cse22 (not .cse25)) (.cse3 (not .cse29)) (.cse31 (= (mod v_~x$w_buff0_used~0_474 256) 0)) (.cse7 (and .cse25 .cse29)) (.cse8 (and .cse30 .cse29))) (let ((.cse15 (or .cse31 .cse7 .cse8)) (.cse14 (not .cse31)) (.cse13 (or .cse31 .cse29)) (.cse2 (or .cse3 (not .cse30))) (.cse0 (or .cse3 .cse22)) (.cse23 (not .cse24)) (.cse5 (or .cse29 .cse9)) (.cse1 (not .cse9)) (.cse11 (not .cse10))) (and (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite49_39| |v_ULTIMATE.start_main_#t~ite49_44|))) (or (and (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite49_44| |v_ULTIMATE.start_main_#t~ite50_36|) .cse2 (let ((.cse4 (= |v_ULTIMATE.start_main_#t~ite49_44| 0))) (or (and .cse3 .cse4 .cse1) (and .cse4 .cse5)))) (and (= v_~x$w_buff1_used~0_342 |v_ULTIMATE.start_main_#t~ite50_36|) .cse6 (or .cse7 .cse8 .cse9))) .cse10 (= v_~x$w_buff1_used~0_341 |v_ULTIMATE.start_main_#t~ite50_36|)) (and .cse6 (= v_~x$w_buff1_used~0_342 v_~x$w_buff1_used~0_341) .cse11 (= |v_ULTIMATE.start_main_#t~ite50_36| |v_ULTIMATE.start_main_#t~ite50_31|)))) (= (ite (= (ite (not (and (= 2 v_~x~0_217) (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (or (and (= v_~x~0_217 v_~x~0_187) .cse10) (and (= v_~x$mem_tmp~0_22 v_~x~0_187) .cse11)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite46_51|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite47_39| |v_ULTIMATE.start_main_#t~ite47_44|) (= v_~x$w_buff0_used~0_474 v_~x$w_buff0_used~0_473) .cse11) (and (= v_~x$w_buff0_used~0_473 |v_ULTIMATE.start_main_#t~ite47_44|) (or (and .cse0 (or (and .cse13 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite46_56|)) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite46_56| 0) .cse14)) .cse14 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite47_44|) .cse2) (and .cse12 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite47_44|) .cse15)) .cse10))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite40_57|))) (or (and .cse10 (= v_~x$w_buff0~0_107 |v_ULTIMATE.start_main_#t~ite41_56|) (or (and .cse16 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite41_56|) .cse15) (and .cse0 (let ((.cse17 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite40_62|))) (or (and .cse17 .cse13) (and .cse3 .cse17 .cse14))) (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite41_56|) .cse14 .cse2))) (and .cse16 (= |v_ULTIMATE.start_main_#t~ite41_56| |v_ULTIMATE.start_main_#t~ite41_51|) (= v_~x$w_buff0~0_107 v_~x$w_buff0~0_108) .cse11))) (= |v_ULTIMATE.start_main_#t~nondet37_27| v_~weak$$choice2~0_78) (= |v_ULTIMATE.start_main_#t~nondet36_25| v_~weak$$choice0~0_11) (let ((.cse18 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite55_45|))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite56_46| |v_ULTIMATE.start_main_#t~ite56_41|) (= v_~x$r_buff1_thd0~0_167 v_~x$r_buff1_thd0~0_166) .cse11) (and (let ((.cse19 (= (mod v_~x$r_buff0_thd0~0_229 256) 0))) (or (let ((.cse21 (not .cse19))) (and (let ((.cse20 (= |v_ULTIMATE.start_main_#t~ite55_50| 0))) (or (and (or .cse19 .cse9) .cse20) (and .cse21 .cse1 .cse20))) (or .cse21 .cse22) .cse1 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite56_46|) (or .cse21 .cse23))) (and (= v_~x$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite56_46|) .cse18 (or (and .cse19 .cse24) (and .cse19 .cse25) .cse9)))) .cse10 (= v_~x$r_buff1_thd0~0_166 |v_ULTIMATE.start_main_#t~ite56_46|)))) (= v_~x$flush_delayed~0_36 0) (let ((.cse26 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite43_45|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_40| |v_ULTIMATE.start_main_#t~ite44_35|) (= v_~x$w_buff1~0_115 v_~x$w_buff1~0_114) .cse26 .cse11) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_114) (or (and .cse15 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_115) .cse26) (and .cse0 (let ((.cse27 (= |v_ULTIMATE.start_main_#t~ite43_50| v_~x$w_buff1~0_115))) (or (and .cse13 .cse27) (and .cse3 .cse14 .cse27))) .cse14 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite44_40|) .cse2))))) (or (and (= |v_ULTIMATE.start_main_#t~ite38_42| |v_ULTIMATE.start_main_#t~ite38_37|) .cse15 (= v_~x~0_189 v_~x~0_217)) (and (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x~0_217) .cse0 .cse14 (or (and .cse3 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite38_42|) .cse14) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x$w_buff1~0_115))) .cse2)) (= v_~x$mem_tmp~0_22 v_~x~0_189) (let ((.cse28 (= |v_ULTIMATE.start_main_#t~ite52_59| |v_ULTIMATE.start_main_#t~ite52_64|))) (or (and (or (and .cse0 (or .cse3 .cse23) .cse1 (or (and (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite52_64|) .cse5) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite52_64| 0) .cse1)) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite52_64|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite53_58|) (or .cse7 (and .cse24 .cse29) .cse9))) .cse10 (= v_~x$r_buff0_thd0~0_229 |v_ULTIMATE.start_main_#t~ite53_58|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff0_thd0~0_229) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite53_53|) .cse11))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_108, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_41|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_57|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_27|, ~x~0=v_~x~0_189} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_24|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_30|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_40|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_229, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ~x$w_buff1~0=v_~x$w_buff1~0_114, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_28|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_30|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_166, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_30|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_52|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_40|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, ~weak$$choice0~0=v_~weak$$choice0~0_11, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_56|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_26|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_187} AuxVars[|v_ULTIMATE.start_main_#t~ite40_62|, |v_ULTIMATE.start_main_#t~ite49_44|, |v_ULTIMATE.start_main_#t~ite47_44|, |v_ULTIMATE.start_main_#t~ite43_50|, |v_ULTIMATE.start_main_#t~ite44_40|, |v_ULTIMATE.start_main_#t~ite46_56|, |v_ULTIMATE.start_main_#t~ite50_36|, |v_ULTIMATE.start_main_#t~ite53_58|, |v_ULTIMATE.start_main_#t~ite38_42|, |v_ULTIMATE.start_main_#t~ite55_50|, |v_ULTIMATE.start_main_#t~ite52_64|, v_~x~0_217, |v_ULTIMATE.start_main_#t~ite56_46|, |v_ULTIMATE.start_main_#t~ite41_56|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet36, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet37, ~weak$$choice2~0, ~x~0][50], [Black: 184#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), P2Thread1of1ForFork3InUse, Black: 187#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), Black: 190#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), 68#P3EXITtrue, 71#L881true, 199#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 135#(<= ~__unbuffered_p3_EAX~0 0), Black: 200#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 203#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 212#(= ~y~0 1), 24#L784true, Black: 145#(and (= ~__unbuffered_p2_EAX~0 0) (<= ~__unbuffered_cnt~0 0)), Black: 146#(not (= ~__unbuffered_p2_EAX~0 1)), Black: 149#(and (= ~__unbuffered_p2_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (<= ~__unbuffered_cnt~0 0)), 99#L797true, Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (not (= 2 ~x$w_buff0~0)) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 161#(and (not (= 2 ~x$w_buff0~0)) (not (= 2 ~x~0)) (not (= 2 ~x$w_buff1~0))), Black: 177#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~x~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), Black: 173#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), 52#P0EXITtrue, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse]) [2020-10-16 04:39:05,531 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2020-10-16 04:39:05,531 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2020-10-16 04:39:05,531 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2020-10-16 04:39:05,531 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2020-10-16 04:39:05,709 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] L865-->L881: Formula: (let ((.cse30 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse29 (= (mod v_~x$r_buff0_thd0~0_230 256) 0)) (.cse25 (= (mod v_~x$r_buff1_thd0~0_167 256) 0))) (let ((.cse10 (= (mod v_~weak$$choice2~0_78 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_473 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_341 256) 0)) (.cse22 (not .cse25)) (.cse3 (not .cse29)) (.cse31 (= (mod v_~x$w_buff0_used~0_474 256) 0)) (.cse7 (and .cse25 .cse29)) (.cse8 (and .cse30 .cse29))) (let ((.cse15 (or .cse31 .cse7 .cse8)) (.cse14 (not .cse31)) (.cse13 (or .cse31 .cse29)) (.cse2 (or .cse3 (not .cse30))) (.cse0 (or .cse3 .cse22)) (.cse23 (not .cse24)) (.cse5 (or .cse29 .cse9)) (.cse1 (not .cse9)) (.cse11 (not .cse10))) (and (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite49_39| |v_ULTIMATE.start_main_#t~ite49_44|))) (or (and (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite49_44| |v_ULTIMATE.start_main_#t~ite50_36|) .cse2 (let ((.cse4 (= |v_ULTIMATE.start_main_#t~ite49_44| 0))) (or (and .cse3 .cse4 .cse1) (and .cse4 .cse5)))) (and (= v_~x$w_buff1_used~0_342 |v_ULTIMATE.start_main_#t~ite50_36|) .cse6 (or .cse7 .cse8 .cse9))) .cse10 (= v_~x$w_buff1_used~0_341 |v_ULTIMATE.start_main_#t~ite50_36|)) (and .cse6 (= v_~x$w_buff1_used~0_342 v_~x$w_buff1_used~0_341) .cse11 (= |v_ULTIMATE.start_main_#t~ite50_36| |v_ULTIMATE.start_main_#t~ite50_31|)))) (= (ite (= (ite (not (and (= 2 v_~x~0_217) (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (or (and (= v_~x~0_217 v_~x~0_187) .cse10) (and (= v_~x$mem_tmp~0_22 v_~x~0_187) .cse11)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite46_51|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite47_39| |v_ULTIMATE.start_main_#t~ite47_44|) (= v_~x$w_buff0_used~0_474 v_~x$w_buff0_used~0_473) .cse11) (and (= v_~x$w_buff0_used~0_473 |v_ULTIMATE.start_main_#t~ite47_44|) (or (and .cse0 (or (and .cse13 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite46_56|)) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite46_56| 0) .cse14)) .cse14 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite47_44|) .cse2) (and .cse12 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite47_44|) .cse15)) .cse10))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite40_57|))) (or (and .cse10 (= v_~x$w_buff0~0_107 |v_ULTIMATE.start_main_#t~ite41_56|) (or (and .cse16 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite41_56|) .cse15) (and .cse0 (let ((.cse17 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite40_62|))) (or (and .cse17 .cse13) (and .cse3 .cse17 .cse14))) (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite41_56|) .cse14 .cse2))) (and .cse16 (= |v_ULTIMATE.start_main_#t~ite41_56| |v_ULTIMATE.start_main_#t~ite41_51|) (= v_~x$w_buff0~0_107 v_~x$w_buff0~0_108) .cse11))) (= |v_ULTIMATE.start_main_#t~nondet37_27| v_~weak$$choice2~0_78) (= |v_ULTIMATE.start_main_#t~nondet36_25| v_~weak$$choice0~0_11) (let ((.cse18 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite55_45|))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite56_46| |v_ULTIMATE.start_main_#t~ite56_41|) (= v_~x$r_buff1_thd0~0_167 v_~x$r_buff1_thd0~0_166) .cse11) (and (let ((.cse19 (= (mod v_~x$r_buff0_thd0~0_229 256) 0))) (or (let ((.cse21 (not .cse19))) (and (let ((.cse20 (= |v_ULTIMATE.start_main_#t~ite55_50| 0))) (or (and (or .cse19 .cse9) .cse20) (and .cse21 .cse1 .cse20))) (or .cse21 .cse22) .cse1 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite56_46|) (or .cse21 .cse23))) (and (= v_~x$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite56_46|) .cse18 (or (and .cse19 .cse24) (and .cse19 .cse25) .cse9)))) .cse10 (= v_~x$r_buff1_thd0~0_166 |v_ULTIMATE.start_main_#t~ite56_46|)))) (= v_~x$flush_delayed~0_36 0) (let ((.cse26 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite43_45|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_40| |v_ULTIMATE.start_main_#t~ite44_35|) (= v_~x$w_buff1~0_115 v_~x$w_buff1~0_114) .cse26 .cse11) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_114) (or (and .cse15 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_115) .cse26) (and .cse0 (let ((.cse27 (= |v_ULTIMATE.start_main_#t~ite43_50| v_~x$w_buff1~0_115))) (or (and .cse13 .cse27) (and .cse3 .cse14 .cse27))) .cse14 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite44_40|) .cse2))))) (or (and (= |v_ULTIMATE.start_main_#t~ite38_42| |v_ULTIMATE.start_main_#t~ite38_37|) .cse15 (= v_~x~0_189 v_~x~0_217)) (and (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x~0_217) .cse0 .cse14 (or (and .cse3 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite38_42|) .cse14) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x$w_buff1~0_115))) .cse2)) (= v_~x$mem_tmp~0_22 v_~x~0_189) (let ((.cse28 (= |v_ULTIMATE.start_main_#t~ite52_59| |v_ULTIMATE.start_main_#t~ite52_64|))) (or (and (or (and .cse0 (or .cse3 .cse23) .cse1 (or (and (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite52_64|) .cse5) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite52_64| 0) .cse1)) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite52_64|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite53_58|) (or .cse7 (and .cse24 .cse29) .cse9))) .cse10 (= v_~x$r_buff0_thd0~0_229 |v_ULTIMATE.start_main_#t~ite53_58|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff0_thd0~0_229) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite53_53|) .cse11))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_108, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_41|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_57|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_27|, ~x~0=v_~x~0_189} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_24|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_30|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_40|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_229, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ~x$w_buff1~0=v_~x$w_buff1~0_114, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_28|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_30|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_166, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_30|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_52|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_40|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, ~weak$$choice0~0=v_~weak$$choice0~0_11, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_56|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_26|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_187} AuxVars[|v_ULTIMATE.start_main_#t~ite40_62|, |v_ULTIMATE.start_main_#t~ite49_44|, |v_ULTIMATE.start_main_#t~ite47_44|, |v_ULTIMATE.start_main_#t~ite43_50|, |v_ULTIMATE.start_main_#t~ite44_40|, |v_ULTIMATE.start_main_#t~ite46_56|, |v_ULTIMATE.start_main_#t~ite50_36|, |v_ULTIMATE.start_main_#t~ite53_58|, |v_ULTIMATE.start_main_#t~ite38_42|, |v_ULTIMATE.start_main_#t~ite55_50|, |v_ULTIMATE.start_main_#t~ite52_64|, v_~x~0_217, |v_ULTIMATE.start_main_#t~ite56_46|, |v_ULTIMATE.start_main_#t~ite41_56|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet36, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet37, ~weak$$choice2~0, ~x~0][50], [Black: 184#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), P2Thread1of1ForFork3InUse, Black: 187#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), Black: 190#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), 68#P3EXITtrue, 71#L881true, 199#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 135#(<= ~__unbuffered_p3_EAX~0 0), Black: 200#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 203#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 212#(= ~y~0 1), Black: 145#(and (= ~__unbuffered_p2_EAX~0 0) (<= ~__unbuffered_cnt~0 0)), Black: 146#(not (= ~__unbuffered_p2_EAX~0 1)), Black: 149#(and (= ~__unbuffered_p2_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (<= ~__unbuffered_cnt~0 0)), 99#L797true, Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (not (= 2 ~x$w_buff0~0)) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 161#(and (not (= 2 ~x$w_buff0~0)) (not (= 2 ~x~0)) (not (= 2 ~x$w_buff1~0))), Black: 177#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~x~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), Black: 173#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), 52#P0EXITtrue, 118#P1EXITtrue, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse]) [2020-10-16 04:39:05,710 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2020-10-16 04:39:05,710 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2020-10-16 04:39:05,710 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2020-10-16 04:39:05,711 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2020-10-16 04:39:05,744 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] L865-->L881: Formula: (let ((.cse30 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse29 (= (mod v_~x$r_buff0_thd0~0_230 256) 0)) (.cse25 (= (mod v_~x$r_buff1_thd0~0_167 256) 0))) (let ((.cse10 (= (mod v_~weak$$choice2~0_78 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_473 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_341 256) 0)) (.cse22 (not .cse25)) (.cse3 (not .cse29)) (.cse31 (= (mod v_~x$w_buff0_used~0_474 256) 0)) (.cse7 (and .cse25 .cse29)) (.cse8 (and .cse30 .cse29))) (let ((.cse15 (or .cse31 .cse7 .cse8)) (.cse14 (not .cse31)) (.cse13 (or .cse31 .cse29)) (.cse2 (or .cse3 (not .cse30))) (.cse0 (or .cse3 .cse22)) (.cse23 (not .cse24)) (.cse5 (or .cse29 .cse9)) (.cse1 (not .cse9)) (.cse11 (not .cse10))) (and (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite49_39| |v_ULTIMATE.start_main_#t~ite49_44|))) (or (and (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite49_44| |v_ULTIMATE.start_main_#t~ite50_36|) .cse2 (let ((.cse4 (= |v_ULTIMATE.start_main_#t~ite49_44| 0))) (or (and .cse3 .cse4 .cse1) (and .cse4 .cse5)))) (and (= v_~x$w_buff1_used~0_342 |v_ULTIMATE.start_main_#t~ite50_36|) .cse6 (or .cse7 .cse8 .cse9))) .cse10 (= v_~x$w_buff1_used~0_341 |v_ULTIMATE.start_main_#t~ite50_36|)) (and .cse6 (= v_~x$w_buff1_used~0_342 v_~x$w_buff1_used~0_341) .cse11 (= |v_ULTIMATE.start_main_#t~ite50_36| |v_ULTIMATE.start_main_#t~ite50_31|)))) (= (ite (= (ite (not (and (= 2 v_~x~0_217) (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (or (and (= v_~x~0_217 v_~x~0_187) .cse10) (and (= v_~x$mem_tmp~0_22 v_~x~0_187) .cse11)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite46_51|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite47_39| |v_ULTIMATE.start_main_#t~ite47_44|) (= v_~x$w_buff0_used~0_474 v_~x$w_buff0_used~0_473) .cse11) (and (= v_~x$w_buff0_used~0_473 |v_ULTIMATE.start_main_#t~ite47_44|) (or (and .cse0 (or (and .cse13 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite46_56|)) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite46_56| 0) .cse14)) .cse14 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite47_44|) .cse2) (and .cse12 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite47_44|) .cse15)) .cse10))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite40_57|))) (or (and .cse10 (= v_~x$w_buff0~0_107 |v_ULTIMATE.start_main_#t~ite41_56|) (or (and .cse16 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite41_56|) .cse15) (and .cse0 (let ((.cse17 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite40_62|))) (or (and .cse17 .cse13) (and .cse3 .cse17 .cse14))) (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite41_56|) .cse14 .cse2))) (and .cse16 (= |v_ULTIMATE.start_main_#t~ite41_56| |v_ULTIMATE.start_main_#t~ite41_51|) (= v_~x$w_buff0~0_107 v_~x$w_buff0~0_108) .cse11))) (= |v_ULTIMATE.start_main_#t~nondet37_27| v_~weak$$choice2~0_78) (= |v_ULTIMATE.start_main_#t~nondet36_25| v_~weak$$choice0~0_11) (let ((.cse18 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite55_45|))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite56_46| |v_ULTIMATE.start_main_#t~ite56_41|) (= v_~x$r_buff1_thd0~0_167 v_~x$r_buff1_thd0~0_166) .cse11) (and (let ((.cse19 (= (mod v_~x$r_buff0_thd0~0_229 256) 0))) (or (let ((.cse21 (not .cse19))) (and (let ((.cse20 (= |v_ULTIMATE.start_main_#t~ite55_50| 0))) (or (and (or .cse19 .cse9) .cse20) (and .cse21 .cse1 .cse20))) (or .cse21 .cse22) .cse1 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite56_46|) (or .cse21 .cse23))) (and (= v_~x$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite56_46|) .cse18 (or (and .cse19 .cse24) (and .cse19 .cse25) .cse9)))) .cse10 (= v_~x$r_buff1_thd0~0_166 |v_ULTIMATE.start_main_#t~ite56_46|)))) (= v_~x$flush_delayed~0_36 0) (let ((.cse26 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite43_45|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_40| |v_ULTIMATE.start_main_#t~ite44_35|) (= v_~x$w_buff1~0_115 v_~x$w_buff1~0_114) .cse26 .cse11) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_114) (or (and .cse15 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_115) .cse26) (and .cse0 (let ((.cse27 (= |v_ULTIMATE.start_main_#t~ite43_50| v_~x$w_buff1~0_115))) (or (and .cse13 .cse27) (and .cse3 .cse14 .cse27))) .cse14 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite44_40|) .cse2))))) (or (and (= |v_ULTIMATE.start_main_#t~ite38_42| |v_ULTIMATE.start_main_#t~ite38_37|) .cse15 (= v_~x~0_189 v_~x~0_217)) (and (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x~0_217) .cse0 .cse14 (or (and .cse3 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite38_42|) .cse14) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x$w_buff1~0_115))) .cse2)) (= v_~x$mem_tmp~0_22 v_~x~0_189) (let ((.cse28 (= |v_ULTIMATE.start_main_#t~ite52_59| |v_ULTIMATE.start_main_#t~ite52_64|))) (or (and (or (and .cse0 (or .cse3 .cse23) .cse1 (or (and (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite52_64|) .cse5) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite52_64| 0) .cse1)) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite52_64|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite53_58|) (or .cse7 (and .cse24 .cse29) .cse9))) .cse10 (= v_~x$r_buff0_thd0~0_229 |v_ULTIMATE.start_main_#t~ite53_58|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff0_thd0~0_229) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite53_53|) .cse11))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_108, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_41|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_57|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_27|, ~x~0=v_~x~0_189} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_24|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_30|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_40|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_229, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ~x$w_buff1~0=v_~x$w_buff1~0_114, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_28|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_30|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_166, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_30|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_52|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_40|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, ~weak$$choice0~0=v_~weak$$choice0~0_11, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_56|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_26|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_187} AuxVars[|v_ULTIMATE.start_main_#t~ite40_62|, |v_ULTIMATE.start_main_#t~ite49_44|, |v_ULTIMATE.start_main_#t~ite47_44|, |v_ULTIMATE.start_main_#t~ite43_50|, |v_ULTIMATE.start_main_#t~ite44_40|, |v_ULTIMATE.start_main_#t~ite46_56|, |v_ULTIMATE.start_main_#t~ite50_36|, |v_ULTIMATE.start_main_#t~ite53_58|, |v_ULTIMATE.start_main_#t~ite38_42|, |v_ULTIMATE.start_main_#t~ite55_50|, |v_ULTIMATE.start_main_#t~ite52_64|, v_~x~0_217, |v_ULTIMATE.start_main_#t~ite56_46|, |v_ULTIMATE.start_main_#t~ite41_56|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet36, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet37, ~weak$$choice2~0, ~x~0][51], [Black: 184#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), P2Thread1of1ForFork3InUse, Black: 187#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), Black: 190#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), 68#P3EXITtrue, 71#L881true, 199#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 135#(<= ~__unbuffered_p3_EAX~0 0), Black: 200#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 203#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 24#L784true, Black: 145#(and (= ~__unbuffered_p2_EAX~0 0) (<= ~__unbuffered_cnt~0 0)), 25#L807true, Black: 146#(not (= ~__unbuffered_p2_EAX~0 1)), 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EAX~0 1)), Black: 149#(and (= ~__unbuffered_p2_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (<= ~__unbuffered_cnt~0 0)), 37#L754true, Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (not (= 2 ~x$w_buff0~0)) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 161#(and (not (= 2 ~x$w_buff0~0)) (not (= 2 ~x~0)) (not (= 2 ~x$w_buff1~0))), Black: 177#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~x~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), Black: 173#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse]) [2020-10-16 04:39:05,745 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2020-10-16 04:39:05,745 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2020-10-16 04:39:05,745 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2020-10-16 04:39:05,745 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2020-10-16 04:39:05,764 INFO L129 PetriNetUnfolder]: 1257/2149 cut-off events. [2020-10-16 04:39:05,764 INFO L130 PetriNetUnfolder]: For 18744/20230 co-relation queries the response was YES. [2020-10-16 04:39:05,788 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11774 conditions, 2149 events. 1257/2149 cut-off events. For 18744/20230 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 14168 event pairs, 445 based on Foata normal form. 147/2004 useless extension candidates. Maximal degree in co-relation 11747. Up to 1044 conditions per place. [2020-10-16 04:39:05,826 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 9 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2020-10-16 04:39:05,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 481 flow [2020-10-16 04:39:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 04:39:05,831 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2020-10-16 04:39:05,831 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 04:39:05,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 04:39:05,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:05,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 04:39:05,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:05,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:05,839 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:05,839 INFO L185 Difference]: Start difference. First operand has 66 places, 58 transitions, 419 flow. Second operand 5 states and 851 transitions. [2020-10-16 04:39:05,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 481 flow [2020-10-16 04:39:05,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 444 flow, removed 11 selfloop flow, removed 4 redundant places. [2020-10-16 04:39:05,860 INFO L241 Difference]: Finished difference. Result has 67 places, 59 transitions, 401 flow [2020-10-16 04:39:05,861 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2020-10-16 04:39:05,861 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2020-10-16 04:39:05,861 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 401 flow [2020-10-16 04:39:05,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:05,862 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:05,862 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:05,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:39:05,862 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:05,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1294241982, now seen corresponding path program 2 times [2020-10-16 04:39:05,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:05,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105232096] [2020-10-16 04:39:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:05,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105232096] [2020-10-16 04:39:05,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:05,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:39:05,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660788819] [2020-10-16 04:39:05,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:39:05,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:39:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:39:05,967 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2020-10-16 04:39:05,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 401 flow. Second operand 4 states. [2020-10-16 04:39:05,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:05,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2020-10-16 04:39:05,968 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:06,469 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] L865-->L881: Formula: (let ((.cse30 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse29 (= (mod v_~x$r_buff0_thd0~0_230 256) 0)) (.cse25 (= (mod v_~x$r_buff1_thd0~0_167 256) 0))) (let ((.cse10 (= (mod v_~weak$$choice2~0_78 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_473 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_341 256) 0)) (.cse22 (not .cse25)) (.cse3 (not .cse29)) (.cse31 (= (mod v_~x$w_buff0_used~0_474 256) 0)) (.cse7 (and .cse25 .cse29)) (.cse8 (and .cse30 .cse29))) (let ((.cse15 (or .cse31 .cse7 .cse8)) (.cse14 (not .cse31)) (.cse13 (or .cse31 .cse29)) (.cse2 (or .cse3 (not .cse30))) (.cse0 (or .cse3 .cse22)) (.cse23 (not .cse24)) (.cse5 (or .cse29 .cse9)) (.cse1 (not .cse9)) (.cse11 (not .cse10))) (and (let ((.cse6 (= |v_ULTIMATE.start_main_#t~ite49_39| |v_ULTIMATE.start_main_#t~ite49_44|))) (or (and (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite49_44| |v_ULTIMATE.start_main_#t~ite50_36|) .cse2 (let ((.cse4 (= |v_ULTIMATE.start_main_#t~ite49_44| 0))) (or (and .cse3 .cse4 .cse1) (and .cse4 .cse5)))) (and (= v_~x$w_buff1_used~0_342 |v_ULTIMATE.start_main_#t~ite50_36|) .cse6 (or .cse7 .cse8 .cse9))) .cse10 (= v_~x$w_buff1_used~0_341 |v_ULTIMATE.start_main_#t~ite50_36|)) (and .cse6 (= v_~x$w_buff1_used~0_342 v_~x$w_buff1_used~0_341) .cse11 (= |v_ULTIMATE.start_main_#t~ite50_36| |v_ULTIMATE.start_main_#t~ite50_31|)))) (= (ite (= (ite (not (and (= 2 v_~x~0_217) (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (or (and (= v_~x~0_217 v_~x~0_187) .cse10) (and (= v_~x$mem_tmp~0_22 v_~x~0_187) .cse11)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite46_51|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite47_39| |v_ULTIMATE.start_main_#t~ite47_44|) (= v_~x$w_buff0_used~0_474 v_~x$w_buff0_used~0_473) .cse11) (and (= v_~x$w_buff0_used~0_473 |v_ULTIMATE.start_main_#t~ite47_44|) (or (and .cse0 (or (and .cse13 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite46_56|)) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite46_56| 0) .cse14)) .cse14 (= |v_ULTIMATE.start_main_#t~ite46_56| |v_ULTIMATE.start_main_#t~ite47_44|) .cse2) (and .cse12 (= v_~x$w_buff0_used~0_474 |v_ULTIMATE.start_main_#t~ite47_44|) .cse15)) .cse10))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite40_57|))) (or (and .cse10 (= v_~x$w_buff0~0_107 |v_ULTIMATE.start_main_#t~ite41_56|) (or (and .cse16 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite41_56|) .cse15) (and .cse0 (let ((.cse17 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite40_62|))) (or (and .cse17 .cse13) (and .cse3 .cse17 .cse14))) (= |v_ULTIMATE.start_main_#t~ite40_62| |v_ULTIMATE.start_main_#t~ite41_56|) .cse14 .cse2))) (and .cse16 (= |v_ULTIMATE.start_main_#t~ite41_56| |v_ULTIMATE.start_main_#t~ite41_51|) (= v_~x$w_buff0~0_107 v_~x$w_buff0~0_108) .cse11))) (= |v_ULTIMATE.start_main_#t~nondet37_27| v_~weak$$choice2~0_78) (= |v_ULTIMATE.start_main_#t~nondet36_25| v_~weak$$choice0~0_11) (let ((.cse18 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite55_45|))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite56_46| |v_ULTIMATE.start_main_#t~ite56_41|) (= v_~x$r_buff1_thd0~0_167 v_~x$r_buff1_thd0~0_166) .cse11) (and (let ((.cse19 (= (mod v_~x$r_buff0_thd0~0_229 256) 0))) (or (let ((.cse21 (not .cse19))) (and (let ((.cse20 (= |v_ULTIMATE.start_main_#t~ite55_50| 0))) (or (and (or .cse19 .cse9) .cse20) (and .cse21 .cse1 .cse20))) (or .cse21 .cse22) .cse1 (= |v_ULTIMATE.start_main_#t~ite55_50| |v_ULTIMATE.start_main_#t~ite56_46|) (or .cse21 .cse23))) (and (= v_~x$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite56_46|) .cse18 (or (and .cse19 .cse24) (and .cse19 .cse25) .cse9)))) .cse10 (= v_~x$r_buff1_thd0~0_166 |v_ULTIMATE.start_main_#t~ite56_46|)))) (= v_~x$flush_delayed~0_36 0) (let ((.cse26 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite43_45|))) (or (and (= |v_ULTIMATE.start_main_#t~ite44_40| |v_ULTIMATE.start_main_#t~ite44_35|) (= v_~x$w_buff1~0_115 v_~x$w_buff1~0_114) .cse26 .cse11) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_114) (or (and .cse15 (= |v_ULTIMATE.start_main_#t~ite44_40| v_~x$w_buff1~0_115) .cse26) (and .cse0 (let ((.cse27 (= |v_ULTIMATE.start_main_#t~ite43_50| v_~x$w_buff1~0_115))) (or (and .cse13 .cse27) (and .cse3 .cse14 .cse27))) .cse14 (= |v_ULTIMATE.start_main_#t~ite43_50| |v_ULTIMATE.start_main_#t~ite44_40|) .cse2))))) (or (and (= |v_ULTIMATE.start_main_#t~ite38_42| |v_ULTIMATE.start_main_#t~ite38_37|) .cse15 (= v_~x~0_189 v_~x~0_217)) (and (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x~0_217) .cse0 .cse14 (or (and .cse3 (= v_~x$w_buff0~0_108 |v_ULTIMATE.start_main_#t~ite38_42|) .cse14) (and .cse13 (= |v_ULTIMATE.start_main_#t~ite38_42| v_~x$w_buff1~0_115))) .cse2)) (= v_~x$mem_tmp~0_22 v_~x~0_189) (let ((.cse28 (= |v_ULTIMATE.start_main_#t~ite52_59| |v_ULTIMATE.start_main_#t~ite52_64|))) (or (and (or (and .cse0 (or .cse3 .cse23) .cse1 (or (and (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite52_64|) .cse5) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite52_64| 0) .cse1)) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite52_64|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 |v_ULTIMATE.start_main_#t~ite53_58|) (or .cse7 (and .cse24 .cse29) .cse9))) .cse10 (= v_~x$r_buff0_thd0~0_229 |v_ULTIMATE.start_main_#t~ite53_58|)) (and .cse28 (= v_~x$r_buff0_thd0~0_230 v_~x$r_buff0_thd0~0_229) (= |v_ULTIMATE.start_main_#t~ite53_58| |v_ULTIMATE.start_main_#t~ite53_53|) .cse11))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_108, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_230, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_53|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_41|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_57|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_27|, ~x~0=v_~x~0_189} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~nondet36=|v_ULTIMATE.start_main_#t~nondet36_24|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_22, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_30|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_40|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_229, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ~x$w_buff1~0=v_~x$w_buff1~0_114, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_28|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_30|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_166, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_30|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_52|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_40|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, ~weak$$choice0~0=v_~weak$$choice0~0_11, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_56|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_26|, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_187} AuxVars[|v_ULTIMATE.start_main_#t~ite40_62|, |v_ULTIMATE.start_main_#t~ite49_44|, |v_ULTIMATE.start_main_#t~ite47_44|, |v_ULTIMATE.start_main_#t~ite43_50|, |v_ULTIMATE.start_main_#t~ite44_40|, |v_ULTIMATE.start_main_#t~ite46_56|, |v_ULTIMATE.start_main_#t~ite50_36|, |v_ULTIMATE.start_main_#t~ite53_58|, |v_ULTIMATE.start_main_#t~ite38_42|, |v_ULTIMATE.start_main_#t~ite55_50|, |v_ULTIMATE.start_main_#t~ite52_64|, v_~x~0_217, |v_ULTIMATE.start_main_#t~ite56_46|, |v_ULTIMATE.start_main_#t~ite41_56|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet36, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet37, ~weak$$choice2~0, ~x~0][61], [Black: 184#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), P2Thread1of1ForFork3InUse, Black: 187#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), Black: 190#(and (= ~x~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0)), 68#P3EXITtrue, 71#L881true, Black: 135#(<= ~__unbuffered_p3_EAX~0 0), Black: 200#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 212#(= ~y~0 1), 24#L784true, Black: 145#(and (= ~__unbuffered_p2_EAX~0 0) (<= ~__unbuffered_cnt~0 0)), Black: 146#(not (= ~__unbuffered_p2_EAX~0 1)), Black: 149#(and (= ~__unbuffered_p2_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (<= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p1_EAX~0 1)), 223#true, 99#L797true, Black: 160#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x~0 0) (not (= 2 ~x$w_buff0~0)) (<= ~x$w_buff1~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 161#(and (not (= 2 ~x$w_buff0~0)) (not (= 2 ~x~0)) (not (= 2 ~x$w_buff1~0))), Black: 177#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~x~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), 52#P0EXITtrue, Black: 173#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256)))), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse]) [2020-10-16 04:39:06,470 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2020-10-16 04:39:06,470 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2020-10-16 04:39:06,470 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2020-10-16 04:39:06,470 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2020-10-16 04:39:06,624 INFO L129 PetriNetUnfolder]: 1818/3177 cut-off events. [2020-10-16 04:39:06,624 INFO L130 PetriNetUnfolder]: For 13849/15335 co-relation queries the response was YES. [2020-10-16 04:39:06,653 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13859 conditions, 3177 events. 1818/3177 cut-off events. For 13849/15335 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 22757 event pairs, 384 based on Foata normal form. 308/3155 useless extension candidates. Maximal degree in co-relation 13832. Up to 1095 conditions per place. [2020-10-16 04:39:06,685 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 10 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2020-10-16 04:39:06,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 464 flow [2020-10-16 04:39:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:39:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:39:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2020-10-16 04:39:06,688 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8429951690821256 [2020-10-16 04:39:06,688 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2020-10-16 04:39:06,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2020-10-16 04:39:06,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:06,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2020-10-16 04:39:06,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:39:06,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:39:06,693 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:39:06,693 INFO L185 Difference]: Start difference. First operand has 67 places, 59 transitions, 401 flow. Second operand 4 states and 698 transitions. [2020-10-16 04:39:06,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 464 flow [2020-10-16 04:39:06,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 461 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:39:06,714 INFO L241 Difference]: Finished difference. Result has 69 places, 62 transitions, 451 flow [2020-10-16 04:39:06,714 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2020-10-16 04:39:06,714 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2020-10-16 04:39:06,714 INFO L481 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 451 flow [2020-10-16 04:39:06,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:39:06,714 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:06,715 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:06,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:39:06,715 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:06,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1762977951, now seen corresponding path program 1 times [2020-10-16 04:39:06,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:06,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607107989] [2020-10-16 04:39:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:06,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607107989] [2020-10-16 04:39:06,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:06,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:06,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987236963] [2020-10-16 04:39:06,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:06,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:06,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:06,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:06,811 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2020-10-16 04:39:06,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 451 flow. Second operand 5 states. [2020-10-16 04:39:06,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:06,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2020-10-16 04:39:06,813 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:07,281 INFO L129 PetriNetUnfolder]: 960/1974 cut-off events. [2020-10-16 04:39:07,281 INFO L130 PetriNetUnfolder]: For 9520/13287 co-relation queries the response was YES. [2020-10-16 04:39:07,298 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9399 conditions, 1974 events. 960/1974 cut-off events. For 9520/13287 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 15106 event pairs, 122 based on Foata normal form. 344/2057 useless extension candidates. Maximal degree in co-relation 9370. Up to 1055 conditions per place. [2020-10-16 04:39:07,320 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 11 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2020-10-16 04:39:07,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 560 flow [2020-10-16 04:39:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2020-10-16 04:39:07,325 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8434782608695652 [2020-10-16 04:39:07,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2020-10-16 04:39:07,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2020-10-16 04:39:07,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:07,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2020-10-16 04:39:07,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:07,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:07,330 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:07,330 INFO L185 Difference]: Start difference. First operand has 69 places, 62 transitions, 451 flow. Second operand 5 states and 873 transitions. [2020-10-16 04:39:07,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 560 flow [2020-10-16 04:39:07,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 551 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 04:39:07,340 INFO L241 Difference]: Finished difference. Result has 74 places, 67 transitions, 531 flow [2020-10-16 04:39:07,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2020-10-16 04:39:07,341 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2020-10-16 04:39:07,341 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 531 flow [2020-10-16 04:39:07,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:07,341 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:07,341 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:07,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:39:07,342 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1129441535, now seen corresponding path program 1 times [2020-10-16 04:39:07,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:07,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863382249] [2020-10-16 04:39:07,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:07,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863382249] [2020-10-16 04:39:07,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:07,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:39:07,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568462014] [2020-10-16 04:39:07,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:39:07,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:39:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:39:07,486 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2020-10-16 04:39:07,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 531 flow. Second operand 6 states. [2020-10-16 04:39:07,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:07,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2020-10-16 04:39:07,487 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:07,801 INFO L129 PetriNetUnfolder]: 624/1437 cut-off events. [2020-10-16 04:39:07,801 INFO L130 PetriNetUnfolder]: For 9539/14189 co-relation queries the response was YES. [2020-10-16 04:39:07,815 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7723 conditions, 1437 events. 624/1437 cut-off events. For 9539/14189 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11310 event pairs, 27 based on Foata normal form. 350/1560 useless extension candidates. Maximal degree in co-relation 7691. Up to 844 conditions per place. [2020-10-16 04:39:07,824 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 12 selfloop transitions, 17 changer transitions 0/76 dead transitions. [2020-10-16 04:39:07,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 668 flow [2020-10-16 04:39:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:39:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:39:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1048 transitions. [2020-10-16 04:39:07,828 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8438003220611916 [2020-10-16 04:39:07,828 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1048 transitions. [2020-10-16 04:39:07,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1048 transitions. [2020-10-16 04:39:07,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:07,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1048 transitions. [2020-10-16 04:39:07,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:39:07,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:39:07,834 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:39:07,834 INFO L185 Difference]: Start difference. First operand has 74 places, 67 transitions, 531 flow. Second operand 6 states and 1048 transitions. [2020-10-16 04:39:07,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 668 flow [2020-10-16 04:39:07,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 637 flow, removed 10 selfloop flow, removed 2 redundant places. [2020-10-16 04:39:07,861 INFO L241 Difference]: Finished difference. Result has 79 places, 72 transitions, 604 flow [2020-10-16 04:39:07,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2020-10-16 04:39:07,862 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2020-10-16 04:39:07,862 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 604 flow [2020-10-16 04:39:07,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:39:07,863 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:07,863 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:07,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:39:07,863 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2120527709, now seen corresponding path program 1 times [2020-10-16 04:39:07,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:07,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977038462] [2020-10-16 04:39:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:07,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977038462] [2020-10-16 04:39:07,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:07,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:07,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293663358] [2020-10-16 04:39:07,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:07,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:07,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:07,942 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 207 [2020-10-16 04:39:07,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 604 flow. Second operand 5 states. [2020-10-16 04:39:07,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:07,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 207 [2020-10-16 04:39:07,942 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:08,454 INFO L129 PetriNetUnfolder]: 1196/2790 cut-off events. [2020-10-16 04:39:08,455 INFO L130 PetriNetUnfolder]: For 18065/21757 co-relation queries the response was YES. [2020-10-16 04:39:08,480 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 2790 events. 1196/2790 cut-off events. For 18065/21757 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 25129 event pairs, 59 based on Foata normal form. 201/2536 useless extension candidates. Maximal degree in co-relation 13684. Up to 1321 conditions per place. [2020-10-16 04:39:08,495 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 7 selfloop transitions, 2 changer transitions 1/76 dead transitions. [2020-10-16 04:39:08,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 655 flow [2020-10-16 04:39:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 04:39:08,498 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2020-10-16 04:39:08,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 04:39:08,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 04:39:08,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:08,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 04:39:08,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:08,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:08,504 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:08,504 INFO L185 Difference]: Start difference. First operand has 79 places, 72 transitions, 604 flow. Second operand 5 states and 851 transitions. [2020-10-16 04:39:08,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 655 flow [2020-10-16 04:39:08,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 606 flow, removed 14 selfloop flow, removed 3 redundant places. [2020-10-16 04:39:08,608 INFO L241 Difference]: Finished difference. Result has 83 places, 73 transitions, 570 flow [2020-10-16 04:39:08,609 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=570, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2020-10-16 04:39:08,609 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2020-10-16 04:39:08,609 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 570 flow [2020-10-16 04:39:08,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:08,609 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:08,609 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:08,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:39:08,610 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 841472055, now seen corresponding path program 2 times [2020-10-16 04:39:08,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:08,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293855701] [2020-10-16 04:39:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:08,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293855701] [2020-10-16 04:39:08,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:08,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:39:08,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127175280] [2020-10-16 04:39:08,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:39:08,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:39:08,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:39:08,715 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 207 [2020-10-16 04:39:08,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 570 flow. Second operand 7 states. [2020-10-16 04:39:08,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:08,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 207 [2020-10-16 04:39:08,716 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:09,111 INFO L129 PetriNetUnfolder]: 1047/2407 cut-off events. [2020-10-16 04:39:09,111 INFO L130 PetriNetUnfolder]: For 12769/19369 co-relation queries the response was YES. [2020-10-16 04:39:09,126 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11467 conditions, 2407 events. 1047/2407 cut-off events. For 12769/19369 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 21233 event pairs, 32 based on Foata normal form. 527/2535 useless extension candidates. Maximal degree in co-relation 11436. Up to 753 conditions per place. [2020-10-16 04:39:09,133 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 5 selfloop transitions, 21 changer transitions 0/74 dead transitions. [2020-10-16 04:39:09,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 74 transitions, 630 flow [2020-10-16 04:39:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:39:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:39:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1215 transitions. [2020-10-16 04:39:09,138 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8385093167701864 [2020-10-16 04:39:09,138 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1215 transitions. [2020-10-16 04:39:09,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1215 transitions. [2020-10-16 04:39:09,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:09,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1215 transitions. [2020-10-16 04:39:09,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:39:09,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:39:09,144 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:39:09,145 INFO L185 Difference]: Start difference. First operand has 83 places, 73 transitions, 570 flow. Second operand 7 states and 1215 transitions. [2020-10-16 04:39:09,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 74 transitions, 630 flow [2020-10-16 04:39:09,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 74 transitions, 564 flow, removed 27 selfloop flow, removed 6 redundant places. [2020-10-16 04:39:09,205 INFO L241 Difference]: Finished difference. Result has 84 places, 74 transitions, 573 flow [2020-10-16 04:39:09,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=573, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2020-10-16 04:39:09,206 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2020-10-16 04:39:09,206 INFO L481 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 573 flow [2020-10-16 04:39:09,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:39:09,206 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:09,206 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:09,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:39:09,206 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1862801838, now seen corresponding path program 1 times [2020-10-16 04:39:09,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:09,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426172130] [2020-10-16 04:39:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:39:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:39:09,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426172130] [2020-10-16 04:39:09,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:39:09,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:39:09,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323996581] [2020-10-16 04:39:09,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:39:09,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:39:09,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:39:09,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:39:09,305 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2020-10-16 04:39:09,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 573 flow. Second operand 5 states. [2020-10-16 04:39:09,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:39:09,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2020-10-16 04:39:09,306 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:39:09,939 INFO L129 PetriNetUnfolder]: 2019/4606 cut-off events. [2020-10-16 04:39:09,939 INFO L130 PetriNetUnfolder]: For 21554/25517 co-relation queries the response was YES. [2020-10-16 04:39:09,981 INFO L80 FinitePrefix]: Finished finitePrefix Result has 21043 conditions, 4606 events. 2019/4606 cut-off events. For 21554/25517 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 45289 event pairs, 66 based on Foata normal form. 158/4040 useless extension candidates. Maximal degree in co-relation 21009. Up to 1441 conditions per place. [2020-10-16 04:39:09,989 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 4 selfloop transitions, 2 changer transitions 10/76 dead transitions. [2020-10-16 04:39:09,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 76 transitions, 595 flow [2020-10-16 04:39:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:39:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:39:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 878 transitions. [2020-10-16 04:39:09,992 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8483091787439614 [2020-10-16 04:39:09,993 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 878 transitions. [2020-10-16 04:39:09,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 878 transitions. [2020-10-16 04:39:09,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:39:09,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 878 transitions. [2020-10-16 04:39:09,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:39:09,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:39:09,997 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:39:09,997 INFO L185 Difference]: Start difference. First operand has 84 places, 74 transitions, 573 flow. Second operand 5 states and 878 transitions. [2020-10-16 04:39:09,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 76 transitions, 595 flow [2020-10-16 04:39:10,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 518 flow, removed 24 selfloop flow, removed 6 redundant places. [2020-10-16 04:39:10,351 INFO L241 Difference]: Finished difference. Result has 85 places, 66 transitions, 445 flow [2020-10-16 04:39:10,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2020-10-16 04:39:10,352 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2020-10-16 04:39:10,352 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 445 flow [2020-10-16 04:39:10,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:39:10,352 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:39:10,352 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:39:10,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:39:10,353 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:39:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:39:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1007447646, now seen corresponding path program 2 times [2020-10-16 04:39:10,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:39:10,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462532832] [2020-10-16 04:39:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:39:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:39:10,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:39:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:39:10,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:39:10,528 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:39:10,528 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:39:10,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:39:10,555 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,558 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,559 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,559 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,559 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,560 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,560 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,561 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,561 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,561 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,562 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,562 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,564 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,565 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,566 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,567 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,568 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,570 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:39:10,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:39:10,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:39:10 BasicIcfg [2020-10-16 04:39:10,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:39:10,662 INFO L168 Benchmark]: Toolchain (without parser) took 18007.87 ms. Allocated memory was 253.8 MB in the beginning and 810.5 MB in the end (delta: 556.8 MB). Free memory was 208.9 MB in the beginning and 408.4 MB in the end (delta: -199.5 MB). Peak memory consumption was 357.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:10,663 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory was 231.8 MB in the beginning and 231.0 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 04:39:10,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.94 ms. Allocated memory was 253.8 MB in the beginning and 319.3 MB in the end (delta: 65.5 MB). Free memory was 208.9 MB in the beginning and 268.3 MB in the end (delta: -59.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:10,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.06 ms. Allocated memory is still 319.3 MB. Free memory was 268.3 MB in the beginning and 265.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:10,671 INFO L168 Benchmark]: Boogie Preprocessor took 44.32 ms. Allocated memory is still 319.3 MB. Free memory was 265.8 MB in the beginning and 262.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:10,672 INFO L168 Benchmark]: RCFGBuilder took 2371.14 ms. Allocated memory was 319.3 MB in the beginning and 371.2 MB in the end (delta: 51.9 MB). Free memory was 262.4 MB in the beginning and 338.4 MB in the end (delta: -76.0 MB). Peak memory consumption was 144.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:10,673 INFO L168 Benchmark]: TraceAbstraction took 14649.17 ms. Allocated memory was 371.2 MB in the beginning and 810.5 MB in the end (delta: 439.4 MB). Free memory was 338.4 MB in the beginning and 408.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 369.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:39:10,683 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory was 231.8 MB in the beginning and 231.0 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 852.94 ms. Allocated memory was 253.8 MB in the beginning and 319.3 MB in the end (delta: 65.5 MB). Free memory was 208.9 MB in the beginning and 268.3 MB in the end (delta: -59.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 82.06 ms. Allocated memory is still 319.3 MB. Free memory was 268.3 MB in the beginning and 265.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 44.32 ms. Allocated memory is still 319.3 MB. Free memory was 265.8 MB in the beginning and 262.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2371.14 ms. Allocated memory was 319.3 MB in the beginning and 371.2 MB in the end (delta: 51.9 MB). Free memory was 262.4 MB in the beginning and 338.4 MB in the end (delta: -76.0 MB). Peak memory consumption was 144.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 14649.17 ms. Allocated memory was 371.2 MB in the beginning and 810.5 MB in the end (delta: 439.4 MB). Free memory was 338.4 MB in the beginning and 408.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 369.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1908 VarBasedMoverChecksPositive, 99 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 334 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 122 PlacesBefore, 45 PlacesAfterwards, 111 TransitionsBefore, 33 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 8388 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd4; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd4; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L847] 0 pthread_t t145; [L848] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] 0 pthread_t t146; [L850] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L7] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L773] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t147; [L852] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t148; [L854] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L796] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L816] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L819] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L806] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L829] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L832] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 4 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 69 SDtfs, 81 SDslu, 73 SDs, 0 SdLazy, 361 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=604occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 27262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...