./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:14:39,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:14:39,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:14:39,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:14:39,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:14:39,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:14:39,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:14:39,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:14:39,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:14:39,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:14:39,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:14:39,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:14:39,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:14:39,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:14:39,635 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:14:39,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:14:39,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:14:39,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:14:39,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:14:39,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:14:39,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:14:39,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:14:39,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:14:39,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:14:39,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:14:39,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:14:39,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:14:39,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:14:39,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:14:39,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:14:39,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:14:39,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:14:39,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:14:39,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:14:39,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:14:39,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:14:39,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:14:39,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:14:39,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:14:39,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:14:39,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:14:39,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:14:39,648 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2024-10-24 12:14:39,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:14:39,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:14:39,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:14:39,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:14:39,968 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:14:39,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 12:14:41,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:14:41,800 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:14:41,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 12:14:41,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513a4d71f/3086e2ca483e4e6c8925c985efb38500/FLAGe338a9ec0 [2024-10-24 12:14:41,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513a4d71f/3086e2ca483e4e6c8925c985efb38500 [2024-10-24 12:14:41,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:14:41,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:14:41,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:14:41,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:14:41,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:14:41,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:14:41" (1/1) ... [2024-10-24 12:14:41,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309a04ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:41, skipping insertion in model container [2024-10-24 12:14:41,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:14:41" (1/1) ... [2024-10-24 12:14:41,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:14:42,121 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2024-10-24 12:14:42,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:14:42,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:14:42,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2024-10-24 12:14:42,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:14:42,460 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:14:42,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42 WrapperNode [2024-10-24 12:14:42,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:14:42,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:14:42,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:14:42,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:14:42,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,514 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-10-24 12:14:42,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:14:42,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:14:42,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:14:42,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:14:42,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,551 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 12:14:42,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:14:42,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:14:42,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:14:42,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:14:42,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (1/1) ... [2024-10-24 12:14:42,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:14:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:14:42,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:14:42,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:14:42,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 12:14:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:14:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 12:14:42,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 12:14:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 12:14:42,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 12:14:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 12:14:42,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 12:14:42,746 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-24 12:14:42,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-24 12:14:42,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:14:42,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 12:14:42,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:14:42,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:14:42,749 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:14:42,909 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:14:42,911 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:14:43,262 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:14:43,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:14:43,485 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:14:43,486 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 12:14:43,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:14:43 BoogieIcfgContainer [2024-10-24 12:14:43,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:14:43,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:14:43,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:14:43,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:14:43,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:14:41" (1/3) ... [2024-10-24 12:14:43,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683e1b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:14:43, skipping insertion in model container [2024-10-24 12:14:43,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:14:42" (2/3) ... [2024-10-24 12:14:43,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683e1b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:14:43, skipping insertion in model container [2024-10-24 12:14:43,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:14:43" (3/3) ... [2024-10-24 12:14:43,500 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-10-24 12:14:43,519 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:14:43,519 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 12:14:43,519 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:14:43,585 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:14:43,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-10-24 12:14:43,666 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-10-24 12:14:43,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:14:43,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-10-24 12:14:43,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-10-24 12:14:43,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-10-24 12:14:43,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:14:43,694 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cae0672, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:14:43,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 12:14:43,698 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:14:43,698 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-24 12:14:43,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:14:43,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:14:43,699 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 12:14:43,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:14:43,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:14:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash 11930355, now seen corresponding path program 1 times [2024-10-24 12:14:43,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:14:43,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417571282] [2024-10-24 12:14:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:14:43,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:14:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:14:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:14:44,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:14:44,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417571282] [2024-10-24 12:14:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417571282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:14:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:14:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 12:14:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679613211] [2024-10-24 12:14:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:14:44,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:14:44,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:14:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:14:44,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:14:44,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-10-24 12:14:44,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:44,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:14:44,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-10-24 12:14:44,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:14:45,231 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2024-10-24 12:14:45,233 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-24 12:14:45,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28519 event pairs, 443 based on Foata normal form. 135/4200 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2024-10-24 12:14:45,272 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-10-24 12:14:45,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2024-10-24 12:14:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:14:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:14:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-24 12:14:45,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-10-24 12:14:45,287 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2024-10-24 12:14:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2024-10-24 12:14:45,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 12:14:45,296 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-10-24 12:14:45,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-10-24 12:14:45,306 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-10-24 12:14:45,307 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-10-24 12:14:45,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:45,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:14:45,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:14:45,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:14:45,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:14:45,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:14:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1457321110, now seen corresponding path program 1 times [2024-10-24 12:14:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:14:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684790063] [2024-10-24 12:14:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:14:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:14:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:14:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:14:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:14:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684790063] [2024-10-24 12:14:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684790063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:14:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:14:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:14:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165978883] [2024-10-24 12:14:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:14:45,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:14:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:14:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:14:45,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:14:45,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-24 12:14:45,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:45,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:14:45,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-24 12:14:45,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:14:47,387 INFO L124 PetriNetUnfolderBase]: 7779/12167 cut-off events. [2024-10-24 12:14:47,387 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-10-24 12:14:47,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23583 conditions, 12167 events. 7779/12167 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 86792 event pairs, 1033 based on Foata normal form. 400/12068 useless extension candidates. Maximal degree in co-relation 23573. Up to 5841 conditions per place. [2024-10-24 12:14:47,484 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-10-24 12:14:47,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 288 flow [2024-10-24 12:14:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:14:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:14:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-10-24 12:14:47,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2024-10-24 12:14:47,487 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 137 transitions. [2024-10-24 12:14:47,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 288 flow [2024-10-24 12:14:47,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:14:47,493 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-10-24 12:14:47,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-10-24 12:14:47,494 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-10-24 12:14:47,495 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-10-24 12:14:47,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:47,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:14:47,495 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:14:47,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:14:47,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:14:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:14:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1264106216, now seen corresponding path program 1 times [2024-10-24 12:14:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:14:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589982390] [2024-10-24 12:14:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:14:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:14:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:14:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:14:47,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:14:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589982390] [2024-10-24 12:14:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589982390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:14:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:14:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:14:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250361184] [2024-10-24 12:14:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:14:47,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:14:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:14:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:14:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:14:47,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-24 12:14:47,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:47,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:14:47,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-24 12:14:47,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:14:49,116 INFO L124 PetriNetUnfolderBase]: 6075/9467 cut-off events. [2024-10-24 12:14:49,116 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-10-24 12:14:49,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21251 conditions, 9467 events. 6075/9467 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 63571 event pairs, 451 based on Foata normal form. 364/9470 useless extension candidates. Maximal degree in co-relation 21239. Up to 3681 conditions per place. [2024-10-24 12:14:49,187 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 67 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-10-24 12:14:49,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 413 flow [2024-10-24 12:14:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:14:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:14:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-10-24 12:14:49,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-10-24 12:14:49,190 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 175 transitions. [2024-10-24 12:14:49,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 413 flow [2024-10-24 12:14:49,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 12:14:49,196 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-10-24 12:14:49,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-10-24 12:14:49,197 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-10-24 12:14:49,198 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-10-24 12:14:49,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:49,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:14:49,198 INFO L204 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] [2024-10-24 12:14:49,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:14:49,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:14:49,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:14:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1510528105, now seen corresponding path program 1 times [2024-10-24 12:14:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:14:49,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417216497] [2024-10-24 12:14:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:14:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:14:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:14:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:14:49,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:14:49,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417216497] [2024-10-24 12:14:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417216497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:14:49,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:14:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:14:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255235541] [2024-10-24 12:14:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:14:49,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:14:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:14:49,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:14:49,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:14:49,548 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-24 12:14:49,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:49,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:14:49,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-24 12:14:49,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:14:50,442 INFO L124 PetriNetUnfolderBase]: 4027/6115 cut-off events. [2024-10-24 12:14:50,443 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-10-24 12:14:50,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 6115 events. 4027/6115 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35758 event pairs, 289 based on Foata normal form. 244/6151 useless extension candidates. Maximal degree in co-relation 15551. Up to 1788 conditions per place. [2024-10-24 12:14:50,488 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 80 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-10-24 12:14:50,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 544 flow [2024-10-24 12:14:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:14:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 12:14:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-10-24 12:14:50,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717687074829932 [2024-10-24 12:14:50,491 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 211 transitions. [2024-10-24 12:14:50,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 544 flow [2024-10-24 12:14:50,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 514 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-24 12:14:50,519 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-10-24 12:14:50,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-10-24 12:14:50,520 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-10-24 12:14:50,520 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-10-24 12:14:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:50,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:14:50,521 INFO L204 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, 1] [2024-10-24 12:14:50,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:14:50,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:14:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:14:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 157947390, now seen corresponding path program 1 times [2024-10-24 12:14:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:14:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066632379] [2024-10-24 12:14:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:14:50,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:14:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:14:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:14:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:14:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066632379] [2024-10-24 12:14:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066632379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:14:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:14:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:14:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146277353] [2024-10-24 12:14:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:14:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:14:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:14:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:14:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:14:50,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-24 12:14:50,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:50,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:14:50,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-24 12:14:50,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:14:51,699 INFO L124 PetriNetUnfolderBase]: 2863/4163 cut-off events. [2024-10-24 12:14:51,699 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-10-24 12:14:51,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 4163 events. 2863/4163 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21805 event pairs, 231 based on Foata normal form. 96/4131 useless extension candidates. Maximal degree in co-relation 11575. Up to 1316 conditions per place. [2024-10-24 12:14:51,737 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-10-24 12:14:51,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 534 flow [2024-10-24 12:14:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:14:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 12:14:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-10-24 12:14:51,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-10-24 12:14:51,740 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-10-24 12:14:51,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 534 flow [2024-10-24 12:14:51,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 488 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-24 12:14:51,774 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-10-24 12:14:51,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-10-24 12:14:51,776 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-10-24 12:14:51,776 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-10-24 12:14:51,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:51,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:14:51,777 INFO L204 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:14:51,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:14:51,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:14:51,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:14:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1391379549, now seen corresponding path program 1 times [2024-10-24 12:14:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:14:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200991270] [2024-10-24 12:14:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:14:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:14:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:14:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:14:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:14:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200991270] [2024-10-24 12:14:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200991270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:14:53,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:14:53,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:14:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64728031] [2024-10-24 12:14:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:14:53,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:14:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:14:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:14:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:14:53,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-10-24 12:14:53,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:53,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:14:53,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-10-24 12:14:53,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:14:55,900 INFO L124 PetriNetUnfolderBase]: 12572/19031 cut-off events. [2024-10-24 12:14:55,901 INFO L125 PetriNetUnfolderBase]: For 8076/8408 co-relation queries the response was YES. [2024-10-24 12:14:56,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44513 conditions, 19031 events. 12572/19031 cut-off events. For 8076/8408 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 130424 event pairs, 889 based on Foata normal form. 16/18477 useless extension candidates. Maximal degree in co-relation 44497. Up to 2832 conditions per place. [2024-10-24 12:14:56,084 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 117 selfloop transitions, 34 changer transitions 14/189 dead transitions. [2024-10-24 12:14:56,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 189 transitions, 900 flow [2024-10-24 12:14:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:14:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 12:14:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 342 transitions. [2024-10-24 12:14:56,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.634508348794063 [2024-10-24 12:14:56,087 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 11 states and 342 transitions. [2024-10-24 12:14:56,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 189 transitions, 900 flow [2024-10-24 12:14:56,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 189 transitions, 774 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-10-24 12:14:56,372 INFO L231 Difference]: Finished difference. Result has 76 places, 87 transitions, 418 flow [2024-10-24 12:14:56,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=418, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2024-10-24 12:14:56,373 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2024-10-24 12:14:56,373 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 87 transitions, 418 flow [2024-10-24 12:14:56,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:56,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:14:56,375 INFO L204 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:14:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:14:56,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:14:56,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:14:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash -670785643, now seen corresponding path program 2 times [2024-10-24 12:14:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:14:56,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533637215] [2024-10-24 12:14:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:14:56,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:14:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:14:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:14:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:14:56,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533637215] [2024-10-24 12:14:56,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533637215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:14:56,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:14:56,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:14:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944270821] [2024-10-24 12:14:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:14:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:14:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:14:56,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:14:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:14:56,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-10-24 12:14:56,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 87 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:14:56,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:14:56,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-10-24 12:14:56,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:15:00,170 INFO L124 PetriNetUnfolderBase]: 20310/30754 cut-off events. [2024-10-24 12:15:00,170 INFO L125 PetriNetUnfolderBase]: For 30348/30387 co-relation queries the response was YES. [2024-10-24 12:15:00,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85932 conditions, 30754 events. 20310/30754 cut-off events. For 30348/30387 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 227838 event pairs, 4585 based on Foata normal form. 31/29337 useless extension candidates. Maximal degree in co-relation 85911. Up to 13040 conditions per place. [2024-10-24 12:15:00,415 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 90 selfloop transitions, 28 changer transitions 25/167 dead transitions. [2024-10-24 12:15:00,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 167 transitions, 1074 flow [2024-10-24 12:15:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:15:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 12:15:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-10-24 12:15:00,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2024-10-24 12:15:00,418 INFO L175 Difference]: Start difference. First operand has 76 places, 87 transitions, 418 flow. Second operand 6 states and 183 transitions. [2024-10-24 12:15:00,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 167 transitions, 1074 flow [2024-10-24 12:15:00,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 167 transitions, 1068 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-24 12:15:00,598 INFO L231 Difference]: Finished difference. Result has 81 places, 101 transitions, 621 flow [2024-10-24 12:15:00,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=621, PETRI_PLACES=81, PETRI_TRANSITIONS=101} [2024-10-24 12:15:00,599 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2024-10-24 12:15:00,599 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 101 transitions, 621 flow [2024-10-24 12:15:00,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:15:00,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:15:00,600 INFO L204 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:15:00,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:15:00,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:15:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:15:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 442295347, now seen corresponding path program 3 times [2024-10-24 12:15:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:15:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039559125] [2024-10-24 12:15:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:15:00,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:15:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:15:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:15:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:15:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039559125] [2024-10-24 12:15:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039559125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:15:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:15:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:15:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954544413] [2024-10-24 12:15:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:15:01,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:15:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:15:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:15:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:15:01,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-10-24 12:15:01,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 101 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:15:01,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:15:01,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-10-24 12:15:01,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:15:02,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 26#L811true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 50#L771true, Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 39#L847true, 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:02,540 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-24 12:15:02,540 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:15:02,540 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:15:02,540 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:15:02,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][60], [60#true, 26#L811true, 161#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 50#L771true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#$Ultimate##0true, 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:02,554 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-24 12:15:02,554 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:15:02,554 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:15:02,554 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:15:03,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 26#L811true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 50#L771true, Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 39#L847true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:03,025 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,025 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,025 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,025 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][60], [60#true, 26#L811true, 161#true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 50#L771true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#$Ultimate##0true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:03,096 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,096 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,097 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,097 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:15:03,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 24#P0EXITtrue, 26#L811true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 39#L847true, 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:03,571 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,571 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,575 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,575 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 26#L811true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 50#L771true, Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:03,844 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,844 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,844 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,844 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][82], [60#true, 26#L811true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 50#L771true, 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 168#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:03,846 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,846 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,846 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,846 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][60], [60#true, 24#P0EXITtrue, 26#L811true, 161#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#$Ultimate##0true, 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:03,852 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,852 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,852 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:03,852 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:15:04,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 24#P0EXITtrue, 26#L811true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 39#L847true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,106 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,106 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,107 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,107 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 26#L811true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 50#L771true, 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,110 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,110 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,110 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,110 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 26#L811true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 17#L774true, Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,119 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,119 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,119 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,119 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][82], [60#true, 26#L811true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 50#L771true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 10#P3EXITtrue, 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 168#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,158 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,158 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,158 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,158 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][60], [60#true, 24#P0EXITtrue, 26#L811true, 161#true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#$Ultimate##0true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,165 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,165 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,165 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,165 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:15:04,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 26#L811true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 17#L774true, Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,578 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,578 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,578 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,578 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 24#P0EXITtrue, 26#L811true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 22#L871-4true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,592 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,592 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,592 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,592 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][82], [60#true, 24#P0EXITtrue, 26#L811true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 22#L871-4true, 168#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,626 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,626 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,626 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,626 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:15:04,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][61], [60#true, 24#P0EXITtrue, 26#L811true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, 56#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 10#P3EXITtrue, Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), 163#(= ~x~0 1), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:04,969 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-24 12:15:04,969 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 12:15:04,969 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 12:15:04,969 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 12:15:05,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][82], [60#true, 24#P0EXITtrue, 26#L811true, 14#L872true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 62#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, 97#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 132#(and (<= (mod ~a$w_buff0_used~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 10#P3EXITtrue, 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 119#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 124#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L781true, 168#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 58#true, Black: 154#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 156#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 149#(= ~y~0 1)]) [2024-10-24 12:15:05,013 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-24 12:15:05,013 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 12:15:05,014 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 12:15:05,014 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 12:15:06,297 INFO L124 PetriNetUnfolderBase]: 26796/42896 cut-off events. [2024-10-24 12:15:06,297 INFO L125 PetriNetUnfolderBase]: For 44414/46309 co-relation queries the response was YES. [2024-10-24 12:15:06,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114452 conditions, 42896 events. 26796/42896 cut-off events. For 44414/46309 co-relation queries the response was YES. Maximal size of possible extension queue 2737. Compared 368025 event pairs, 7569 based on Foata normal form. 783/40627 useless extension candidates. Maximal degree in co-relation 114427. Up to 16098 conditions per place. [2024-10-24 12:15:06,640 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 62 selfloop transitions, 2 changer transitions 47/166 dead transitions. [2024-10-24 12:15:06,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 166 transitions, 1148 flow [2024-10-24 12:15:06,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:15:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 12:15:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-10-24 12:15:06,641 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6360544217687075 [2024-10-24 12:15:06,641 INFO L175 Difference]: Start difference. First operand has 81 places, 101 transitions, 621 flow. Second operand 6 states and 187 transitions. [2024-10-24 12:15:06,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 166 transitions, 1148 flow [2024-10-24 12:15:06,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 166 transitions, 1138 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-10-24 12:15:06,878 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 599 flow [2024-10-24 12:15:06,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=599, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2024-10-24 12:15:06,879 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2024-10-24 12:15:06,879 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 599 flow [2024-10-24 12:15:06,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:15:06,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:15:06,879 INFO L204 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:15:06,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:15:06,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-24 12:15:06,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:15:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash -173955031, now seen corresponding path program 4 times [2024-10-24 12:15:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:15:06,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48505106] [2024-10-24 12:15:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:15:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:15:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:15:07,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:15:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:15:07,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:15:07,383 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:15:07,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-24 12:15:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-24 12:15:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-24 12:15:07,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-24 12:15:07,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-24 12:15:07,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-24 12:15:07,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-24 12:15:07,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:15:07,388 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-24 12:15:07,507 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 12:15:07,508 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 12:15:07,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:15:07 BasicIcfg [2024-10-24 12:15:07,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 12:15:07,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 12:15:07,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 12:15:07,519 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 12:15:07,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:14:43" (3/4) ... [2024-10-24 12:15:07,520 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 12:15:07,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 12:15:07,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 12:15:07,633 INFO L158 Benchmark]: Toolchain (without parser) took 25791.73ms. Allocated memory was 176.2MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 102.6MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 549.1MB. Max. memory is 16.1GB. [2024-10-24 12:15:07,633 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 176.2MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:15:07,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.21ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 75.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 12:15:07,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.61ms. Allocated memory is still 176.2MB. Free memory was 75.6MB in the beginning and 73.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 12:15:07,634 INFO L158 Benchmark]: Boogie Preprocessor took 56.85ms. Allocated memory is still 176.2MB. Free memory was 73.1MB in the beginning and 69.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 12:15:07,634 INFO L158 Benchmark]: RCFGBuilder took 913.80ms. Allocated memory is still 176.2MB. Free memory was 69.1MB in the beginning and 90.2MB in the end (delta: -21.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 12:15:07,634 INFO L158 Benchmark]: TraceAbstraction took 24028.57ms. Allocated memory was 176.2MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 89.9MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 821.8MB. Max. memory is 16.1GB. [2024-10-24 12:15:07,635 INFO L158 Benchmark]: Witness Printer took 113.52ms. Allocated memory is still 6.3GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 12:15:07,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 176.2MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.21ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 75.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.61ms. Allocated memory is still 176.2MB. Free memory was 75.6MB in the beginning and 73.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.85ms. Allocated memory is still 176.2MB. Free memory was 73.1MB in the beginning and 69.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 913.80ms. Allocated memory is still 176.2MB. Free memory was 69.1MB in the beginning and 90.2MB in the end (delta: -21.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24028.57ms. Allocated memory was 176.2MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 89.9MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 821.8MB. Max. memory is 16.1GB. * Witness Printer took 113.52ms. Allocated memory is still 6.3GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t771; [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L800] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=0] [L803] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L820] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1488 IncrementalHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 61 mSDtfsCounter, 1488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621occurred in iteration=7, InterpolantAutomatonStates: 48, 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.8s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2024-10-24 12:15:07,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE