./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:07:46,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:07:46,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:07:46,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:07:46,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:07:46,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:07:46,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:07:46,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:07:46,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:07:46,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:07:46,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:07:46,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:07:46,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:07:46,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:07:46,784 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:07:46,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:07:46,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:07:46,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:07:46,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:07:46,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:07:46,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:07:46,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:07:46,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:07:46,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:07:46,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:07:46,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:07:46,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:07:46,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:07:46,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:07:46,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:07:46,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:07:46,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:07:46,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:07:46,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:07:46,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:07:46,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:07:46,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:07:46,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:07:46,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:07:46,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:07:46,791 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:07:46,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:07:46,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:07:46,792 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 02:07:46,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:07:47,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:07:47,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:07:47,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:07:47,004 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:07:47,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 02:07:48,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:07:48,296 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:07:48,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 02:07:48,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf8cd96e/fa49e41b9be24051a87f27fad98bffdd/FLAGbb6f3a1db [2024-06-28 02:07:48,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf8cd96e/fa49e41b9be24051a87f27fad98bffdd [2024-06-28 02:07:48,325 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:07:48,326 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:07:48,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 02:07:48,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:07:48,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:07:48,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:07:48,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:07:48,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:07:48,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:07:48" (1/2) ... [2024-06-28 02:07:48,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba04b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:07:48, skipping insertion in model container [2024-06-28 02:07:48,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:07:48" (1/2) ... [2024-06-28 02:07:48,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2947444b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:07:48, skipping insertion in model container [2024-06-28 02:07:48,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:07:48" (2/2) ... [2024-06-28 02:07:48,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba04b0e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48, skipping insertion in model container [2024-06-28 02:07:48,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:07:48" (2/2) ... [2024-06-28 02:07:48,433 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:07:48,481 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:07:48,482 INFO L97 edCorrectnessWitness]: Location invariant before [L811-L811] ((((((((((((((! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 02:07:48,483 INFO L97 edCorrectnessWitness]: Location invariant before [L810-L810] ((((((((((((((! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 02:07:48,483 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:07:48,483 INFO L106 edCorrectnessWitness]: ghost_update [L808-L808] multithreaded = 1; [2024-06-28 02:07:48,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:07:48,659 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-06-28 02:07:48,827 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:07:48,838 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:07:48,871 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:07:48,944 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:07:48,973 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:07:48,974 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48 WrapperNode [2024-06-28 02:07:48,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:07:48,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:07:48,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:07:48,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:07:48,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,070 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 109 [2024-06-28 02:07:49,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:07:49,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:07:49,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:07:49,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:07:49,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,123 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-06-28 02:07:49,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:07:49,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:07:49,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:07:49,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:07:49,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (1/1) ... [2024-06-28 02:07:49,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:07:49,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:07:49,181 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-06-28 02:07:49,197 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-06-28 02:07:49,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:07:49,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:07:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:07:49,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:07:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:07:49,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:07:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:07:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:07:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:07:49,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:07:49,212 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:07:49,333 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:07:49,335 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:07:49,564 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:07:49,564 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:07:49,709 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:07:49,709 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:07:49,709 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:07:49 BoogieIcfgContainer [2024-06-28 02:07:49,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:07:49,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:07:49,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:07:49,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:07:49,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:07:48" (1/4) ... [2024-06-28 02:07:49,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28978244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:07:49, skipping insertion in model container [2024-06-28 02:07:49,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:07:48" (2/4) ... [2024-06-28 02:07:49,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28978244 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:07:49, skipping insertion in model container [2024-06-28 02:07:49,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:07:48" (3/4) ... [2024-06-28 02:07:49,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28978244 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:07:49, skipping insertion in model container [2024-06-28 02:07:49,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:07:49" (4/4) ... [2024-06-28 02:07:49,719 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 02:07:49,733 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:07:49,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 02:07:49,733 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:07:49,773 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:07:49,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 02:07:49,836 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-28 02:07:49,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:07:49,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-28 02:07:49,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 02:07:49,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-28 02:07:49,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:07:49,861 INFO L357 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, mHoare=false, 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;@1090dafb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:07:49,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 02:07:49,877 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:07:49,877 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:07:49,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:07:49,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:49,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:07:49,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:49,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash 307898557, now seen corresponding path program 1 times [2024-06-28 02:07:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:49,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001103205] [2024-06-28 02:07:49,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:49,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001103205] [2024-06-28 02:07:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001103205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:50,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:07:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552526694] [2024-06-28 02:07:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:50,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:07:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:07:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:07:50,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-28 02:07:50,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-06-28 02:07:50,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:50,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-28 02:07:50,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:50,817 INFO L124 PetriNetUnfolderBase]: 385/803 cut-off events. [2024-06-28 02:07:50,818 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-28 02:07:50,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 803 events. 385/803 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4352 event pairs, 271 based on Foata normal form. 38/761 useless extension candidates. Maximal degree in co-relation 1467. Up to 624 conditions per place. [2024-06-28 02:07:50,823 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-28 02:07:50,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 169 flow [2024-06-28 02:07:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:07:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:07:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-28 02:07:50,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-06-28 02:07:50,833 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 75 transitions. [2024-06-28 02:07:50,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 169 flow [2024-06-28 02:07:50,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:07:50,836 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 96 flow [2024-06-28 02:07:50,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2024-06-28 02:07:50,840 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-28 02:07:50,840 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 96 flow [2024-06-28 02:07:50,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-06-28 02:07:50,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:50,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:07:50,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:07:50,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:50,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 307899458, now seen corresponding path program 1 times [2024-06-28 02:07:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:50,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610463167] [2024-06-28 02:07:50,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610463167] [2024-06-28 02:07:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610463167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:07:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827144150] [2024-06-28 02:07:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:50,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:07:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:07:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:07:50,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-28 02:07:50,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-06-28 02:07:50,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:50,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-28 02:07:50,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:50,950 INFO L124 PetriNetUnfolderBase]: 149/343 cut-off events. [2024-06-28 02:07:50,950 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-28 02:07:50,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 343 events. 149/343 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1712 event pairs, 30 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 681. Up to 218 conditions per place. [2024-06-28 02:07:50,952 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 23 selfloop transitions, 3 changer transitions 2/44 dead transitions. [2024-06-28 02:07:50,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 167 flow [2024-06-28 02:07:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:07:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:07:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-28 02:07:50,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-06-28 02:07:50,954 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 96 flow. Second operand 3 states and 79 transitions. [2024-06-28 02:07:50,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 167 flow [2024-06-28 02:07:50,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:07:50,956 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 88 flow [2024-06-28 02:07:50,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-28 02:07:50,956 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-28 02:07:50,957 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 88 flow [2024-06-28 02:07:50,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-06-28 02:07:50,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:50,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:50,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:07:50,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:50,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -461382653, now seen corresponding path program 1 times [2024-06-28 02:07:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:50,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728723016] [2024-06-28 02:07:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:51,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728723016] [2024-06-28 02:07:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728723016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:07:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55636779] [2024-06-28 02:07:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:51,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:07:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:51,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:07:51,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:07:51,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-28 02:07:51,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06-28 02:07:51,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:51,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-28 02:07:51,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:51,650 INFO L124 PetriNetUnfolderBase]: 296/619 cut-off events. [2024-06-28 02:07:51,651 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-06-28 02:07:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 619 events. 296/619 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3218 event pairs, 117 based on Foata normal form. 4/590 useless extension candidates. Maximal degree in co-relation 1263. Up to 470 conditions per place. [2024-06-28 02:07:51,654 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 35 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-28 02:07:51,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 218 flow [2024-06-28 02:07:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:07:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:07:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-06-28 02:07:51,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2024-06-28 02:07:51,657 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 88 flow. Second operand 4 states and 89 transitions. [2024-06-28 02:07:51,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 218 flow [2024-06-28 02:07:51,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:07:51,660 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 129 flow [2024-06-28 02:07:51,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-28 02:07:51,661 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-06-28 02:07:51,661 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 129 flow [2024-06-28 02:07:51,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06-28 02:07:51,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:51,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:51,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:07:51,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:51,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1417959006, now seen corresponding path program 1 times [2024-06-28 02:07:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:51,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610418818] [2024-06-28 02:07:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610418818] [2024-06-28 02:07:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610418818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:52,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:07:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7917822] [2024-06-28 02:07:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:52,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:07:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:07:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:07:52,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 02:07:52,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-06-28 02:07:52,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:52,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 02:07:52,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:52,354 INFO L124 PetriNetUnfolderBase]: 355/727 cut-off events. [2024-06-28 02:07:52,354 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2024-06-28 02:07:52,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 727 events. 355/727 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3797 event pairs, 135 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 1700. Up to 568 conditions per place. [2024-06-28 02:07:52,358 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 46 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2024-06-28 02:07:52,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 311 flow [2024-06-28 02:07:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:07:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:07:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-06-28 02:07:52,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2024-06-28 02:07:52,362 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 129 flow. Second operand 5 states and 104 transitions. [2024-06-28 02:07:52,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 311 flow [2024-06-28 02:07:52,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 302 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 02:07:52,366 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 186 flow [2024-06-28 02:07:52,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2024-06-28 02:07:52,368 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-28 02:07:52,368 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 186 flow [2024-06-28 02:07:52,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-06-28 02:07:52,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:52,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:52,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:07:52,369 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:52,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1782812486, now seen corresponding path program 1 times [2024-06-28 02:07:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007739790] [2024-06-28 02:07:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:52,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007739790] [2024-06-28 02:07:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007739790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:07:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697437358] [2024-06-28 02:07:53,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:53,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:07:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:07:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:07:53,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 02:07:53,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-06-28 02:07:53,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:53,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 02:07:53,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:53,284 INFO L124 PetriNetUnfolderBase]: 352/746 cut-off events. [2024-06-28 02:07:53,284 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2024-06-28 02:07:53,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 746 events. 352/746 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3964 event pairs, 144 based on Foata normal form. 2/712 useless extension candidates. Maximal degree in co-relation 1848. Up to 538 conditions per place. [2024-06-28 02:07:53,289 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 55 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2024-06-28 02:07:53,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 426 flow [2024-06-28 02:07:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:07:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:07:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-06-28 02:07:53,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-06-28 02:07:53,291 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 186 flow. Second operand 6 states and 125 transitions. [2024-06-28 02:07:53,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 426 flow [2024-06-28 02:07:53,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 426 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 02:07:53,293 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 283 flow [2024-06-28 02:07:53,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-28 02:07:53,294 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2024-06-28 02:07:53,294 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 283 flow [2024-06-28 02:07:53,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-06-28 02:07:53,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:53,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:53,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:07:53,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:53,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1153927743, now seen corresponding path program 1 times [2024-06-28 02:07:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:53,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359093811] [2024-06-28 02:07:53,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:53,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:54,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:54,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359093811] [2024-06-28 02:07:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359093811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:54,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:54,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:07:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163420304] [2024-06-28 02:07:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:07:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:54,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:07:54,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:07:54,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 02:07:54,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-06-28 02:07:54,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:54,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 02:07:54,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:54,345 INFO L124 PetriNetUnfolderBase]: 348/730 cut-off events. [2024-06-28 02:07:54,346 INFO L125 PetriNetUnfolderBase]: For 871/871 co-relation queries the response was YES. [2024-06-28 02:07:54,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 730 events. 348/730 cut-off events. For 871/871 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3816 event pairs, 101 based on Foata normal form. 4/700 useless extension candidates. Maximal degree in co-relation 2064. Up to 500 conditions per place. [2024-06-28 02:07:54,350 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 58 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2024-06-28 02:07:54,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 501 flow [2024-06-28 02:07:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:07:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:07:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-28 02:07:54,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-28 02:07:54,352 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 283 flow. Second operand 7 states and 140 transitions. [2024-06-28 02:07:54,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 501 flow [2024-06-28 02:07:54,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 497 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 02:07:54,355 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 305 flow [2024-06-28 02:07:54,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2024-06-28 02:07:54,356 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-06-28 02:07:54,356 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 305 flow [2024-06-28 02:07:54,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-06-28 02:07:54,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:54,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:54,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:07:54,357 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:54,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1525064298, now seen corresponding path program 1 times [2024-06-28 02:07:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68477285] [2024-06-28 02:07:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68477285] [2024-06-28 02:07:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68477285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:54,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:07:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703644828] [2024-06-28 02:07:54,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:54,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:07:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:07:54,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:07:54,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:07:54,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 305 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:54,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:54,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:07:54,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:55,155 INFO L124 PetriNetUnfolderBase]: 474/914 cut-off events. [2024-06-28 02:07:55,155 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2024-06-28 02:07:55,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 914 events. 474/914 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4714 event pairs, 112 based on Foata normal form. 3/881 useless extension candidates. Maximal degree in co-relation 2759. Up to 621 conditions per place. [2024-06-28 02:07:55,161 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 66 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-28 02:07:55,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 589 flow [2024-06-28 02:07:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:07:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:07:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-28 02:07:55,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2024-06-28 02:07:55,163 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 305 flow. Second operand 7 states and 132 transitions. [2024-06-28 02:07:55,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 589 flow [2024-06-28 02:07:55,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 548 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-28 02:07:55,168 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 329 flow [2024-06-28 02:07:55,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-28 02:07:55,170 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2024-06-28 02:07:55,170 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 329 flow [2024-06-28 02:07:55,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:55,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:55,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:07:55,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:55,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1524944328, now seen corresponding path program 2 times [2024-06-28 02:07:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:55,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702292242] [2024-06-28 02:07:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:55,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702292242] [2024-06-28 02:07:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702292242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:55,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:55,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:07:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644705087] [2024-06-28 02:07:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:55,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:07:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:55,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:07:55,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:07:55,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:07:55,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:55,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:55,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:07:55,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:56,085 INFO L124 PetriNetUnfolderBase]: 540/1031 cut-off events. [2024-06-28 02:07:56,086 INFO L125 PetriNetUnfolderBase]: For 1823/1823 co-relation queries the response was YES. [2024-06-28 02:07:56,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 1031 events. 540/1031 cut-off events. For 1823/1823 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5427 event pairs, 117 based on Foata normal form. 3/993 useless extension candidates. Maximal degree in co-relation 3248. Up to 751 conditions per place. [2024-06-28 02:07:56,092 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 67 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2024-06-28 02:07:56,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 599 flow [2024-06-28 02:07:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:07:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:07:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 02:07:56,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-28 02:07:56,093 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 329 flow. Second operand 7 states and 127 transitions. [2024-06-28 02:07:56,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 599 flow [2024-06-28 02:07:56,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 576 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:07:56,098 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 375 flow [2024-06-28 02:07:56,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=375, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-28 02:07:56,099 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-06-28 02:07:56,099 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 375 flow [2024-06-28 02:07:56,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:56,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:56,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:56,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:07:56,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:56,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash 560873036, now seen corresponding path program 1 times [2024-06-28 02:07:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796954799] [2024-06-28 02:07:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:56,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796954799] [2024-06-28 02:07:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796954799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:56,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:56,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:07:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108813856] [2024-06-28 02:07:56,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:56,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:07:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:07:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:07:56,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:07:56,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 375 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:56,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:56,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:07:56,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:57,021 INFO L124 PetriNetUnfolderBase]: 536/942 cut-off events. [2024-06-28 02:07:57,022 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2024-06-28 02:07:57,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 942 events. 536/942 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4697 event pairs, 72 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 3257. Up to 724 conditions per place. [2024-06-28 02:07:57,027 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 59 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2024-06-28 02:07:57,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 589 flow [2024-06-28 02:07:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:07:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:07:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-28 02:07:57,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-06-28 02:07:57,028 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 375 flow. Second operand 5 states and 94 transitions. [2024-06-28 02:07:57,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 589 flow [2024-06-28 02:07:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 81 transitions, 554 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 02:07:57,033 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 402 flow [2024-06-28 02:07:57,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-06-28 02:07:57,034 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2024-06-28 02:07:57,034 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 402 flow [2024-06-28 02:07:57,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:57,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:57,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:57,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:07:57,035 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:57,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1615335832, now seen corresponding path program 3 times [2024-06-28 02:07:57,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:57,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611647397] [2024-06-28 02:07:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611647397] [2024-06-28 02:07:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611647397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:57,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:57,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:07:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327692558] [2024-06-28 02:07:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:57,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:07:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:07:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:07:57,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:07:57,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:57,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:57,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:07:57,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:57,868 INFO L124 PetriNetUnfolderBase]: 530/1016 cut-off events. [2024-06-28 02:07:57,869 INFO L125 PetriNetUnfolderBase]: For 2290/2290 co-relation queries the response was YES. [2024-06-28 02:07:57,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 1016 events. 530/1016 cut-off events. For 2290/2290 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5495 event pairs, 128 based on Foata normal form. 3/978 useless extension candidates. Maximal degree in co-relation 3394. Up to 752 conditions per place. [2024-06-28 02:07:57,875 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 65 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2024-06-28 02:07:57,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 628 flow [2024-06-28 02:07:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:07:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:07:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-28 02:07:57,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2024-06-28 02:07:57,876 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 402 flow. Second operand 6 states and 113 transitions. [2024-06-28 02:07:57,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 628 flow [2024-06-28 02:07:57,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 602 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:07:57,883 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 414 flow [2024-06-28 02:07:57,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2024-06-28 02:07:57,885 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2024-06-28 02:07:57,885 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 414 flow [2024-06-28 02:07:57,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06-28 02:07:57,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:57,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:57,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:07:57,886 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:57,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash 560882925, now seen corresponding path program 1 times [2024-06-28 02:07:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:57,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695687831] [2024-06-28 02:07:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:58,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695687831] [2024-06-28 02:07:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695687831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:58,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:07:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400501716] [2024-06-28 02:07:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:58,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:07:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:58,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:07:58,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:07:58,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:07:58,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 414 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:07:58,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:58,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:07:58,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:07:59,027 INFO L124 PetriNetUnfolderBase]: 527/1026 cut-off events. [2024-06-28 02:07:59,027 INFO L125 PetriNetUnfolderBase]: For 2698/2698 co-relation queries the response was YES. [2024-06-28 02:07:59,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 1026 events. 527/1026 cut-off events. For 2698/2698 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5543 event pairs, 162 based on Foata normal form. 2/989 useless extension candidates. Maximal degree in co-relation 3419. Up to 805 conditions per place. [2024-06-28 02:07:59,033 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 62 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-06-28 02:07:59,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 77 transitions, 594 flow [2024-06-28 02:07:59,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:07:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:07:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-28 02:07:59,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-28 02:07:59,036 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 414 flow. Second operand 5 states and 87 transitions. [2024-06-28 02:07:59,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 77 transitions, 594 flow [2024-06-28 02:07:59,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 77 transitions, 551 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 02:07:59,041 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 391 flow [2024-06-28 02:07:59,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2024-06-28 02:07:59,042 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2024-06-28 02:07:59,042 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 391 flow [2024-06-28 02:07:59,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:07:59,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:07:59,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:07:59,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:07:59,043 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:07:59,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:07:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash 803251578, now seen corresponding path program 1 times [2024-06-28 02:07:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:07:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189764855] [2024-06-28 02:07:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:07:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:07:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:07:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:07:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:07:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189764855] [2024-06-28 02:07:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189764855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:07:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:07:59,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:07:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968533830] [2024-06-28 02:07:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:07:59,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:07:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:07:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:07:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:07:59,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:07:59,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 391 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:07:59,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:07:59,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:07:59,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:00,195 INFO L124 PetriNetUnfolderBase]: 592/1094 cut-off events. [2024-06-28 02:08:00,195 INFO L125 PetriNetUnfolderBase]: For 2530/2530 co-relation queries the response was YES. [2024-06-28 02:08:00,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1094 events. 592/1094 cut-off events. For 2530/2530 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5830 event pairs, 110 based on Foata normal form. 3/1063 useless extension candidates. Maximal degree in co-relation 3576. Up to 614 conditions per place. [2024-06-28 02:08:00,201 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 83 selfloop transitions, 28 changer transitions 0/118 dead transitions. [2024-06-28 02:08:00,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 118 transitions, 795 flow [2024-06-28 02:08:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 02:08:00,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546031746031746 [2024-06-28 02:08:00,203 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 391 flow. Second operand 9 states and 172 transitions. [2024-06-28 02:08:00,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 118 transitions, 795 flow [2024-06-28 02:08:00,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 118 transitions, 779 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-28 02:08:00,208 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 500 flow [2024-06-28 02:08:00,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=500, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-28 02:08:00,209 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2024-06-28 02:08:00,209 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 500 flow [2024-06-28 02:08:00,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:00,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:00,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:00,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:08:00,210 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:00,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:00,210 INFO L85 PathProgramCache]: Analyzing trace with hash 807060858, now seen corresponding path program 2 times [2024-06-28 02:08:00,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:00,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142621243] [2024-06-28 02:08:00,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:00,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:00,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:00,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142621243] [2024-06-28 02:08:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142621243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:00,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:00,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:08:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145471690] [2024-06-28 02:08:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:00,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:08:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:08:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:08:01,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:01,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 500 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:01,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:01,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:01,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:01,398 INFO L124 PetriNetUnfolderBase]: 646/1259 cut-off events. [2024-06-28 02:08:01,399 INFO L125 PetriNetUnfolderBase]: For 4237/4237 co-relation queries the response was YES. [2024-06-28 02:08:01,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4556 conditions, 1259 events. 646/1259 cut-off events. For 4237/4237 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7153 event pairs, 302 based on Foata normal form. 1/1213 useless extension candidates. Maximal degree in co-relation 4519. Up to 967 conditions per place. [2024-06-28 02:08:01,406 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 81 selfloop transitions, 27 changer transitions 0/115 dead transitions. [2024-06-28 02:08:01,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 955 flow [2024-06-28 02:08:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-28 02:08:01,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-28 02:08:01,408 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 500 flow. Second operand 9 states and 146 transitions. [2024-06-28 02:08:01,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 955 flow [2024-06-28 02:08:01,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 909 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 02:08:01,415 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 746 flow [2024-06-28 02:08:01,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=746, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2024-06-28 02:08:01,416 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2024-06-28 02:08:01,416 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 746 flow [2024-06-28 02:08:01,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:01,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:01,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:01,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:08:01,417 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:01,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash -23554752, now seen corresponding path program 3 times [2024-06-28 02:08:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:01,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291684556] [2024-06-28 02:08:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291684556] [2024-06-28 02:08:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291684556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:08:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283830527] [2024-06-28 02:08:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:02,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:08:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:02,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:08:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:08:02,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:02,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 746 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:02,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:02,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:02,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:02,659 INFO L124 PetriNetUnfolderBase]: 807/1542 cut-off events. [2024-06-28 02:08:02,659 INFO L125 PetriNetUnfolderBase]: For 5840/5840 co-relation queries the response was YES. [2024-06-28 02:08:02,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6119 conditions, 1542 events. 807/1542 cut-off events. For 5840/5840 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9110 event pairs, 257 based on Foata normal form. 3/1490 useless extension candidates. Maximal degree in co-relation 6075. Up to 1052 conditions per place. [2024-06-28 02:08:02,673 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 113 selfloop transitions, 44 changer transitions 0/164 dead transitions. [2024-06-28 02:08:02,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 164 transitions, 1559 flow [2024-06-28 02:08:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-28 02:08:02,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2024-06-28 02:08:02,675 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 746 flow. Second operand 9 states and 164 transitions. [2024-06-28 02:08:02,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 164 transitions, 1559 flow [2024-06-28 02:08:02,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1503 flow, removed 27 selfloop flow, removed 1 redundant places. [2024-06-28 02:08:02,689 INFO L231 Difference]: Finished difference. Result has 100 places, 123 transitions, 1240 flow [2024-06-28 02:08:02,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1240, PETRI_PLACES=100, PETRI_TRANSITIONS=123} [2024-06-28 02:08:02,690 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 61 predicate places. [2024-06-28 02:08:02,690 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 123 transitions, 1240 flow [2024-06-28 02:08:02,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:02,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:02,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:02,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:08:02,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:02,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash 207196071, now seen corresponding path program 1 times [2024-06-28 02:08:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341009511] [2024-06-28 02:08:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:03,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:03,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341009511] [2024-06-28 02:08:03,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341009511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:03,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:03,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:08:03,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233563383] [2024-06-28 02:08:03,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:03,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:08:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:03,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:08:03,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:08:03,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:03,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 123 transitions, 1240 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:03,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:03,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:03,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:03,794 INFO L124 PetriNetUnfolderBase]: 815/1565 cut-off events. [2024-06-28 02:08:03,795 INFO L125 PetriNetUnfolderBase]: For 7695/7701 co-relation queries the response was YES. [2024-06-28 02:08:03,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7094 conditions, 1565 events. 815/1565 cut-off events. For 7695/7701 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9415 event pairs, 173 based on Foata normal form. 8/1506 useless extension candidates. Maximal degree in co-relation 7043. Up to 1065 conditions per place. [2024-06-28 02:08:03,805 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 111 selfloop transitions, 38 changer transitions 0/156 dead transitions. [2024-06-28 02:08:03,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 156 transitions, 1720 flow [2024-06-28 02:08:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:08:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:08:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-28 02:08:03,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-28 02:08:03,807 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 1240 flow. Second operand 6 states and 115 transitions. [2024-06-28 02:08:03,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 156 transitions, 1720 flow [2024-06-28 02:08:03,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 156 transitions, 1702 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-28 02:08:03,823 INFO L231 Difference]: Finished difference. Result has 107 places, 130 transitions, 1441 flow [2024-06-28 02:08:03,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1441, PETRI_PLACES=107, PETRI_TRANSITIONS=130} [2024-06-28 02:08:03,824 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2024-06-28 02:08:03,824 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 130 transitions, 1441 flow [2024-06-28 02:08:03,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:03,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:03,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:03,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:08:03,825 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:03,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:03,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1998829216, now seen corresponding path program 4 times [2024-06-28 02:08:03,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:03,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108167597] [2024-06-28 02:08:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108167597] [2024-06-28 02:08:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108167597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:04,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:04,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:08:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214868027] [2024-06-28 02:08:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:04,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:08:04,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:04,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:08:04,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:08:04,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:04,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 130 transitions, 1441 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:04,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:04,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:04,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:04,961 INFO L124 PetriNetUnfolderBase]: 835/1614 cut-off events. [2024-06-28 02:08:04,961 INFO L125 PetriNetUnfolderBase]: For 10048/10048 co-relation queries the response was YES. [2024-06-28 02:08:04,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 1614 events. 835/1614 cut-off events. For 10048/10048 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9761 event pairs, 327 based on Foata normal form. 3/1555 useless extension candidates. Maximal degree in co-relation 7694. Up to 1193 conditions per place. [2024-06-28 02:08:04,972 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 133 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2024-06-28 02:08:04,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 162 transitions, 1903 flow [2024-06-28 02:08:04,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 02:08:04,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-28 02:08:04,974 INFO L175 Difference]: Start difference. First operand has 107 places, 130 transitions, 1441 flow. Second operand 9 states and 147 transitions. [2024-06-28 02:08:04,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 162 transitions, 1903 flow [2024-06-28 02:08:04,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 162 transitions, 1860 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:08:04,996 INFO L231 Difference]: Finished difference. Result has 113 places, 132 transitions, 1474 flow [2024-06-28 02:08:04,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1474, PETRI_PLACES=113, PETRI_TRANSITIONS=132} [2024-06-28 02:08:04,996 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2024-06-28 02:08:04,996 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 132 transitions, 1474 flow [2024-06-28 02:08:04,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-06-28 02:08:04,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:04,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:04,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:08:04,997 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:04,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1790434459, now seen corresponding path program 1 times [2024-06-28 02:08:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:04,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000349155] [2024-06-28 02:08:04,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:04,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000349155] [2024-06-28 02:08:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000349155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:05,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461392206] [2024-06-28 02:08:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:05,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:05,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:05,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 132 transitions, 1474 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:05,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:05,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:05,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:06,258 INFO L124 PetriNetUnfolderBase]: 1314/2543 cut-off events. [2024-06-28 02:08:06,258 INFO L125 PetriNetUnfolderBase]: For 14366/14366 co-relation queries the response was YES. [2024-06-28 02:08:06,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11787 conditions, 2543 events. 1314/2543 cut-off events. For 14366/14366 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17169 event pairs, 303 based on Foata normal form. 2/2447 useless extension candidates. Maximal degree in co-relation 11730. Up to 1248 conditions per place. [2024-06-28 02:08:06,280 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 179 selfloop transitions, 94 changer transitions 0/280 dead transitions. [2024-06-28 02:08:06,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 280 transitions, 3307 flow [2024-06-28 02:08:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:08:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:08:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2024-06-28 02:08:06,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-06-28 02:08:06,285 INFO L175 Difference]: Start difference. First operand has 113 places, 132 transitions, 1474 flow. Second operand 11 states and 215 transitions. [2024-06-28 02:08:06,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 280 transitions, 3307 flow [2024-06-28 02:08:06,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 280 transitions, 3127 flow, removed 37 selfloop flow, removed 9 redundant places. [2024-06-28 02:08:06,320 INFO L231 Difference]: Finished difference. Result has 121 places, 208 transitions, 2567 flow [2024-06-28 02:08:06,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2567, PETRI_PLACES=121, PETRI_TRANSITIONS=208} [2024-06-28 02:08:06,321 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 82 predicate places. [2024-06-28 02:08:06,321 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 208 transitions, 2567 flow [2024-06-28 02:08:06,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:06,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:06,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:06,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 02:08:06,322 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:06,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1953510469, now seen corresponding path program 2 times [2024-06-28 02:08:06,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:06,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627119260] [2024-06-28 02:08:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:06,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627119260] [2024-06-28 02:08:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627119260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:06,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:06,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:08:06,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065686487] [2024-06-28 02:08:06,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:06,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:08:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:06,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:08:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:08:06,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:06,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 208 transitions, 2567 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-06-28 02:08:06,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:06,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:06,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:07,405 INFO L124 PetriNetUnfolderBase]: 1397/2682 cut-off events. [2024-06-28 02:08:07,405 INFO L125 PetriNetUnfolderBase]: For 19788/19788 co-relation queries the response was YES. [2024-06-28 02:08:07,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14364 conditions, 2682 events. 1397/2682 cut-off events. For 19788/19788 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18281 event pairs, 232 based on Foata normal form. 2/2593 useless extension candidates. Maximal degree in co-relation 14304. Up to 1599 conditions per place. [2024-06-28 02:08:07,426 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 177 selfloop transitions, 93 changer transitions 0/277 dead transitions. [2024-06-28 02:08:07,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 277 transitions, 3648 flow [2024-06-28 02:08:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-28 02:08:07,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-28 02:08:07,428 INFO L175 Difference]: Start difference. First operand has 121 places, 208 transitions, 2567 flow. Second operand 9 states and 161 transitions. [2024-06-28 02:08:07,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 277 transitions, 3648 flow [2024-06-28 02:08:07,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 277 transitions, 3532 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-06-28 02:08:07,489 INFO L231 Difference]: Finished difference. Result has 131 places, 226 transitions, 3010 flow [2024-06-28 02:08:07,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2483, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3010, PETRI_PLACES=131, PETRI_TRANSITIONS=226} [2024-06-28 02:08:07,490 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 92 predicate places. [2024-06-28 02:08:07,491 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 226 transitions, 3010 flow [2024-06-28 02:08:07,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-06-28 02:08:07,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:07,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:07,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 02:08:07,491 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:07,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1793349079, now seen corresponding path program 3 times [2024-06-28 02:08:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854440865] [2024-06-28 02:08:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:08,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854440865] [2024-06-28 02:08:08,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854440865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412359980] [2024-06-28 02:08:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:08,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:08,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:08,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:08,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:08,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:08,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 226 transitions, 3010 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:08,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:08,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:08,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:09,085 INFO L124 PetriNetUnfolderBase]: 1482/2911 cut-off events. [2024-06-28 02:08:09,086 INFO L125 PetriNetUnfolderBase]: For 23393/23393 co-relation queries the response was YES. [2024-06-28 02:08:09,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15845 conditions, 2911 events. 1482/2911 cut-off events. For 23393/23393 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20561 event pairs, 349 based on Foata normal form. 14/2811 useless extension candidates. Maximal degree in co-relation 15780. Up to 1661 conditions per place. [2024-06-28 02:08:09,108 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 200 selfloop transitions, 104 changer transitions 0/311 dead transitions. [2024-06-28 02:08:09,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 311 transitions, 4322 flow [2024-06-28 02:08:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:08:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:08:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 232 transitions. [2024-06-28 02:08:09,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-06-28 02:08:09,110 INFO L175 Difference]: Start difference. First operand has 131 places, 226 transitions, 3010 flow. Second operand 12 states and 232 transitions. [2024-06-28 02:08:09,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 311 transitions, 4322 flow [2024-06-28 02:08:09,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 311 transitions, 4231 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 02:08:09,178 INFO L231 Difference]: Finished difference. Result has 142 places, 235 transitions, 3288 flow [2024-06-28 02:08:09,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2927, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3288, PETRI_PLACES=142, PETRI_TRANSITIONS=235} [2024-06-28 02:08:09,179 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 103 predicate places. [2024-06-28 02:08:09,179 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 235 transitions, 3288 flow [2024-06-28 02:08:09,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:09,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:09,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:09,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 02:08:09,179 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:09,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1792282493, now seen corresponding path program 1 times [2024-06-28 02:08:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:09,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792714408] [2024-06-28 02:08:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:09,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:09,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792714408] [2024-06-28 02:08:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792714408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:09,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:09,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872294923] [2024-06-28 02:08:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:09,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:09,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:09,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:09,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 235 transitions, 3288 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:09,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:09,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:09,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:10,730 INFO L124 PetriNetUnfolderBase]: 1666/3385 cut-off events. [2024-06-28 02:08:10,730 INFO L125 PetriNetUnfolderBase]: For 27353/27353 co-relation queries the response was YES. [2024-06-28 02:08:10,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18506 conditions, 3385 events. 1666/3385 cut-off events. For 27353/27353 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 25311 event pairs, 282 based on Foata normal form. 2/3234 useless extension candidates. Maximal degree in co-relation 18438. Up to 1845 conditions per place. [2024-06-28 02:08:10,758 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 257 selfloop transitions, 153 changer transitions 0/417 dead transitions. [2024-06-28 02:08:10,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 417 transitions, 6367 flow [2024-06-28 02:08:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-28 02:08:10,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2024-06-28 02:08:10,760 INFO L175 Difference]: Start difference. First operand has 142 places, 235 transitions, 3288 flow. Second operand 10 states and 192 transitions. [2024-06-28 02:08:10,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 417 transitions, 6367 flow [2024-06-28 02:08:10,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 417 transitions, 6067 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 02:08:10,837 INFO L231 Difference]: Finished difference. Result has 150 places, 343 transitions, 5261 flow [2024-06-28 02:08:10,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3106, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5261, PETRI_PLACES=150, PETRI_TRANSITIONS=343} [2024-06-28 02:08:10,837 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-28 02:08:10,837 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 343 transitions, 5261 flow [2024-06-28 02:08:10,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:10,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:10,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:10,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 02:08:10,838 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:10,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1603546923, now seen corresponding path program 2 times [2024-06-28 02:08:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:10,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030854887] [2024-06-28 02:08:10,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:10,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:11,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030854887] [2024-06-28 02:08:11,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030854887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:11,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:11,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731738884] [2024-06-28 02:08:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:11,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:11,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:11,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:11,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 343 transitions, 5261 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:11,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:11,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:11,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:12,543 INFO L124 PetriNetUnfolderBase]: 1907/3927 cut-off events. [2024-06-28 02:08:12,543 INFO L125 PetriNetUnfolderBase]: For 40694/40694 co-relation queries the response was YES. [2024-06-28 02:08:12,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23247 conditions, 3927 events. 1907/3927 cut-off events. For 40694/40694 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 30577 event pairs, 383 based on Foata normal form. 2/3739 useless extension candidates. Maximal degree in co-relation 23173. Up to 2175 conditions per place. [2024-06-28 02:08:12,577 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 255 selfloop transitions, 202 changer transitions 0/464 dead transitions. [2024-06-28 02:08:12,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 464 transitions, 7635 flow [2024-06-28 02:08:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-28 02:08:12,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 02:08:12,579 INFO L175 Difference]: Start difference. First operand has 150 places, 343 transitions, 5261 flow. Second operand 10 states and 190 transitions. [2024-06-28 02:08:12,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 464 transitions, 7635 flow [2024-06-28 02:08:12,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 464 transitions, 7446 flow, removed 57 selfloop flow, removed 3 redundant places. [2024-06-28 02:08:12,699 INFO L231 Difference]: Finished difference. Result has 161 places, 403 transitions, 6708 flow [2024-06-28 02:08:12,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5128, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6708, PETRI_PLACES=161, PETRI_TRANSITIONS=403} [2024-06-28 02:08:12,700 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2024-06-28 02:08:12,700 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 403 transitions, 6708 flow [2024-06-28 02:08:12,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:12,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:12,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:12,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 02:08:12,701 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:12,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash -570279723, now seen corresponding path program 3 times [2024-06-28 02:08:12,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:12,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489701579] [2024-06-28 02:08:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489701579] [2024-06-28 02:08:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489701579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315955184] [2024-06-28 02:08:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:13,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:13,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:13,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 403 transitions, 6708 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:13,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:13,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:13,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:14,418 INFO L124 PetriNetUnfolderBase]: 1917/3923 cut-off events. [2024-06-28 02:08:14,418 INFO L125 PetriNetUnfolderBase]: For 45994/45994 co-relation queries the response was YES. [2024-06-28 02:08:14,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24681 conditions, 3923 events. 1917/3923 cut-off events. For 45994/45994 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 30386 event pairs, 420 based on Foata normal form. 2/3741 useless extension candidates. Maximal degree in co-relation 24601. Up to 2495 conditions per place. [2024-06-28 02:08:14,457 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 315 selfloop transitions, 141 changer transitions 0/463 dead transitions. [2024-06-28 02:08:14,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 463 transitions, 8131 flow [2024-06-28 02:08:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-28 02:08:14,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-28 02:08:14,459 INFO L175 Difference]: Start difference. First operand has 161 places, 403 transitions, 6708 flow. Second operand 10 states and 189 transitions. [2024-06-28 02:08:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 463 transitions, 8131 flow [2024-06-28 02:08:14,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 463 transitions, 7952 flow, removed 62 selfloop flow, removed 3 redundant places. [2024-06-28 02:08:14,707 INFO L231 Difference]: Finished difference. Result has 168 places, 407 transitions, 6908 flow [2024-06-28 02:08:14,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6543, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6908, PETRI_PLACES=168, PETRI_TRANSITIONS=407} [2024-06-28 02:08:14,708 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 129 predicate places. [2024-06-28 02:08:14,708 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 407 transitions, 6908 flow [2024-06-28 02:08:14,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:14,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:14,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:14,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 02:08:14,708 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:14,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1566802737, now seen corresponding path program 4 times [2024-06-28 02:08:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:14,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070851088] [2024-06-28 02:08:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:15,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:15,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070851088] [2024-06-28 02:08:15,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070851088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:15,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:15,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:15,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933821772] [2024-06-28 02:08:15,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:15,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:15,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:15,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:15,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:15,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:15,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 407 transitions, 6908 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:15,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:15,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:15,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:16,786 INFO L124 PetriNetUnfolderBase]: 2667/5445 cut-off events. [2024-06-28 02:08:16,787 INFO L125 PetriNetUnfolderBase]: For 62363/62363 co-relation queries the response was YES. [2024-06-28 02:08:16,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33956 conditions, 5445 events. 2667/5445 cut-off events. For 62363/62363 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 45413 event pairs, 602 based on Foata normal form. 2/5198 useless extension candidates. Maximal degree in co-relation 33874. Up to 2615 conditions per place. [2024-06-28 02:08:16,833 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 351 selfloop transitions, 240 changer transitions 0/598 dead transitions. [2024-06-28 02:08:16,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 598 transitions, 10763 flow [2024-06-28 02:08:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-28 02:08:16,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2024-06-28 02:08:16,835 INFO L175 Difference]: Start difference. First operand has 168 places, 407 transitions, 6908 flow. Second operand 10 states and 192 transitions. [2024-06-28 02:08:16,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 598 transitions, 10763 flow [2024-06-28 02:08:17,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 598 transitions, 10333 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-28 02:08:17,058 INFO L231 Difference]: Finished difference. Result has 174 places, 529 transitions, 9541 flow [2024-06-28 02:08:17,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6573, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9541, PETRI_PLACES=174, PETRI_TRANSITIONS=529} [2024-06-28 02:08:17,059 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 135 predicate places. [2024-06-28 02:08:17,059 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 529 transitions, 9541 flow [2024-06-28 02:08:17,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:17,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:17,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:17,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 02:08:17,060 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:17,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash -338757477, now seen corresponding path program 5 times [2024-06-28 02:08:17,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:17,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184559922] [2024-06-28 02:08:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:17,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:17,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184559922] [2024-06-28 02:08:17,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184559922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:17,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:17,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015741481] [2024-06-28 02:08:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:17,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:17,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:17,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:17,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:17,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 529 transitions, 9541 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:17,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:17,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:17,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:19,224 INFO L124 PetriNetUnfolderBase]: 2839/5945 cut-off events. [2024-06-28 02:08:19,225 INFO L125 PetriNetUnfolderBase]: For 76706/76706 co-relation queries the response was YES. [2024-06-28 02:08:19,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37275 conditions, 5945 events. 2839/5945 cut-off events. For 76706/76706 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 51176 event pairs, 709 based on Foata normal form. 14/5666 useless extension candidates. Maximal degree in co-relation 37188. Up to 3260 conditions per place. [2024-06-28 02:08:19,277 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 369 selfloop transitions, 238 changer transitions 0/614 dead transitions. [2024-06-28 02:08:19,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 614 transitions, 11573 flow [2024-06-28 02:08:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:08:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:08:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 02:08:19,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 02:08:19,280 INFO L175 Difference]: Start difference. First operand has 174 places, 529 transitions, 9541 flow. Second operand 11 states and 209 transitions. [2024-06-28 02:08:19,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 614 transitions, 11573 flow [2024-06-28 02:08:19,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 614 transitions, 11510 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-28 02:08:19,641 INFO L231 Difference]: Finished difference. Result has 185 places, 537 transitions, 10267 flow [2024-06-28 02:08:19,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9478, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10267, PETRI_PLACES=185, PETRI_TRANSITIONS=537} [2024-06-28 02:08:19,641 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 146 predicate places. [2024-06-28 02:08:19,641 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 537 transitions, 10267 flow [2024-06-28 02:08:19,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:19,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:19,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:19,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 02:08:19,642 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:19,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -338757353, now seen corresponding path program 4 times [2024-06-28 02:08:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597963215] [2024-06-28 02:08:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597963215] [2024-06-28 02:08:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597963215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:20,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:20,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230983361] [2024-06-28 02:08:20,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:20,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:20,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:20,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:20,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:20,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:20,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 537 transitions, 10267 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:20,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:20,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:20,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:22,391 INFO L124 PetriNetUnfolderBase]: 3106/6409 cut-off events. [2024-06-28 02:08:22,392 INFO L125 PetriNetUnfolderBase]: For 88822/88822 co-relation queries the response was YES. [2024-06-28 02:08:22,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41962 conditions, 6409 events. 3106/6409 cut-off events. For 88822/88822 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 55597 event pairs, 682 based on Foata normal form. 2/6105 useless extension candidates. Maximal degree in co-relation 41871. Up to 3775 conditions per place. [2024-06-28 02:08:22,455 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 362 selfloop transitions, 325 changer transitions 0/694 dead transitions. [2024-06-28 02:08:22,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 694 transitions, 13737 flow [2024-06-28 02:08:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:08:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:08:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2024-06-28 02:08:22,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 02:08:22,457 INFO L175 Difference]: Start difference. First operand has 185 places, 537 transitions, 10267 flow. Second operand 12 states and 222 transitions. [2024-06-28 02:08:22,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 694 transitions, 13737 flow [2024-06-28 02:08:22,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 694 transitions, 13300 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 02:08:22,941 INFO L231 Difference]: Finished difference. Result has 195 places, 619 transitions, 12330 flow [2024-06-28 02:08:22,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9840, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12330, PETRI_PLACES=195, PETRI_TRANSITIONS=619} [2024-06-28 02:08:22,943 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 156 predicate places. [2024-06-28 02:08:22,943 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 619 transitions, 12330 flow [2024-06-28 02:08:22,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:22,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:22,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:22,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 02:08:22,944 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:22,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1659335219, now seen corresponding path program 1 times [2024-06-28 02:08:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:22,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151539314] [2024-06-28 02:08:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151539314] [2024-06-28 02:08:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151539314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:23,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:23,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007447176] [2024-06-28 02:08:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:23,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:23,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:23,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 619 transitions, 12330 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:23,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:23,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:23,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:25,562 INFO L124 PetriNetUnfolderBase]: 3122/6276 cut-off events. [2024-06-28 02:08:25,562 INFO L125 PetriNetUnfolderBase]: For 95407/95407 co-relation queries the response was YES. [2024-06-28 02:08:25,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43807 conditions, 6276 events. 3122/6276 cut-off events. For 95407/95407 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 53447 event pairs, 1020 based on Foata normal form. 2/6019 useless extension candidates. Maximal degree in co-relation 43710. Up to 4963 conditions per place. [2024-06-28 02:08:25,616 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 597 selfloop transitions, 60 changer transitions 0/664 dead transitions. [2024-06-28 02:08:25,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 664 transitions, 14008 flow [2024-06-28 02:08:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-28 02:08:25,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-28 02:08:25,617 INFO L175 Difference]: Start difference. First operand has 195 places, 619 transitions, 12330 flow. Second operand 9 states and 159 transitions. [2024-06-28 02:08:25,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 664 transitions, 14008 flow [2024-06-28 02:08:26,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 664 transitions, 13763 flow, removed 79 selfloop flow, removed 4 redundant places. [2024-06-28 02:08:26,135 INFO L231 Difference]: Finished difference. Result has 202 places, 626 transitions, 12343 flow [2024-06-28 02:08:26,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12089, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12343, PETRI_PLACES=202, PETRI_TRANSITIONS=626} [2024-06-28 02:08:26,136 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 163 predicate places. [2024-06-28 02:08:26,136 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 626 transitions, 12343 flow [2024-06-28 02:08:26,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:26,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:26,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:26,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 02:08:26,137 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:26,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash -220669797, now seen corresponding path program 6 times [2024-06-28 02:08:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842348348] [2024-06-28 02:08:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842348348] [2024-06-28 02:08:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842348348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893859485] [2024-06-28 02:08:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:26,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:26,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:26,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 626 transitions, 12343 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:26,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:26,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:26,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:28,711 INFO L124 PetriNetUnfolderBase]: 3165/6422 cut-off events. [2024-06-28 02:08:28,711 INFO L125 PetriNetUnfolderBase]: For 97572/97572 co-relation queries the response was YES. [2024-06-28 02:08:28,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44004 conditions, 6422 events. 3165/6422 cut-off events. For 97572/97572 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 54967 event pairs, 1141 based on Foata normal form. 14/6158 useless extension candidates. Maximal degree in co-relation 43903. Up to 4515 conditions per place. [2024-06-28 02:08:28,795 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 582 selfloop transitions, 100 changer transitions 0/689 dead transitions. [2024-06-28 02:08:28,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 689 transitions, 14300 flow [2024-06-28 02:08:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 02:08:28,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 02:08:28,797 INFO L175 Difference]: Start difference. First operand has 202 places, 626 transitions, 12343 flow. Second operand 10 states and 185 transitions. [2024-06-28 02:08:28,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 689 transitions, 14300 flow [2024-06-28 02:08:29,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 689 transitions, 14122 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 02:08:29,431 INFO L231 Difference]: Finished difference. Result has 206 places, 627 transitions, 12420 flow [2024-06-28 02:08:29,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12171, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12420, PETRI_PLACES=206, PETRI_TRANSITIONS=627} [2024-06-28 02:08:29,432 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 167 predicate places. [2024-06-28 02:08:29,432 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 627 transitions, 12420 flow [2024-06-28 02:08:29,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:29,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:29,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:29,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 02:08:29,433 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:29,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash -220669673, now seen corresponding path program 5 times [2024-06-28 02:08:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869464443] [2024-06-28 02:08:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:30,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869464443] [2024-06-28 02:08:30,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869464443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:30,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299922265] [2024-06-28 02:08:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:30,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:30,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:30,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:30,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 627 transitions, 12420 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:30,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:30,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:30,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:32,156 INFO L124 PetriNetUnfolderBase]: 3182/6424 cut-off events. [2024-06-28 02:08:32,157 INFO L125 PetriNetUnfolderBase]: For 96964/96964 co-relation queries the response was YES. [2024-06-28 02:08:32,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44224 conditions, 6424 events. 3182/6424 cut-off events. For 96964/96964 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 54926 event pairs, 1084 based on Foata normal form. 2/6159 useless extension candidates. Maximal degree in co-relation 44123. Up to 4756 conditions per place. [2024-06-28 02:08:32,225 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 552 selfloop transitions, 140 changer transitions 0/699 dead transitions. [2024-06-28 02:08:32,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 699 transitions, 14543 flow [2024-06-28 02:08:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 02:08:32,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 02:08:32,227 INFO L175 Difference]: Start difference. First operand has 206 places, 627 transitions, 12420 flow. Second operand 10 states and 185 transitions. [2024-06-28 02:08:32,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 699 transitions, 14543 flow [2024-06-28 02:08:32,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 699 transitions, 14348 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 02:08:32,753 INFO L231 Difference]: Finished difference. Result has 211 places, 637 transitions, 12819 flow [2024-06-28 02:08:32,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12237, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12819, PETRI_PLACES=211, PETRI_TRANSITIONS=637} [2024-06-28 02:08:32,754 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 172 predicate places. [2024-06-28 02:08:32,754 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 637 transitions, 12819 flow [2024-06-28 02:08:32,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:32,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:32,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:32,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 02:08:32,754 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:32,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash -869064107, now seen corresponding path program 7 times [2024-06-28 02:08:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:32,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614996310] [2024-06-28 02:08:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:33,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614996310] [2024-06-28 02:08:33,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614996310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669218504] [2024-06-28 02:08:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:33,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:33,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:33,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 637 transitions, 12819 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:33,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:33,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:33,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:35,153 INFO L124 PetriNetUnfolderBase]: 3208/6431 cut-off events. [2024-06-28 02:08:35,154 INFO L125 PetriNetUnfolderBase]: For 97989/97989 co-relation queries the response was YES. [2024-06-28 02:08:35,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44925 conditions, 6431 events. 3208/6431 cut-off events. For 97989/97989 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 54262 event pairs, 643 based on Foata normal form. 2/6175 useless extension candidates. Maximal degree in co-relation 44821. Up to 4076 conditions per place. [2024-06-28 02:08:35,238 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 470 selfloop transitions, 223 changer transitions 0/700 dead transitions. [2024-06-28 02:08:35,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 700 transitions, 15012 flow [2024-06-28 02:08:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 02:08:35,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 02:08:35,240 INFO L175 Difference]: Start difference. First operand has 211 places, 637 transitions, 12819 flow. Second operand 9 states and 162 transitions. [2024-06-28 02:08:35,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 700 transitions, 15012 flow [2024-06-28 02:08:35,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 700 transitions, 14730 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-28 02:08:35,943 INFO L231 Difference]: Finished difference. Result has 215 places, 653 transitions, 13498 flow [2024-06-28 02:08:35,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12543, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13498, PETRI_PLACES=215, PETRI_TRANSITIONS=653} [2024-06-28 02:08:35,944 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 176 predicate places. [2024-06-28 02:08:35,944 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 653 transitions, 13498 flow [2024-06-28 02:08:35,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:35,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:35,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:35,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 02:08:35,945 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:35,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1005701357, now seen corresponding path program 6 times [2024-06-28 02:08:35,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:35,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370049447] [2024-06-28 02:08:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:35,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:36,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:36,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370049447] [2024-06-28 02:08:36,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370049447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:36,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306635294] [2024-06-28 02:08:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:36,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:36,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:36,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:36,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:36,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:36,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 653 transitions, 13498 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:36,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:36,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:36,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:38,477 INFO L124 PetriNetUnfolderBase]: 3331/6636 cut-off events. [2024-06-28 02:08:38,478 INFO L125 PetriNetUnfolderBase]: For 103975/103975 co-relation queries the response was YES. [2024-06-28 02:08:38,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47352 conditions, 6636 events. 3331/6636 cut-off events. For 103975/103975 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 56184 event pairs, 548 based on Foata normal form. 2/6380 useless extension candidates. Maximal degree in co-relation 47246. Up to 3118 conditions per place. [2024-06-28 02:08:38,561 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 195 selfloop transitions, 527 changer transitions 0/729 dead transitions. [2024-06-28 02:08:38,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 729 transitions, 15895 flow [2024-06-28 02:08:38,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 02:08:38,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546031746031746 [2024-06-28 02:08:38,563 INFO L175 Difference]: Start difference. First operand has 215 places, 653 transitions, 13498 flow. Second operand 9 states and 172 transitions. [2024-06-28 02:08:38,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 729 transitions, 15895 flow [2024-06-28 02:08:39,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 729 transitions, 15574 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-28 02:08:39,265 INFO L231 Difference]: Finished difference. Result has 218 places, 683 transitions, 14888 flow [2024-06-28 02:08:39,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13208, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=499, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14888, PETRI_PLACES=218, PETRI_TRANSITIONS=683} [2024-06-28 02:08:39,266 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 179 predicate places. [2024-06-28 02:08:39,266 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 683 transitions, 14888 flow [2024-06-28 02:08:39,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:39,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:39,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:39,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 02:08:39,267 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:39,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash -889417071, now seen corresponding path program 8 times [2024-06-28 02:08:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591241932] [2024-06-28 02:08:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:40,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591241932] [2024-06-28 02:08:40,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591241932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:40,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:40,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582974485] [2024-06-28 02:08:40,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:40,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:40,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:40,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 683 transitions, 14888 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:40,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:40,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:40,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:41,765 INFO L124 PetriNetUnfolderBase]: 3439/6943 cut-off events. [2024-06-28 02:08:41,765 INFO L125 PetriNetUnfolderBase]: For 114595/114595 co-relation queries the response was YES. [2024-06-28 02:08:41,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50117 conditions, 6943 events. 3439/6943 cut-off events. For 114595/114595 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 59813 event pairs, 793 based on Foata normal form. 2/6657 useless extension candidates. Maximal degree in co-relation 50011. Up to 4937 conditions per place. [2024-06-28 02:08:41,853 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 506 selfloop transitions, 226 changer transitions 0/739 dead transitions. [2024-06-28 02:08:41,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 739 transitions, 16859 flow [2024-06-28 02:08:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 02:08:41,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 02:08:41,854 INFO L175 Difference]: Start difference. First operand has 218 places, 683 transitions, 14888 flow. Second operand 9 states and 162 transitions. [2024-06-28 02:08:41,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 739 transitions, 16859 flow [2024-06-28 02:08:42,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 739 transitions, 16444 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-28 02:08:42,620 INFO L231 Difference]: Finished difference. Result has 222 places, 692 transitions, 15097 flow [2024-06-28 02:08:42,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14473, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15097, PETRI_PLACES=222, PETRI_TRANSITIONS=692} [2024-06-28 02:08:42,621 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 183 predicate places. [2024-06-28 02:08:42,621 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 692 transitions, 15097 flow [2024-06-28 02:08:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:42,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:42,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:42,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 02:08:42,622 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:42,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1002904847, now seen corresponding path program 7 times [2024-06-28 02:08:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060489682] [2024-06-28 02:08:42,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:42,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060489682] [2024-06-28 02:08:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060489682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:43,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:43,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715136842] [2024-06-28 02:08:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:43,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:43,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:43,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 692 transitions, 15097 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:43,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:43,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:43,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:45,299 INFO L124 PetriNetUnfolderBase]: 3513/7101 cut-off events. [2024-06-28 02:08:45,299 INFO L125 PetriNetUnfolderBase]: For 106110/106110 co-relation queries the response was YES. [2024-06-28 02:08:45,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50669 conditions, 7101 events. 3513/7101 cut-off events. For 106110/106110 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 61787 event pairs, 695 based on Foata normal form. 2/6809 useless extension candidates. Maximal degree in co-relation 50562. Up to 4389 conditions per place. [2024-06-28 02:08:45,388 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 407 selfloop transitions, 352 changer transitions 0/766 dead transitions. [2024-06-28 02:08:45,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 766 transitions, 17526 flow [2024-06-28 02:08:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 02:08:45,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 02:08:45,389 INFO L175 Difference]: Start difference. First operand has 222 places, 692 transitions, 15097 flow. Second operand 10 states and 185 transitions. [2024-06-28 02:08:45,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 766 transitions, 17526 flow [2024-06-28 02:08:46,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 766 transitions, 17128 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-28 02:08:46,107 INFO L231 Difference]: Finished difference. Result has 227 places, 709 transitions, 15953 flow [2024-06-28 02:08:46,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14710, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=337, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15953, PETRI_PLACES=227, PETRI_TRANSITIONS=709} [2024-06-28 02:08:46,108 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 188 predicate places. [2024-06-28 02:08:46,108 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 709 transitions, 15953 flow [2024-06-28 02:08:46,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:46,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:46,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:46,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 02:08:46,109 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:46,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -886620561, now seen corresponding path program 9 times [2024-06-28 02:08:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001637572] [2024-06-28 02:08:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001637572] [2024-06-28 02:08:46,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001637572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:46,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:46,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761834558] [2024-06-28 02:08:46,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:46,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:46,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:46,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 709 transitions, 15953 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:46,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:46,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:46,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:48,875 INFO L124 PetriNetUnfolderBase]: 3685/7680 cut-off events. [2024-06-28 02:08:48,875 INFO L125 PetriNetUnfolderBase]: For 123626/123626 co-relation queries the response was YES. [2024-06-28 02:08:48,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53320 conditions, 7680 events. 3685/7680 cut-off events. For 123626/123626 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 69138 event pairs, 800 based on Foata normal form. 14/7327 useless extension candidates. Maximal degree in co-relation 53212. Up to 3991 conditions per place. [2024-06-28 02:08:48,979 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 523 selfloop transitions, 253 changer transitions 0/783 dead transitions. [2024-06-28 02:08:48,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 783 transitions, 18296 flow [2024-06-28 02:08:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:08:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:08:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 02:08:48,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 02:08:48,981 INFO L175 Difference]: Start difference. First operand has 227 places, 709 transitions, 15953 flow. Second operand 9 states and 170 transitions. [2024-06-28 02:08:48,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 783 transitions, 18296 flow [2024-06-28 02:08:49,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 783 transitions, 18061 flow, removed 68 selfloop flow, removed 4 redundant places. [2024-06-28 02:08:49,675 INFO L231 Difference]: Finished difference. Result has 232 places, 712 transitions, 16356 flow [2024-06-28 02:08:49,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=15718, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16356, PETRI_PLACES=232, PETRI_TRANSITIONS=712} [2024-06-28 02:08:49,676 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 193 predicate places. [2024-06-28 02:08:49,676 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 712 transitions, 16356 flow [2024-06-28 02:08:49,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:49,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:49,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:49,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 02:08:49,677 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:49,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash -750731279, now seen corresponding path program 2 times [2024-06-28 02:08:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632053061] [2024-06-28 02:08:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632053061] [2024-06-28 02:08:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632053061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:50,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394965229] [2024-06-28 02:08:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:50,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:50,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:50,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:50,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 712 transitions, 16356 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:50,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:50,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:50,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:52,675 INFO L124 PetriNetUnfolderBase]: 3704/7542 cut-off events. [2024-06-28 02:08:52,675 INFO L125 PetriNetUnfolderBase]: For 124329/124329 co-relation queries the response was YES. [2024-06-28 02:08:52,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54031 conditions, 7542 events. 3704/7542 cut-off events. For 124329/124329 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 66983 event pairs, 1291 based on Foata normal form. 2/7221 useless extension candidates. Maximal degree in co-relation 53922. Up to 5883 conditions per place. [2024-06-28 02:08:52,771 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 662 selfloop transitions, 83 changer transitions 0/752 dead transitions. [2024-06-28 02:08:52,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 752 transitions, 18236 flow [2024-06-28 02:08:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:08:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:08:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 02:08:52,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-28 02:08:52,772 INFO L175 Difference]: Start difference. First operand has 232 places, 712 transitions, 16356 flow. Second operand 8 states and 141 transitions. [2024-06-28 02:08:52,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 752 transitions, 18236 flow [2024-06-28 02:08:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 752 transitions, 17881 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 02:08:53,487 INFO L231 Difference]: Finished difference. Result has 236 places, 717 transitions, 16333 flow [2024-06-28 02:08:53,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=16001, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16333, PETRI_PLACES=236, PETRI_TRANSITIONS=717} [2024-06-28 02:08:53,487 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 197 predicate places. [2024-06-28 02:08:53,487 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 717 transitions, 16333 flow [2024-06-28 02:08:53,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:53,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:53,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:53,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 02:08:53,488 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:53,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -887613677, now seen corresponding path program 8 times [2024-06-28 02:08:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187346657] [2024-06-28 02:08:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187346657] [2024-06-28 02:08:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187346657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831562930] [2024-06-28 02:08:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:54,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:54,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:54,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:54,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 717 transitions, 16333 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:54,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:54,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:08:56,447 INFO L124 PetriNetUnfolderBase]: 3792/7768 cut-off events. [2024-06-28 02:08:56,447 INFO L125 PetriNetUnfolderBase]: For 123886/123886 co-relation queries the response was YES. [2024-06-28 02:08:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55340 conditions, 7768 events. 3792/7768 cut-off events. For 123886/123886 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 69408 event pairs, 1163 based on Foata normal form. 2/7431 useless extension candidates. Maximal degree in co-relation 55228. Up to 5392 conditions per place. [2024-06-28 02:08:56,545 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 557 selfloop transitions, 234 changer transitions 0/798 dead transitions. [2024-06-28 02:08:56,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 798 transitions, 19052 flow [2024-06-28 02:08:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:08:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:08:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-28 02:08:56,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-28 02:08:56,547 INFO L175 Difference]: Start difference. First operand has 236 places, 717 transitions, 16333 flow. Second operand 10 states and 182 transitions. [2024-06-28 02:08:56,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 798 transitions, 19052 flow [2024-06-28 02:08:57,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 798 transitions, 18932 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-28 02:08:57,366 INFO L231 Difference]: Finished difference. Result has 243 places, 737 transitions, 17293 flow [2024-06-28 02:08:57,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=16215, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17293, PETRI_PLACES=243, PETRI_TRANSITIONS=737} [2024-06-28 02:08:57,367 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 204 predicate places. [2024-06-28 02:08:57,367 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 737 transitions, 17293 flow [2024-06-28 02:08:57,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:57,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:08:57,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:08:57,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 02:08:57,368 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:08:57,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:08:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1843634741, now seen corresponding path program 9 times [2024-06-28 02:08:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:08:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41138210] [2024-06-28 02:08:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:08:57,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:08:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:08:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:08:58,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:08:58,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41138210] [2024-06-28 02:08:58,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41138210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:08:58,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:08:58,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:08:58,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320917826] [2024-06-28 02:08:58,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:08:58,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:08:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:08:58,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:08:58,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:08:58,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:08:58,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 737 transitions, 17293 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:08:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:08:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:08:58,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:00,529 INFO L124 PetriNetUnfolderBase]: 3992/8227 cut-off events. [2024-06-28 02:09:00,529 INFO L125 PetriNetUnfolderBase]: For 143733/143733 co-relation queries the response was YES. [2024-06-28 02:09:00,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60031 conditions, 8227 events. 3992/8227 cut-off events. For 143733/143733 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 74732 event pairs, 1284 based on Foata normal form. 2/7853 useless extension candidates. Maximal degree in co-relation 59917. Up to 6003 conditions per place. [2024-06-28 02:09:00,642 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 677 selfloop transitions, 165 changer transitions 0/849 dead transitions. [2024-06-28 02:09:00,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 849 transitions, 20949 flow [2024-06-28 02:09:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:09:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:09:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-06-28 02:09:00,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4961038961038961 [2024-06-28 02:09:00,644 INFO L175 Difference]: Start difference. First operand has 243 places, 737 transitions, 17293 flow. Second operand 11 states and 191 transitions. [2024-06-28 02:09:00,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 849 transitions, 20949 flow [2024-06-28 02:09:01,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 849 transitions, 20766 flow, removed 87 selfloop flow, removed 2 redundant places. [2024-06-28 02:09:01,637 INFO L231 Difference]: Finished difference. Result has 253 places, 786 transitions, 18912 flow [2024-06-28 02:09:01,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=17110, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18912, PETRI_PLACES=253, PETRI_TRANSITIONS=786} [2024-06-28 02:09:01,638 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 214 predicate places. [2024-06-28 02:09:01,638 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 786 transitions, 18912 flow [2024-06-28 02:09:01,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:01,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:01,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:01,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 02:09:01,639 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:01,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:01,640 INFO L85 PathProgramCache]: Analyzing trace with hash -750915977, now seen corresponding path program 10 times [2024-06-28 02:09:01,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:01,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9813960] [2024-06-28 02:09:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:02,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:02,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9813960] [2024-06-28 02:09:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9813960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:02,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193293462] [2024-06-28 02:09:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:02,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:02,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:02,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 786 transitions, 18912 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:02,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:02,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:02,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:04,921 INFO L124 PetriNetUnfolderBase]: 4222/8779 cut-off events. [2024-06-28 02:09:04,921 INFO L125 PetriNetUnfolderBase]: For 152132/152132 co-relation queries the response was YES. [2024-06-28 02:09:05,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62719 conditions, 8779 events. 4222/8779 cut-off events. For 152132/152132 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 80895 event pairs, 1279 based on Foata normal form. 16/8391 useless extension candidates. Maximal degree in co-relation 62602. Up to 5175 conditions per place. [2024-06-28 02:09:05,049 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 625 selfloop transitions, 217 changer transitions 0/849 dead transitions. [2024-06-28 02:09:05,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 849 transitions, 21260 flow [2024-06-28 02:09:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:09:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:09:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-28 02:09:05,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2024-06-28 02:09:05,051 INFO L175 Difference]: Start difference. First operand has 253 places, 786 transitions, 18912 flow. Second operand 9 states and 167 transitions. [2024-06-28 02:09:05,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 849 transitions, 21260 flow [2024-06-28 02:09:06,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 849 transitions, 20646 flow, removed 163 selfloop flow, removed 7 redundant places. [2024-06-28 02:09:06,186 INFO L231 Difference]: Finished difference. Result has 256 places, 790 transitions, 19047 flow [2024-06-28 02:09:06,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=18298, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19047, PETRI_PLACES=256, PETRI_TRANSITIONS=790} [2024-06-28 02:09:06,187 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 217 predicate places. [2024-06-28 02:09:06,187 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 790 transitions, 19047 flow [2024-06-28 02:09:06,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:06,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:06,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:06,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 02:09:06,188 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:06,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1010069833, now seen corresponding path program 3 times [2024-06-28 02:09:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:06,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898046722] [2024-06-28 02:09:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898046722] [2024-06-28 02:09:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898046722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:07,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:07,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:07,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370531367] [2024-06-28 02:09:07,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:07,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:07,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:07,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 790 transitions, 19047 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:07,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:07,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:07,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:09,266 INFO L124 PetriNetUnfolderBase]: 4238/8567 cut-off events. [2024-06-28 02:09:09,267 INFO L125 PetriNetUnfolderBase]: For 145966/145966 co-relation queries the response was YES. [2024-06-28 02:09:09,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62697 conditions, 8567 events. 4238/8567 cut-off events. For 145966/145966 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 77643 event pairs, 1426 based on Foata normal form. 2/8224 useless extension candidates. Maximal degree in co-relation 62578. Up to 6805 conditions per place. [2024-06-28 02:09:09,388 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 741 selfloop transitions, 68 changer transitions 0/816 dead transitions. [2024-06-28 02:09:09,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 816 transitions, 20847 flow [2024-06-28 02:09:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:09:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:09:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 02:09:09,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-06-28 02:09:09,390 INFO L175 Difference]: Start difference. First operand has 256 places, 790 transitions, 19047 flow. Second operand 7 states and 122 transitions. [2024-06-28 02:09:09,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 816 transitions, 20847 flow [2024-06-28 02:09:10,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 816 transitions, 20624 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-28 02:09:10,594 INFO L231 Difference]: Finished difference. Result has 258 places, 792 transitions, 19030 flow [2024-06-28 02:09:10,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=18824, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19030, PETRI_PLACES=258, PETRI_TRANSITIONS=792} [2024-06-28 02:09:10,595 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 219 predicate places. [2024-06-28 02:09:10,595 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 792 transitions, 19030 flow [2024-06-28 02:09:10,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:10,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:10,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:10,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 02:09:10,596 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:10,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2128349659, now seen corresponding path program 4 times [2024-06-28 02:09:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:10,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900057733] [2024-06-28 02:09:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:11,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:11,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900057733] [2024-06-28 02:09:11,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900057733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:11,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:11,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:11,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804456968] [2024-06-28 02:09:11,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:11,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:11,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:11,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:11,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:11,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 792 transitions, 19030 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:11,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:11,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:11,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:13,508 INFO L124 PetriNetUnfolderBase]: 4254/8553 cut-off events. [2024-06-28 02:09:13,508 INFO L125 PetriNetUnfolderBase]: For 141962/141962 co-relation queries the response was YES. [2024-06-28 02:09:13,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62725 conditions, 8553 events. 4254/8553 cut-off events. For 141962/141962 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 77111 event pairs, 1379 based on Foata normal form. 2/8221 useless extension candidates. Maximal degree in co-relation 62604. Up to 6691 conditions per place. [2024-06-28 02:09:13,626 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 714 selfloop transitions, 92 changer transitions 0/813 dead transitions. [2024-06-28 02:09:13,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 813 transitions, 20776 flow [2024-06-28 02:09:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:09:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:09:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-28 02:09:13,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 02:09:13,627 INFO L175 Difference]: Start difference. First operand has 258 places, 792 transitions, 19030 flow. Second operand 6 states and 110 transitions. [2024-06-28 02:09:13,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 813 transitions, 20776 flow [2024-06-28 02:09:14,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 813 transitions, 20707 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 02:09:14,728 INFO L231 Difference]: Finished difference. Result has 261 places, 793 transitions, 19187 flow [2024-06-28 02:09:14,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=18963, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19187, PETRI_PLACES=261, PETRI_TRANSITIONS=793} [2024-06-28 02:09:14,729 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 222 predicate places. [2024-06-28 02:09:14,730 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 793 transitions, 19187 flow [2024-06-28 02:09:14,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:14,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:14,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:14,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 02:09:14,730 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:14,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1009885259, now seen corresponding path program 10 times [2024-06-28 02:09:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133673536] [2024-06-28 02:09:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:15,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133673536] [2024-06-28 02:09:15,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133673536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:15,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:15,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17806733] [2024-06-28 02:09:15,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:15,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:15,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:15,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 793 transitions, 19187 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:15,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:15,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:15,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:17,698 INFO L124 PetriNetUnfolderBase]: 4293/9149 cut-off events. [2024-06-28 02:09:17,699 INFO L125 PetriNetUnfolderBase]: For 150702/150702 co-relation queries the response was YES. [2024-06-28 02:09:17,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64095 conditions, 9149 events. 4293/9149 cut-off events. For 150702/150702 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 85703 event pairs, 1214 based on Foata normal form. 2/8678 useless extension candidates. Maximal degree in co-relation 63973. Up to 6271 conditions per place. [2024-06-28 02:09:17,827 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 611 selfloop transitions, 248 changer transitions 0/866 dead transitions. [2024-06-28 02:09:17,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 866 transitions, 21921 flow [2024-06-28 02:09:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:09:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:09:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-28 02:09:17,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-06-28 02:09:17,829 INFO L175 Difference]: Start difference. First operand has 261 places, 793 transitions, 19187 flow. Second operand 8 states and 156 transitions. [2024-06-28 02:09:17,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 866 transitions, 21921 flow [2024-06-28 02:09:18,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 866 transitions, 21759 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 02:09:18,925 INFO L231 Difference]: Finished difference. Result has 265 places, 807 transitions, 19903 flow [2024-06-28 02:09:18,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=19027, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19903, PETRI_PLACES=265, PETRI_TRANSITIONS=807} [2024-06-28 02:09:18,927 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 226 predicate places. [2024-06-28 02:09:18,928 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 807 transitions, 19903 flow [2024-06-28 02:09:18,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:18,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:18,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:18,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 02:09:18,928 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:18,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1872327541, now seen corresponding path program 11 times [2024-06-28 02:09:18,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:18,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346112382] [2024-06-28 02:09:18,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:18,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:19,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346112382] [2024-06-28 02:09:19,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346112382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:19,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125125787] [2024-06-28 02:09:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:19,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:19,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:19,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 807 transitions, 19903 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:19,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:19,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:19,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:22,122 INFO L124 PetriNetUnfolderBase]: 4294/9076 cut-off events. [2024-06-28 02:09:22,122 INFO L125 PetriNetUnfolderBase]: For 154232/154232 co-relation queries the response was YES. [2024-06-28 02:09:22,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64618 conditions, 9076 events. 4294/9076 cut-off events. For 154232/154232 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 84672 event pairs, 1198 based on Foata normal form. 2/8627 useless extension candidates. Maximal degree in co-relation 64495. Up to 6706 conditions per place. [2024-06-28 02:09:22,232 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 743 selfloop transitions, 105 changer transitions 0/855 dead transitions. [2024-06-28 02:09:22,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 855 transitions, 22052 flow [2024-06-28 02:09:22,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:09:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:09:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-28 02:09:22,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2024-06-28 02:09:22,238 INFO L175 Difference]: Start difference. First operand has 265 places, 807 transitions, 19903 flow. Second operand 8 states and 146 transitions. [2024-06-28 02:09:22,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 855 transitions, 22052 flow [2024-06-28 02:09:23,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 855 transitions, 20372 flow, removed 100 selfloop flow, removed 10 redundant places. [2024-06-28 02:09:23,265 INFO L231 Difference]: Finished difference. Result has 264 places, 812 transitions, 18601 flow [2024-06-28 02:09:23,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=18225, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=18601, PETRI_PLACES=264, PETRI_TRANSITIONS=812} [2024-06-28 02:09:23,266 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 225 predicate places. [2024-06-28 02:09:23,266 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 812 transitions, 18601 flow [2024-06-28 02:09:23,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:23,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:23,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 02:09:23,267 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:23,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2128112075, now seen corresponding path program 11 times [2024-06-28 02:09:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915618945] [2024-06-28 02:09:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:24,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915618945] [2024-06-28 02:09:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915618945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:24,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:24,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266901327] [2024-06-28 02:09:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:24,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:24,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:24,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 812 transitions, 18601 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:24,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:24,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:24,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:26,586 INFO L124 PetriNetUnfolderBase]: 4318/9289 cut-off events. [2024-06-28 02:09:26,586 INFO L125 PetriNetUnfolderBase]: For 141229/141229 co-relation queries the response was YES. [2024-06-28 02:09:26,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62249 conditions, 9289 events. 4318/9289 cut-off events. For 141229/141229 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 88148 event pairs, 1303 based on Foata normal form. 3/8788 useless extension candidates. Maximal degree in co-relation 62128. Up to 6494 conditions per place. [2024-06-28 02:09:26,708 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 658 selfloop transitions, 204 changer transitions 0/869 dead transitions. [2024-06-28 02:09:26,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 869 transitions, 21094 flow [2024-06-28 02:09:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:09:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:09:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-28 02:09:26,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5551020408163265 [2024-06-28 02:09:26,710 INFO L175 Difference]: Start difference. First operand has 264 places, 812 transitions, 18601 flow. Second operand 7 states and 136 transitions. [2024-06-28 02:09:26,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 869 transitions, 21094 flow [2024-06-28 02:09:27,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 869 transitions, 20920 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-28 02:09:27,778 INFO L231 Difference]: Finished difference. Result has 267 places, 824 transitions, 19379 flow [2024-06-28 02:09:27,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=18434, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19379, PETRI_PLACES=267, PETRI_TRANSITIONS=824} [2024-06-28 02:09:27,781 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 228 predicate places. [2024-06-28 02:09:27,782 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 824 transitions, 19379 flow [2024-06-28 02:09:27,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:27,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:27,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:27,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 02:09:27,788 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:27,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2137612459, now seen corresponding path program 5 times [2024-06-28 02:09:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729473237] [2024-06-28 02:09:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:28,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729473237] [2024-06-28 02:09:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729473237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:28,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361012600] [2024-06-28 02:09:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:28,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:28,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:28,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:28,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 824 transitions, 19379 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:28,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:28,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:28,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:30,820 INFO L124 PetriNetUnfolderBase]: 4323/8688 cut-off events. [2024-06-28 02:09:30,820 INFO L125 PetriNetUnfolderBase]: For 142846/142846 co-relation queries the response was YES. [2024-06-28 02:09:30,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62365 conditions, 8688 events. 4323/8688 cut-off events. For 142846/142846 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 78480 event pairs, 1785 based on Foata normal form. 2/8350 useless extension candidates. Maximal degree in co-relation 62243. Up to 7139 conditions per place. [2024-06-28 02:09:30,940 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 823 selfloop transitions, 15 changer transitions 0/845 dead transitions. [2024-06-28 02:09:30,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 845 transitions, 21197 flow [2024-06-28 02:09:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:09:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:09:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-28 02:09:30,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-28 02:09:30,941 INFO L175 Difference]: Start difference. First operand has 267 places, 824 transitions, 19379 flow. Second operand 6 states and 104 transitions. [2024-06-28 02:09:30,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 845 transitions, 21197 flow [2024-06-28 02:09:32,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 845 transitions, 20862 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-28 02:09:32,142 INFO L231 Difference]: Finished difference. Result has 269 places, 827 transitions, 19118 flow [2024-06-28 02:09:32,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=19044, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19118, PETRI_PLACES=269, PETRI_TRANSITIONS=827} [2024-06-28 02:09:32,144 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 230 predicate places. [2024-06-28 02:09:32,144 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 827 transitions, 19118 flow [2024-06-28 02:09:32,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-06-28 02:09:32,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:32,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:32,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 02:09:32,145 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:32,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 890242750, now seen corresponding path program 1 times [2024-06-28 02:09:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:32,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492560850] [2024-06-28 02:09:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492560850] [2024-06-28 02:09:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492560850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:32,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:32,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:09:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872735059] [2024-06-28 02:09:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:32,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:09:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:09:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:09:32,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-06-28 02:09:32,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 827 transitions, 19118 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-06-28 02:09:32,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:32,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-06-28 02:09:32,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:35,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([300] L750-->L757: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_49 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_50 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_43 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_49 (ite .cse0 0 v_~y$w_buff0_used~0_50)) (= v_~y$w_buff1_used~0_42 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_43)) (= (ite .cse1 0 v_~y$r_buff0_thd1~0_25) v_~y$r_buff0_thd1~0_24) (= v_~y~0_18 (ite .cse0 v_~y$w_buff0~0_16 (ite .cse2 v_~y$w_buff1~0_13 v_~y~0_19))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_42 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_24 256) 0)))) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_19, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0][1213], [Black: 253#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 254#(and (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 258#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 532#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 691#true, 83#true, Black: 545#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork0InUse, Black: 542#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), 6#L757true, P1Thread1of1ForFork1InUse, Black: 298#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 46#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 227#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 53#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 54#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 570#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 711#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 314#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 316#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 145#true, Black: 320#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 579#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), Black: 582#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 343#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 287#true, Black: 603#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 604#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 353#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 354#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 352#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 358#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 620#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 617#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 373#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 371#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 636#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 141#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 657#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 396#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$w_buff0~0 1)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 394#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 476#true, Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 666#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 668#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 418#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 413#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), 383#true, Black: 422#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), 57#true, Black: 684#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (<= 0 ~y$r_buff1_thd2~0))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), 179#true, 160#true, Black: 437#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 699#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0)), Black: 700#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 2#L793true, 345#true, Black: 458#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 454#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff0_thd1~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 471#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 468#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 5#L18-5true, Black: 235#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 233#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 238#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 232#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 309#true, Black: 501#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0))]) [2024-06-28 02:09:35,218 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-28 02:09:35,219 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 02:09:35,219 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 02:09:35,219 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-28 02:09:35,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_1| 0) (= |v_P1Thread1of1ForFork1_#res.base_1| 0)) InVars {} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_1|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#res.base][962], [Black: 253#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 254#(and (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 258#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 520#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 532#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 691#true, 83#true, Black: 545#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 541#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), P0Thread1of1ForFork0InUse, Black: 542#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), 6#L757true, P1Thread1of1ForFork1InUse, Black: 298#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 46#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 300#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 227#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 53#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 54#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 570#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 711#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 322#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 317#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 314#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 316#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 145#true, Black: 320#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff0_thd1~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 68#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 579#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), Black: 582#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 343#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 287#true, Black: 603#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 604#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 353#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 349#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 354#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 101#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 352#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 358#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 620#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 617#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), Black: 114#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 373#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 377#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 371#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 636#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 141#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0)), Black: 657#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 396#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 390#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$w_buff0~0 1)), Black: 398#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 394#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 387#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), Black: 402#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (or (and (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)) (and (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 152#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), 476#true, Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 666#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 668#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 418#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 413#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$w_buff0~0 1)), 383#true, Black: 422#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1)), Black: 170#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 172#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 168#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), 57#true, Black: 684#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (or (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)) (and (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (<= 0 ~y$r_buff1_thd2~0))) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 683#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y$r_buff1_thd1~0 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= |#ghost~multithreaded| 0)) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), 179#true, 160#true, Black: 437#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 699#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0)), Black: 700#(and (= ~y$flush_delayed~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 186#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 345#true, Black: 458#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$mem_tmp~0 1) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), Black: 447#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff0_thd1~0 1) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 454#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff0_thd1~0 1) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 205#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 209#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~x~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0)), Black: 204#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$read_delayed_var~0.offset 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 471#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0)), Black: 468#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (<= 1 ~y$w_buff0_used~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (<= (div ~y$w_buff0_used~0 256) 0) (<= 0 ~y$r_buff1_thd2~0)), Black: 489#(and (= ~__unbuffered_cnt~0 0) (= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y$mem_tmp~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$w_buff0~0 1) (= ~y~0 1)), 5#L18-5true, Black: 235#(and (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 34#P1EXITtrue, Black: 240#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 233#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$read_delayed_var~0.offset 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 238#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= (* 256 (div ~y$r_buff1_thd2~0 256)) ~y$r_buff1_thd2~0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), Black: 232#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= |#ghost~multithreaded| 1) (= ~y$w_buff1_used~0 0) (= ~y$read_delayed_var~0.offset 0) (= ~y~0 0) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1)), 309#true, Black: 501#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$w_buff1~0 0) (= (* 256 (div ~y$read_delayed~0 256)) ~y$read_delayed~0) (= (* 256 (div ~y$r_buff0_thd2~0 256)) ~y$r_buff0_thd2~0) (= ~y$read_delayed_var~0.offset 0) (= (* (div ~y$flush_delayed~0 256) 256) ~y$flush_delayed~0) (<= ~y$r_buff1_thd2~0 (* 256 (div ~y$r_buff1_thd2~0 256))) (= ~y$read_delayed_var~0.base 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (= ~y$mem_tmp~0 0) (= ~y$w_buff0~0 1) (= ~y~0 1) (<= 0 ~y$r_buff1_thd2~0))]) [2024-06-28 02:09:35,220 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-28 02:09:35,220 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:09:35,220 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:09:35,220 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:09:35,380 INFO L124 PetriNetUnfolderBase]: 5979/11878 cut-off events. [2024-06-28 02:09:35,380 INFO L125 PetriNetUnfolderBase]: For 193686/194417 co-relation queries the response was YES. [2024-06-28 02:09:35,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78382 conditions, 11878 events. 5979/11878 cut-off events. For 193686/194417 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 109927 event pairs, 1891 based on Foata normal form. 408/11571 useless extension candidates. Maximal degree in co-relation 78260. Up to 6611 conditions per place. [2024-06-28 02:09:35,565 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 423 selfloop transitions, 30 changer transitions 264/1238 dead transitions. [2024-06-28 02:09:35,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1238 transitions, 28559 flow [2024-06-28 02:09:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:09:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:09:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-28 02:09:35,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-06-28 02:09:35,566 INFO L175 Difference]: Start difference. First operand has 269 places, 827 transitions, 19118 flow. Second operand 8 states and 162 transitions. [2024-06-28 02:09:35,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1238 transitions, 28559 flow [2024-06-28 02:09:37,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1238 transitions, 28503 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 02:09:37,262 INFO L231 Difference]: Finished difference. Result has 279 places, 830 transitions, 19215 flow [2024-06-28 02:09:37,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=19078, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19215, PETRI_PLACES=279, PETRI_TRANSITIONS=830} [2024-06-28 02:09:37,264 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 240 predicate places. [2024-06-28 02:09:37,264 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 830 transitions, 19215 flow [2024-06-28 02:09:37,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-06-28 02:09:37,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:37,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:37,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 02:09:37,268 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:37,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2036951744, now seen corresponding path program 1 times [2024-06-28 02:09:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:37,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101206676] [2024-06-28 02:09:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:37,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:37,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:37,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101206676] [2024-06-28 02:09:37,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101206676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:37,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:37,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:09:37,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758910096] [2024-06-28 02:09:37,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:37,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:09:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:37,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:09:37,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:09:38,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:38,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 830 transitions, 19215 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:09:38,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:38,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:38,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:41,353 INFO L124 PetriNetUnfolderBase]: 4908/10416 cut-off events. [2024-06-28 02:09:41,353 INFO L125 PetriNetUnfolderBase]: For 161850/161859 co-relation queries the response was YES. [2024-06-28 02:09:41,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71914 conditions, 10416 events. 4908/10416 cut-off events. For 161850/161859 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 100028 event pairs, 655 based on Foata normal form. 17/10410 useless extension candidates. Maximal degree in co-relation 71786. Up to 3983 conditions per place. [2024-06-28 02:09:41,482 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 643 selfloop transitions, 378 changer transitions 8/1037 dead transitions. [2024-06-28 02:09:41,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1037 transitions, 24669 flow [2024-06-28 02:09:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:09:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:09:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-28 02:09:41,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2024-06-28 02:09:41,484 INFO L175 Difference]: Start difference. First operand has 279 places, 830 transitions, 19215 flow. Second operand 11 states and 217 transitions. [2024-06-28 02:09:41,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 1037 transitions, 24669 flow [2024-06-28 02:09:42,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 1037 transitions, 24649 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-28 02:09:42,811 INFO L231 Difference]: Finished difference. Result has 288 places, 892 transitions, 21884 flow [2024-06-28 02:09:42,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=19211, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21884, PETRI_PLACES=288, PETRI_TRANSITIONS=892} [2024-06-28 02:09:42,816 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-28 02:09:42,816 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 892 transitions, 21884 flow [2024-06-28 02:09:42,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:09:42,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:42,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:42,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 02:09:42,817 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:42,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1273096714, now seen corresponding path program 2 times [2024-06-28 02:09:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:42,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353737554] [2024-06-28 02:09:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:42,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:43,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:43,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353737554] [2024-06-28 02:09:43,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353737554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:43,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:43,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586848417] [2024-06-28 02:09:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:43,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:43,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:43,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:43,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:43,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 892 transitions, 21884 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-06-28 02:09:43,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:43,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:43,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:47,335 INFO L124 PetriNetUnfolderBase]: 5405/11185 cut-off events. [2024-06-28 02:09:47,335 INFO L125 PetriNetUnfolderBase]: For 197562/197571 co-relation queries the response was YES. [2024-06-28 02:09:47,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79051 conditions, 11185 events. 5405/11185 cut-off events. For 197562/197571 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 107205 event pairs, 1504 based on Foata normal form. 17/11191 useless extension candidates. Maximal degree in co-relation 78919. Up to 3411 conditions per place. [2024-06-28 02:09:47,468 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 367 selfloop transitions, 580 changer transitions 0/955 dead transitions. [2024-06-28 02:09:47,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 955 transitions, 24443 flow [2024-06-28 02:09:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:09:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:09:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-28 02:09:47,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5628571428571428 [2024-06-28 02:09:47,470 INFO L175 Difference]: Start difference. First operand has 288 places, 892 transitions, 21884 flow. Second operand 10 states and 197 transitions. [2024-06-28 02:09:47,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 955 transitions, 24443 flow [2024-06-28 02:09:49,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 955 transitions, 24017 flow, removed 37 selfloop flow, removed 10 redundant places. [2024-06-28 02:09:49,325 INFO L231 Difference]: Finished difference. Result has 288 places, 893 transitions, 22943 flow [2024-06-28 02:09:49,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=21512, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=579, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=22943, PETRI_PLACES=288, PETRI_TRANSITIONS=893} [2024-06-28 02:09:49,326 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-28 02:09:49,326 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 893 transitions, 22943 flow [2024-06-28 02:09:49,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-06-28 02:09:49,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:49,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:49,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 02:09:49,327 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:49,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -240748354, now seen corresponding path program 3 times [2024-06-28 02:09:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:49,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783861261] [2024-06-28 02:09:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:50,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783861261] [2024-06-28 02:09:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783861261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:50,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:50,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:09:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068036237] [2024-06-28 02:09:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:50,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:09:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:09:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:09:50,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:50,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 893 transitions, 22943 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:09:50,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:50,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:50,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:53,979 INFO L124 PetriNetUnfolderBase]: 5277/10835 cut-off events. [2024-06-28 02:09:53,980 INFO L125 PetriNetUnfolderBase]: For 192979/192988 co-relation queries the response was YES. [2024-06-28 02:09:54,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76550 conditions, 10835 events. 5277/10835 cut-off events. For 192979/192988 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 103000 event pairs, 1330 based on Foata normal form. 19/10443 useless extension candidates. Maximal degree in co-relation 76419. Up to 7168 conditions per place. [2024-06-28 02:09:54,144 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 547 selfloop transitions, 438 changer transitions 0/993 dead transitions. [2024-06-28 02:09:54,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 993 transitions, 26339 flow [2024-06-28 02:09:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:09:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:09:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-28 02:09:54,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548051948051948 [2024-06-28 02:09:54,147 INFO L175 Difference]: Start difference. First operand has 288 places, 893 transitions, 22943 flow. Second operand 11 states and 211 transitions. [2024-06-28 02:09:54,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 993 transitions, 26339 flow [2024-06-28 02:09:55,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 993 transitions, 25252 flow, removed 91 selfloop flow, removed 7 redundant places. [2024-06-28 02:09:55,767 INFO L231 Difference]: Finished difference. Result has 292 places, 893 transitions, 22746 flow [2024-06-28 02:09:55,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=21856, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=438, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=22746, PETRI_PLACES=292, PETRI_TRANSITIONS=893} [2024-06-28 02:09:55,768 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 253 predicate places. [2024-06-28 02:09:55,768 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 893 transitions, 22746 flow [2024-06-28 02:09:55,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:09:55,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:09:55,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:09:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 02:09:55,769 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:09:55,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:09:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash -273820084, now seen corresponding path program 4 times [2024-06-28 02:09:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:09:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366765848] [2024-06-28 02:09:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:09:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:09:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:09:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:09:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:09:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366765848] [2024-06-28 02:09:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366765848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:09:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:09:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:09:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244455890] [2024-06-28 02:09:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:09:56,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:09:56,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:09:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:09:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:09:56,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:09:56,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 893 transitions, 22746 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-06-28 02:09:56,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:09:56,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:09:56,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:09:59,962 INFO L124 PetriNetUnfolderBase]: 5075/10472 cut-off events. [2024-06-28 02:09:59,963 INFO L125 PetriNetUnfolderBase]: For 187190/187199 co-relation queries the response was YES. [2024-06-28 02:10:00,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74501 conditions, 10472 events. 5075/10472 cut-off events. For 187190/187199 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 98367 event pairs, 1348 based on Foata normal form. 17/10046 useless extension candidates. Maximal degree in co-relation 74369. Up to 4752 conditions per place. [2024-06-28 02:10:00,116 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 364 selfloop transitions, 586 changer transitions 0/958 dead transitions. [2024-06-28 02:10:00,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 958 transitions, 25328 flow [2024-06-28 02:10:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:10:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:10:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-28 02:10:00,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5657142857142857 [2024-06-28 02:10:00,119 INFO L175 Difference]: Start difference. First operand has 292 places, 893 transitions, 22746 flow. Second operand 10 states and 198 transitions. [2024-06-28 02:10:00,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 958 transitions, 25328 flow [2024-06-28 02:10:01,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 958 transitions, 24468 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 02:10:01,862 INFO L231 Difference]: Finished difference. Result has 294 places, 893 transitions, 23074 flow [2024-06-28 02:10:01,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=21894, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23074, PETRI_PLACES=294, PETRI_TRANSITIONS=893} [2024-06-28 02:10:01,863 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 255 predicate places. [2024-06-28 02:10:01,863 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 893 transitions, 23074 flow [2024-06-28 02:10:01,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-06-28 02:10:01,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:01,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:01,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 02:10:01,864 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:10:01,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash -568600018, now seen corresponding path program 5 times [2024-06-28 02:10:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872000783] [2024-06-28 02:10:01,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:02,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872000783] [2024-06-28 02:10:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872000783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:02,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:02,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:10:02,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134408343] [2024-06-28 02:10:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:02,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:10:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:02,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:10:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:10:02,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:10:02,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 893 transitions, 23074 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:02,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:02,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:10:02,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:06,186 INFO L124 PetriNetUnfolderBase]: 5211/10998 cut-off events. [2024-06-28 02:10:06,187 INFO L125 PetriNetUnfolderBase]: For 196781/196790 co-relation queries the response was YES. [2024-06-28 02:10:06,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76250 conditions, 10998 events. 5211/10998 cut-off events. For 196781/196790 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 105840 event pairs, 1458 based on Foata normal form. 19/10509 useless extension candidates. Maximal degree in co-relation 76117. Up to 7275 conditions per place. [2024-06-28 02:10:06,336 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 583 selfloop transitions, 372 changer transitions 0/963 dead transitions. [2024-06-28 02:10:06,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 963 transitions, 25699 flow [2024-06-28 02:10:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:10:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:10:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-28 02:10:06,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5402597402597402 [2024-06-28 02:10:06,338 INFO L175 Difference]: Start difference. First operand has 294 places, 893 transitions, 23074 flow. Second operand 11 states and 208 transitions. [2024-06-28 02:10:06,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 963 transitions, 25699 flow [2024-06-28 02:10:07,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 963 transitions, 24733 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 02:10:08,005 INFO L231 Difference]: Finished difference. Result has 297 places, 893 transitions, 22870 flow [2024-06-28 02:10:08,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=22108, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=372, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=22870, PETRI_PLACES=297, PETRI_TRANSITIONS=893} [2024-06-28 02:10:08,007 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 258 predicate places. [2024-06-28 02:10:08,007 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 893 transitions, 22870 flow [2024-06-28 02:10:08,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:08,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:08,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:08,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 02:10:08,007 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:10:08,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash -498801028, now seen corresponding path program 6 times [2024-06-28 02:10:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:08,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177345956] [2024-06-28 02:10:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:08,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:08,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177345956] [2024-06-28 02:10:08,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177345956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:08,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:08,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:10:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123016627] [2024-06-28 02:10:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:08,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:10:08,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:08,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:10:08,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:10:09,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:10:09,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 893 transitions, 22870 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:09,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:09,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:10:09,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:12,310 INFO L124 PetriNetUnfolderBase]: 5198/10835 cut-off events. [2024-06-28 02:10:12,310 INFO L125 PetriNetUnfolderBase]: For 203406/203415 co-relation queries the response was YES. [2024-06-28 02:10:12,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75151 conditions, 10835 events. 5198/10835 cut-off events. For 203406/203415 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 103491 event pairs, 1713 based on Foata normal form. 19/10405 useless extension candidates. Maximal degree in co-relation 75018. Up to 7870 conditions per place. [2024-06-28 02:10:12,439 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 734 selfloop transitions, 223 changer transitions 0/965 dead transitions. [2024-06-28 02:10:12,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 965 transitions, 25532 flow [2024-06-28 02:10:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:10:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:10:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions. [2024-06-28 02:10:12,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 02:10:12,440 INFO L175 Difference]: Start difference. First operand has 297 places, 893 transitions, 22870 flow. Second operand 12 states and 220 transitions. [2024-06-28 02:10:12,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 965 transitions, 25532 flow [2024-06-28 02:10:13,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 965 transitions, 24812 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 02:10:13,784 INFO L231 Difference]: Finished difference. Result has 304 places, 899 transitions, 22859 flow [2024-06-28 02:10:13,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=22156, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=22859, PETRI_PLACES=304, PETRI_TRANSITIONS=899} [2024-06-28 02:10:13,785 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 265 predicate places. [2024-06-28 02:10:13,785 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 899 transitions, 22859 flow [2024-06-28 02:10:13,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:13,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:13,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:13,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 02:10:13,786 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:10:13,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1913419820, now seen corresponding path program 7 times [2024-06-28 02:10:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115691759] [2024-06-28 02:10:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:14,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115691759] [2024-06-28 02:10:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115691759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:14,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:10:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773213037] [2024-06-28 02:10:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:14,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:10:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:10:14,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:10:14,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:10:14,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 899 transitions, 22859 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:14,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:14,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:10:14,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:18,583 INFO L124 PetriNetUnfolderBase]: 5675/12067 cut-off events. [2024-06-28 02:10:18,584 INFO L125 PetriNetUnfolderBase]: For 211473/211482 co-relation queries the response was YES. [2024-06-28 02:10:18,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80278 conditions, 12067 events. 5675/12067 cut-off events. For 211473/211482 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 119188 event pairs, 1679 based on Foata normal form. 17/11545 useless extension candidates. Maximal degree in co-relation 80141. Up to 5283 conditions per place. [2024-06-28 02:10:18,732 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 562 selfloop transitions, 404 changer transitions 0/974 dead transitions. [2024-06-28 02:10:18,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 974 transitions, 25562 flow [2024-06-28 02:10:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 02:10:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 02:10:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-28 02:10:18,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548051948051948 [2024-06-28 02:10:18,733 INFO L175 Difference]: Start difference. First operand has 304 places, 899 transitions, 22859 flow. Second operand 11 states and 211 transitions. [2024-06-28 02:10:18,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 974 transitions, 25562 flow [2024-06-28 02:10:20,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 974 transitions, 25306 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-28 02:10:20,153 INFO L231 Difference]: Finished difference. Result has 309 places, 899 transitions, 23424 flow [2024-06-28 02:10:20,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=22610, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=23424, PETRI_PLACES=309, PETRI_TRANSITIONS=899} [2024-06-28 02:10:20,154 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 270 predicate places. [2024-06-28 02:10:20,154 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 899 transitions, 23424 flow [2024-06-28 02:10:20,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:20,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:20,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:20,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 02:10:20,154 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:10:20,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1911542150, now seen corresponding path program 8 times [2024-06-28 02:10:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484450852] [2024-06-28 02:10:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:21,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:21,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484450852] [2024-06-28 02:10:21,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484450852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:21,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:21,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:10:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220670671] [2024-06-28 02:10:21,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:21,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:10:21,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:10:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:10:21,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:10:21,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 899 transitions, 23424 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:21,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:21,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:10:21,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:25,630 INFO L124 PetriNetUnfolderBase]: 5769/12253 cut-off events. [2024-06-28 02:10:25,631 INFO L125 PetriNetUnfolderBase]: For 220443/220452 co-relation queries the response was YES. [2024-06-28 02:10:25,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81673 conditions, 12253 events. 5769/12253 cut-off events. For 220443/220452 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 121359 event pairs, 1866 based on Foata normal form. 19/11727 useless extension candidates. Maximal degree in co-relation 81535. Up to 7861 conditions per place. [2024-06-28 02:10:25,805 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 556 selfloop transitions, 418 changer transitions 0/982 dead transitions. [2024-06-28 02:10:25,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 982 transitions, 26188 flow [2024-06-28 02:10:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 02:10:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 02:10:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 241 transitions. [2024-06-28 02:10:25,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5296703296703297 [2024-06-28 02:10:25,829 INFO L175 Difference]: Start difference. First operand has 309 places, 899 transitions, 23424 flow. Second operand 13 states and 241 transitions. [2024-06-28 02:10:25,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 982 transitions, 26188 flow [2024-06-28 02:10:27,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 982 transitions, 25524 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 02:10:27,539 INFO L231 Difference]: Finished difference. Result has 315 places, 901 transitions, 23670 flow [2024-06-28 02:10:27,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=22760, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=416, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=23670, PETRI_PLACES=315, PETRI_TRANSITIONS=901} [2024-06-28 02:10:27,541 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 276 predicate places. [2024-06-28 02:10:27,541 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 901 transitions, 23670 flow [2024-06-28 02:10:27,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:27,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:10:27,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:10:27,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 02:10:27,542 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:10:27,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:10:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1911545870, now seen corresponding path program 9 times [2024-06-28 02:10:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:10:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580797915] [2024-06-28 02:10:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:10:27,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:10:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:10:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:10:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:10:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580797915] [2024-06-28 02:10:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580797915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:10:28,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:10:28,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:10:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685663667] [2024-06-28 02:10:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:10:28,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:10:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:10:28,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:10:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:10:28,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 02:10:28,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 901 transitions, 23670 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-06-28 02:10:28,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:10:28,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 02:10:28,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:10:32,421 INFO L124 PetriNetUnfolderBase]: 5658/12076 cut-off events. [2024-06-28 02:10:32,421 INFO L125 PetriNetUnfolderBase]: For 224837/224846 co-relation queries the response was YES. [2024-06-28 02:10:32,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80683 conditions, 12076 events. 5658/12076 cut-off events. For 224837/224846 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 119634 event pairs, 1779 based on Foata normal form. 17/11540 useless extension candidates. Maximal degree in co-relation 80544. Up to 6742 conditions per place. [2024-06-28 02:10:32,578 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 564 selfloop transitions, 410 changer transitions 0/982 dead transitions. [2024-06-28 02:10:32,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 982 transitions, 26417 flow [2024-06-28 02:10:32,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:10:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:10:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 228 transitions. [2024-06-28 02:10:32,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 02:10:32,580 INFO L175 Difference]: Start difference. First operand has 315 places, 901 transitions, 23670 flow. Second operand 12 states and 228 transitions. [2024-06-28 02:10:32,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 982 transitions, 26417 flow