./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix001.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/mix001.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix001.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:05:30,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:05:30,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:05:30,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:05:30,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:05:30,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:05:30,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:05:30,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:05:30,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:05:30,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:05:30,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:05:30,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:05:30,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:05:30,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:05:30,570 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:05:30,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:05:30,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:05:30,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:05:30,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:05:30,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:05:30,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:05:30,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:05:30,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:05:30,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:05:30,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:05:30,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:05:30,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:05:30,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:05:30,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:05:30,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:05:30,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:05:30,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:05:30,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:05:30,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:05:30,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:05:30,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:05:30,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:05:30,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:05:30,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:05:30,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:05:30,578 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:05:30,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:05:30,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:05:30,579 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 23:05:30,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:05:30,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:05:30,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:05:30,831 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:05:30,832 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:05:30,833 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-rel/mix001.opt.yml/witness.yml [2024-06-27 23:05:30,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:05:30,959 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:05:30,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2024-06-27 23:05:32,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:05:32,365 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:05:32,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.opt.i [2024-06-27 23:05:32,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b57f5622/57a9661aa6ed437483e7d85691f5b1f7/FLAG180ba0a9b [2024-06-27 23:05:32,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b57f5622/57a9661aa6ed437483e7d85691f5b1f7 [2024-06-27 23:05:32,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:05:32,393 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:05:32,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:05:32,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:05:32,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:05:32,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:05:30" (1/2) ... [2024-06-27 23:05:32,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac7e14a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:32, skipping insertion in model container [2024-06-27 23:05:32,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:05:30" (1/2) ... [2024-06-27 23:05:32,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6fb30334 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:05:32, skipping insertion in model container [2024-06-27 23:05:32,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:05:32" (2/2) ... [2024-06-27 23:05:32,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac7e14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32, skipping insertion in model container [2024-06-27 23:05:32,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:05:32" (2/2) ... [2024-06-27 23:05:32,414 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:05:32,439 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:05:32,442 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:05:32,442 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:05:32,443 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 23:05:32,443 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:05:32,443 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-27 23:05:32,496 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:05:32,789 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:05:32,799 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:05:32,962 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:05:32,993 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:05:32,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32 WrapperNode [2024-06-27 23:05:32,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:05:32,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:05:32,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:05:32,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:05:33,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,059 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-06-27 23:05:33,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:05:33,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:05:33,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:05:33,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:05:33,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,095 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-27 23:05:33,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:05:33,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:05:33,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:05:33,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:05:33,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (1/1) ... [2024-06-27 23:05:33,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:05:33,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:05:33,156 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-27 23:05:33,200 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-27 23:05:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:05:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:05:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:05:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:05:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:05:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:05:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:05:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:05:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:05:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:05:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:05:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:05:33,220 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:05:33,370 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:05:33,372 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:05:33,873 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:05:33,873 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:05:34,115 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:05:34,116 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:05:34,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:05:34 BoogieIcfgContainer [2024-06-27 23:05:34,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:05:34,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:05:34,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:05:34,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:05:34,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:05:30" (1/4) ... [2024-06-27 23:05:34,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74142e4a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:05:34, skipping insertion in model container [2024-06-27 23:05:34,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:05:32" (2/4) ... [2024-06-27 23:05:34,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74142e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:05:34, skipping insertion in model container [2024-06-27 23:05:34,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:05:32" (3/4) ... [2024-06-27 23:05:34,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74142e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:05:34, skipping insertion in model container [2024-06-27 23:05:34,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:05:34" (4/4) ... [2024-06-27 23:05:34,130 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2024-06-27 23:05:34,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:05:34,146 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 23:05:34,146 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:05:34,200 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:05:34,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-27 23:05:34,277 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-27 23:05:34,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:05:34,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:05:34,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-27 23:05:34,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-27 23:05:34,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:05:34,297 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;@20c17521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:05:34,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 23:05:34,301 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:05:34,301 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:05:34,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:05:34,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:34,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:05:34,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:34,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash 402627273, now seen corresponding path program 1 times [2024-06-27 23:05:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976647612] [2024-06-27 23:05:34,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:35,851 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-27 23:05:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976647612] [2024-06-27 23:05:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976647612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:35,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:05:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652950544] [2024-06-27 23:05:35,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:35,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:05:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:05:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:05:35,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-06-27 23:05:35,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-27 23:05:35,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:35,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-06-27 23:05:35,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:36,357 INFO L124 PetriNetUnfolderBase]: 869/1413 cut-off events. [2024-06-27 23:05:36,357 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-06-27 23:05:36,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1413 events. 869/1413 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7439 event pairs, 566 based on Foata normal form. 1/1349 useless extension candidates. Maximal degree in co-relation 2779. Up to 1315 conditions per place. [2024-06-27 23:05:36,372 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 30 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-27 23:05:36,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 171 flow [2024-06-27 23:05:36,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:05:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:05:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 23:05:36,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6589147286821705 [2024-06-27 23:05:36,386 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 85 transitions. [2024-06-27 23:05:36,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 171 flow [2024-06-27 23:05:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:36,392 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-27 23:05:36,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-27 23:05:36,397 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-27 23:05:36,397 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-27 23:05:36,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-27 23:05:36,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:36,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:36,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:05:36,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:36,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 378898490, now seen corresponding path program 1 times [2024-06-27 23:05:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:36,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761945984] [2024-06-27 23:05:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:37,521 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-27 23:05:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761945984] [2024-06-27 23:05:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761945984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:37,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:37,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:05:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515834282] [2024-06-27 23:05:37,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:37,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:05:37,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:37,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:05:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:05:37,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 23:05:37,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 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-27 23:05:37,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:37,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 23:05:37,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:37,981 INFO L124 PetriNetUnfolderBase]: 1280/1980 cut-off events. [2024-06-27 23:05:37,981 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2024-06-27 23:05:37,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4501 conditions, 1980 events. 1280/1980 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10119 event pairs, 750 based on Foata normal form. 3/1970 useless extension candidates. Maximal degree in co-relation 4489. Up to 1897 conditions per place. [2024-06-27 23:05:37,993 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-27 23:05:37,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 242 flow [2024-06-27 23:05:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:05:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:05:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-06-27 23:05:37,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2024-06-27 23:05:37,998 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 105 transitions. [2024-06-27 23:05:37,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 242 flow [2024-06-27 23:05:38,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:05:38,004 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-27 23:05:38,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-27 23:05:38,005 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-27 23:05:38,005 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-27 23:05:38,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 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-27 23:05:38,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:38,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:38,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:05:38,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:38,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1139047968, now seen corresponding path program 1 times [2024-06-27 23:05:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508368846] [2024-06-27 23:05:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:39,403 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-27 23:05:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508368846] [2024-06-27 23:05:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508368846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:05:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712651743] [2024-06-27 23:05:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:05:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:05:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:05:39,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 23:05:39,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 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-27 23:05:39,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:39,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 23:05:39,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:39,868 INFO L124 PetriNetUnfolderBase]: 1274/2001 cut-off events. [2024-06-27 23:05:39,869 INFO L125 PetriNetUnfolderBase]: For 1129/1129 co-relation queries the response was YES. [2024-06-27 23:05:39,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5030 conditions, 2001 events. 1274/2001 cut-off events. For 1129/1129 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10378 event pairs, 608 based on Foata normal form. 3/2000 useless extension candidates. Maximal degree in co-relation 5016. Up to 1873 conditions per place. [2024-06-27 23:05:39,881 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 46 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-27 23:05:39,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 320 flow [2024-06-27 23:05:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:05:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:05:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-06-27 23:05:39,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 23:05:39,883 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 129 transitions. [2024-06-27 23:05:39,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 320 flow [2024-06-27 23:05:39,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:39,886 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 176 flow [2024-06-27 23:05:39,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-06-27 23:05:39,887 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2024-06-27 23:05:39,887 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 176 flow [2024-06-27 23:05:39,887 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-27 23:05:39,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:39,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:39,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:05:39,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:39,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1246507511, now seen corresponding path program 1 times [2024-06-27 23:05:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:39,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921549742] [2024-06-27 23:05:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:41,220 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-27 23:05:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921549742] [2024-06-27 23:05:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921549742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:41,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:41,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:05:41,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423506478] [2024-06-27 23:05:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:05:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:41,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:05:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:05:41,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:05:41,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-27 23:05:41,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:41,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:05:41,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:41,961 INFO L124 PetriNetUnfolderBase]: 1537/2447 cut-off events. [2024-06-27 23:05:41,961 INFO L125 PetriNetUnfolderBase]: For 2516/2525 co-relation queries the response was YES. [2024-06-27 23:05:41,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6575 conditions, 2447 events. 1537/2447 cut-off events. For 2516/2525 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12993 event pairs, 1121 based on Foata normal form. 11/2403 useless extension candidates. Maximal degree in co-relation 6559. Up to 2282 conditions per place. [2024-06-27 23:05:41,977 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 40 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-06-27 23:05:41,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 326 flow [2024-06-27 23:05:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:05:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:05:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 23:05:41,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49767441860465117 [2024-06-27 23:05:41,981 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 176 flow. Second operand 5 states and 107 transitions. [2024-06-27 23:05:41,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 326 flow [2024-06-27 23:05:41,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 300 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:41,986 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 215 flow [2024-06-27 23:05:41,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2024-06-27 23:05:41,988 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2024-06-27 23:05:41,988 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 215 flow [2024-06-27 23:05:41,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-27 23:05:41,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:41,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:41,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:05:41,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:41,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1159347704, now seen corresponding path program 1 times [2024-06-27 23:05:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201227446] [2024-06-27 23:05:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:43,889 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-27 23:05:43,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:43,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201227446] [2024-06-27 23:05:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201227446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:43,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:43,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583831804] [2024-06-27 23:05:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:43,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:43,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-27 23:05:43,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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-27 23:05:43,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:43,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-27 23:05:43,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:44,561 INFO L124 PetriNetUnfolderBase]: 1763/2720 cut-off events. [2024-06-27 23:05:44,561 INFO L125 PetriNetUnfolderBase]: For 4337/4345 co-relation queries the response was YES. [2024-06-27 23:05:44,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7990 conditions, 2720 events. 1763/2720 cut-off events. For 4337/4345 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13878 event pairs, 617 based on Foata normal form. 14/2719 useless extension candidates. Maximal degree in co-relation 7971. Up to 2517 conditions per place. [2024-06-27 23:05:44,579 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 60 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2024-06-27 23:05:44,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 475 flow [2024-06-27 23:05:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:05:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:05:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 23:05:44,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5548172757475083 [2024-06-27 23:05:44,582 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 215 flow. Second operand 7 states and 167 transitions. [2024-06-27 23:05:44,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 475 flow [2024-06-27 23:05:44,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 459 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:44,589 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 268 flow [2024-06-27 23:05:44,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2024-06-27 23:05:44,591 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-06-27 23:05:44,592 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 268 flow [2024-06-27 23:05:44,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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-27 23:05:44,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:44,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:44,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:05:44,593 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:44,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:44,594 INFO L85 PathProgramCache]: Analyzing trace with hash 19203124, now seen corresponding path program 1 times [2024-06-27 23:05:44,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:44,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9787178] [2024-06-27 23:05:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:45,925 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-27 23:05:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9787178] [2024-06-27 23:05:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9787178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:45,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:45,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054162588] [2024-06-27 23:05:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:45,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:45,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:46,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:05:46,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-27 23:05:46,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:46,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:05:46,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:46,786 INFO L124 PetriNetUnfolderBase]: 1514/2417 cut-off events. [2024-06-27 23:05:46,787 INFO L125 PetriNetUnfolderBase]: For 5673/5688 co-relation queries the response was YES. [2024-06-27 23:05:46,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7602 conditions, 2417 events. 1514/2417 cut-off events. For 5673/5688 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12870 event pairs, 921 based on Foata normal form. 19/2407 useless extension candidates. Maximal degree in co-relation 7580. Up to 2235 conditions per place. [2024-06-27 23:05:46,807 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 49 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-06-27 23:05:46,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 450 flow [2024-06-27 23:05:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:05:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:05:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 23:05:46,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2024-06-27 23:05:46,809 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 268 flow. Second operand 6 states and 126 transitions. [2024-06-27 23:05:46,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 450 flow [2024-06-27 23:05:46,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 409 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 23:05:46,813 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 289 flow [2024-06-27 23:05:46,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-06-27 23:05:46,816 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2024-06-27 23:05:46,816 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 289 flow [2024-06-27 23:05:46,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-27 23:05:46,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:46,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:46,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:05:46,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:46,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1313234888, now seen corresponding path program 1 times [2024-06-27 23:05:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85826782] [2024-06-27 23:05:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:47,897 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-27 23:05:47,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:47,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85826782] [2024-06-27 23:05:47,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85826782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:47,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:47,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536312494] [2024-06-27 23:05:47,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:47,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:47,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:47,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-27 23:05:47,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:47,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:47,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:48,755 INFO L124 PetriNetUnfolderBase]: 1902/2881 cut-off events. [2024-06-27 23:05:48,756 INFO L125 PetriNetUnfolderBase]: For 8741/8747 co-relation queries the response was YES. [2024-06-27 23:05:48,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9755 conditions, 2881 events. 1902/2881 cut-off events. For 8741/8747 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14327 event pairs, 1019 based on Foata normal form. 6/2884 useless extension candidates. Maximal degree in co-relation 9730. Up to 2753 conditions per place. [2024-06-27 23:05:48,779 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 63 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2024-06-27 23:05:48,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 646 flow [2024-06-27 23:05:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:05:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:05:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-06-27 23:05:48,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684385382059801 [2024-06-27 23:05:48,781 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 289 flow. Second operand 7 states and 141 transitions. [2024-06-27 23:05:48,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 646 flow [2024-06-27 23:05:48,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 614 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 23:05:48,789 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 430 flow [2024-06-27 23:05:48,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=430, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2024-06-27 23:05:48,790 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2024-06-27 23:05:48,790 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 430 flow [2024-06-27 23:05:48,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-27 23:05:48,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:48,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:48,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:05:48,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:48,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1512323286, now seen corresponding path program 2 times [2024-06-27 23:05:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702246014] [2024-06-27 23:05:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:50,071 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-27 23:05:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702246014] [2024-06-27 23:05:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702246014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:50,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402395190] [2024-06-27 23:05:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:50,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:50,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:50,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:50,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-27 23:05:50,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:50,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:50,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:50,929 INFO L124 PetriNetUnfolderBase]: 1934/2930 cut-off events. [2024-06-27 23:05:50,929 INFO L125 PetriNetUnfolderBase]: For 11701/11707 co-relation queries the response was YES. [2024-06-27 23:05:50,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10763 conditions, 2930 events. 1934/2930 cut-off events. For 11701/11707 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14600 event pairs, 1024 based on Foata normal form. 7/2932 useless extension candidates. Maximal degree in co-relation 10735. Up to 2786 conditions per place. [2024-06-27 23:05:50,947 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 57 selfloop transitions, 36 changer transitions 0/98 dead transitions. [2024-06-27 23:05:50,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 820 flow [2024-06-27 23:05:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:05:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:05:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-27 23:05:50,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2024-06-27 23:05:50,948 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 430 flow. Second operand 6 states and 122 transitions. [2024-06-27 23:05:50,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 820 flow [2024-06-27 23:05:50,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 777 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:50,959 INFO L231 Difference]: Finished difference. Result has 70 places, 82 transitions, 620 flow [2024-06-27 23:05:50,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=70, PETRI_TRANSITIONS=82} [2024-06-27 23:05:50,961 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2024-06-27 23:05:50,961 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 82 transitions, 620 flow [2024-06-27 23:05:50,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-27 23:05:50,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:50,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:50,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:05:50,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:50,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 628357624, now seen corresponding path program 3 times [2024-06-27 23:05:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202432094] [2024-06-27 23:05:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:52,238 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-27 23:05:52,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202432094] [2024-06-27 23:05:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202432094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:05:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150333784] [2024-06-27 23:05:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:52,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:05:52,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:52,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:05:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:05:52,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:52,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 82 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-27 23:05:52,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:52,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:52,969 INFO L124 PetriNetUnfolderBase]: 1926/2918 cut-off events. [2024-06-27 23:05:52,970 INFO L125 PetriNetUnfolderBase]: For 13857/13857 co-relation queries the response was YES. [2024-06-27 23:05:52,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11103 conditions, 2918 events. 1926/2918 cut-off events. For 13857/13857 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14497 event pairs, 1020 based on Foata normal form. 3/2916 useless extension candidates. Maximal degree in co-relation 11071. Up to 2778 conditions per place. [2024-06-27 23:05:52,990 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 37 changer transitions 0/97 dead transitions. [2024-06-27 23:05:52,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 854 flow [2024-06-27 23:05:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:05:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:05:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-27 23:05:52,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2024-06-27 23:05:52,993 INFO L175 Difference]: Start difference. First operand has 70 places, 82 transitions, 620 flow. Second operand 6 states and 118 transitions. [2024-06-27 23:05:52,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 854 flow [2024-06-27 23:05:53,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 769 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-06-27 23:05:53,007 INFO L231 Difference]: Finished difference. Result has 75 places, 82 transitions, 622 flow [2024-06-27 23:05:53,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=75, PETRI_TRANSITIONS=82} [2024-06-27 23:05:53,008 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2024-06-27 23:05:53,008 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 82 transitions, 622 flow [2024-06-27 23:05:53,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-27 23:05:53,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:53,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:53,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:05:53,009 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:53,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1163580210, now seen corresponding path program 1 times [2024-06-27 23:05:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583989191] [2024-06-27 23:05:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:54,109 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-27 23:05:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:54,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583989191] [2024-06-27 23:05:54,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583989191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:54,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:54,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247125613] [2024-06-27 23:05:54,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:54,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:54,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:54,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:54,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:54,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 622 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:05:54,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:54,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:54,870 INFO L124 PetriNetUnfolderBase]: 1959/2966 cut-off events. [2024-06-27 23:05:54,870 INFO L125 PetriNetUnfolderBase]: For 16133/16143 co-relation queries the response was YES. [2024-06-27 23:05:54,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11555 conditions, 2966 events. 1959/2966 cut-off events. For 16133/16143 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14756 event pairs, 979 based on Foata normal form. 10/2974 useless extension candidates. Maximal degree in co-relation 11519. Up to 2750 conditions per place. [2024-06-27 23:05:54,890 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 71 selfloop transitions, 49 changer transitions 0/125 dead transitions. [2024-06-27 23:05:54,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 1103 flow [2024-06-27 23:05:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:05:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:05:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-27 23:05:54,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2024-06-27 23:05:54,892 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 622 flow. Second operand 8 states and 162 transitions. [2024-06-27 23:05:54,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 1103 flow [2024-06-27 23:05:54,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1062 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 23:05:54,907 INFO L231 Difference]: Finished difference. Result has 83 places, 96 transitions, 827 flow [2024-06-27 23:05:54,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=827, PETRI_PLACES=83, PETRI_TRANSITIONS=96} [2024-06-27 23:05:54,908 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2024-06-27 23:05:54,908 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 96 transitions, 827 flow [2024-06-27 23:05:54,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:05:54,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:54,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:54,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:05:54,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:54,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2022186594, now seen corresponding path program 2 times [2024-06-27 23:05:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716247122] [2024-06-27 23:05:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:56,166 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-27 23:05:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716247122] [2024-06-27 23:05:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716247122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:56,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598846543] [2024-06-27 23:05:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:56,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:56,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:56,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 96 transitions, 827 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:05:56,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:56,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:56,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:57,051 INFO L124 PetriNetUnfolderBase]: 2029/3072 cut-off events. [2024-06-27 23:05:57,052 INFO L125 PetriNetUnfolderBase]: For 20854/20864 co-relation queries the response was YES. [2024-06-27 23:05:57,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12948 conditions, 3072 events. 2029/3072 cut-off events. For 20854/20864 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15276 event pairs, 946 based on Foata normal form. 11/3081 useless extension candidates. Maximal degree in co-relation 12908. Up to 2819 conditions per place. [2024-06-27 23:05:57,072 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 75 selfloop transitions, 67 changer transitions 0/147 dead transitions. [2024-06-27 23:05:57,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 147 transitions, 1532 flow [2024-06-27 23:05:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:05:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:05:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-27 23:05:57,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-27 23:05:57,074 INFO L175 Difference]: Start difference. First operand has 83 places, 96 transitions, 827 flow. Second operand 8 states and 164 transitions. [2024-06-27 23:05:57,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 147 transitions, 1532 flow [2024-06-27 23:05:57,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 147 transitions, 1419 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:57,109 INFO L231 Difference]: Finished difference. Result has 90 places, 118 transitions, 1137 flow [2024-06-27 23:05:57,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1137, PETRI_PLACES=90, PETRI_TRANSITIONS=118} [2024-06-27 23:05:57,110 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2024-06-27 23:05:57,110 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 118 transitions, 1137 flow [2024-06-27 23:05:57,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:05:57,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:57,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:57,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:05:57,111 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:57,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2055577314, now seen corresponding path program 3 times [2024-06-27 23:05:57,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:57,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933105141] [2024-06-27 23:05:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:05:58,299 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-27 23:05:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:05:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933105141] [2024-06-27 23:05:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933105141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:05:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:05:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:05:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058136437] [2024-06-27 23:05:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:05:58,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:05:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:05:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:05:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:05:58,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:05:58,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 118 transitions, 1137 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:05:58,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:05:58,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:05:58,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:05:59,262 INFO L124 PetriNetUnfolderBase]: 2031/3074 cut-off events. [2024-06-27 23:05:59,262 INFO L125 PetriNetUnfolderBase]: For 23580/23586 co-relation queries the response was YES. [2024-06-27 23:05:59,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13344 conditions, 3074 events. 2031/3074 cut-off events. For 23580/23586 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15230 event pairs, 942 based on Foata normal form. 7/3079 useless extension candidates. Maximal degree in co-relation 13300. Up to 2822 conditions per place. [2024-06-27 23:05:59,285 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 75 selfloop transitions, 69 changer transitions 0/149 dead transitions. [2024-06-27 23:05:59,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 149 transitions, 1627 flow [2024-06-27 23:05:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:05:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:05:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-27 23:05:59,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2024-06-27 23:05:59,287 INFO L175 Difference]: Start difference. First operand has 90 places, 118 transitions, 1137 flow. Second operand 8 states and 161 transitions. [2024-06-27 23:05:59,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 149 transitions, 1627 flow [2024-06-27 23:05:59,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 149 transitions, 1532 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 23:05:59,393 INFO L231 Difference]: Finished difference. Result has 95 places, 121 transitions, 1232 flow [2024-06-27 23:05:59,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1232, PETRI_PLACES=95, PETRI_TRANSITIONS=121} [2024-06-27 23:05:59,394 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2024-06-27 23:05:59,394 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 121 transitions, 1232 flow [2024-06-27 23:05:59,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:05:59,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:05:59,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:05:59,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:05:59,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:05:59,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:05:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2022336541, now seen corresponding path program 1 times [2024-06-27 23:05:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:05:59,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443688539] [2024-06-27 23:05:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:05:59,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:05:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:00,682 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-27 23:06:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443688539] [2024-06-27 23:06:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443688539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93870905] [2024-06-27 23:06:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:00,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:00,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:00,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:00,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:00,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 121 transitions, 1232 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:00,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:00,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:00,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:01,613 INFO L124 PetriNetUnfolderBase]: 2073/3147 cut-off events. [2024-06-27 23:06:01,613 INFO L125 PetriNetUnfolderBase]: For 27888/27892 co-relation queries the response was YES. [2024-06-27 23:06:01,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13938 conditions, 3147 events. 2073/3147 cut-off events. For 27888/27892 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15619 event pairs, 949 based on Foata normal form. 8/3150 useless extension candidates. Maximal degree in co-relation 13893. Up to 2896 conditions per place. [2024-06-27 23:06:01,632 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 112 selfloop transitions, 45 changer transitions 0/162 dead transitions. [2024-06-27 23:06:01,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 162 transitions, 1802 flow [2024-06-27 23:06:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-27 23:06:01,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-27 23:06:01,634 INFO L175 Difference]: Start difference. First operand has 95 places, 121 transitions, 1232 flow. Second operand 8 states and 165 transitions. [2024-06-27 23:06:01,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 162 transitions, 1802 flow [2024-06-27 23:06:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 162 transitions, 1667 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:01,678 INFO L231 Difference]: Finished difference. Result has 99 places, 131 transitions, 1311 flow [2024-06-27 23:06:01,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1311, PETRI_PLACES=99, PETRI_TRANSITIONS=131} [2024-06-27 23:06:01,679 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2024-06-27 23:06:01,679 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 131 transitions, 1311 flow [2024-06-27 23:06:01,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:01,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:01,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:01,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:06:01,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:01,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:01,681 INFO L85 PathProgramCache]: Analyzing trace with hash 297629500, now seen corresponding path program 4 times [2024-06-27 23:06:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:01,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429851027] [2024-06-27 23:06:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:03,066 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-27 23:06:03,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:03,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429851027] [2024-06-27 23:06:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429851027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794909675] [2024-06-27 23:06:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:03,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:03,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:03,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:03,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:03,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:03,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 131 transitions, 1311 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:03,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:03,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:03,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:03,915 INFO L124 PetriNetUnfolderBase]: 2126/3215 cut-off events. [2024-06-27 23:06:03,915 INFO L125 PetriNetUnfolderBase]: For 32432/32438 co-relation queries the response was YES. [2024-06-27 23:06:03,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14979 conditions, 3215 events. 2126/3215 cut-off events. For 32432/32438 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15860 event pairs, 761 based on Foata normal form. 7/3212 useless extension candidates. Maximal degree in co-relation 14932. Up to 2936 conditions per place. [2024-06-27 23:06:03,938 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 78 selfloop transitions, 90 changer transitions 0/173 dead transitions. [2024-06-27 23:06:03,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 173 transitions, 1983 flow [2024-06-27 23:06:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-27 23:06:03,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750830564784053 [2024-06-27 23:06:03,940 INFO L175 Difference]: Start difference. First operand has 99 places, 131 transitions, 1311 flow. Second operand 7 states and 143 transitions. [2024-06-27 23:06:03,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 173 transitions, 1983 flow [2024-06-27 23:06:03,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 173 transitions, 1949 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 23:06:03,986 INFO L231 Difference]: Finished difference. Result has 105 places, 153 transitions, 1724 flow [2024-06-27 23:06:03,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1724, PETRI_PLACES=105, PETRI_TRANSITIONS=153} [2024-06-27 23:06:03,986 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2024-06-27 23:06:03,987 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 153 transitions, 1724 flow [2024-06-27 23:06:03,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:03,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:03,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:03,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:06:03,987 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:03,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 212744852, now seen corresponding path program 5 times [2024-06-27 23:06:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775526142] [2024-06-27 23:06:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:05,371 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-27 23:06:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775526142] [2024-06-27 23:06:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775526142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:05,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:05,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057622769] [2024-06-27 23:06:05,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:05,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:05,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:05,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:05,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:05,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:05,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 153 transitions, 1724 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:05,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:05,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:05,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:06,231 INFO L124 PetriNetUnfolderBase]: 2151/3251 cut-off events. [2024-06-27 23:06:06,231 INFO L125 PetriNetUnfolderBase]: For 37507/37513 co-relation queries the response was YES. [2024-06-27 23:06:06,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15871 conditions, 3251 events. 2151/3251 cut-off events. For 37507/37513 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16093 event pairs, 766 based on Foata normal form. 8/3249 useless extension candidates. Maximal degree in co-relation 15820. Up to 2964 conditions per place. [2024-06-27 23:06:06,255 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 81 selfloop transitions, 97 changer transitions 0/183 dead transitions. [2024-06-27 23:06:06,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 183 transitions, 2364 flow [2024-06-27 23:06:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-27 23:06:06,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750830564784053 [2024-06-27 23:06:06,257 INFO L175 Difference]: Start difference. First operand has 105 places, 153 transitions, 1724 flow. Second operand 7 states and 143 transitions. [2024-06-27 23:06:06,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 183 transitions, 2364 flow [2024-06-27 23:06:06,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 183 transitions, 2249 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-06-27 23:06:06,324 INFO L231 Difference]: Finished difference. Result has 111 places, 162 transitions, 1963 flow [2024-06-27 23:06:06,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1963, PETRI_PLACES=111, PETRI_TRANSITIONS=162} [2024-06-27 23:06:06,324 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places. [2024-06-27 23:06:06,325 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 162 transitions, 1963 flow [2024-06-27 23:06:06,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:06,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:06,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:06,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:06:06,325 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:06,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 362620057, now seen corresponding path program 2 times [2024-06-27 23:06:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:06,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185636058] [2024-06-27 23:06:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:07,651 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-27 23:06:07,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185636058] [2024-06-27 23:06:07,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185636058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:07,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621222459] [2024-06-27 23:06:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:07,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:07,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:07,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 162 transitions, 1963 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:07,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:07,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:07,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:08,551 INFO L124 PetriNetUnfolderBase]: 2201/3340 cut-off events. [2024-06-27 23:06:08,551 INFO L125 PetriNetUnfolderBase]: For 43642/43645 co-relation queries the response was YES. [2024-06-27 23:06:08,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16546 conditions, 3340 events. 2201/3340 cut-off events. For 43642/43645 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16680 event pairs, 960 based on Foata normal form. 8/3341 useless extension candidates. Maximal degree in co-relation 16492. Up to 3053 conditions per place. [2024-06-27 23:06:08,568 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 136 selfloop transitions, 53 changer transitions 0/194 dead transitions. [2024-06-27 23:06:08,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 194 transitions, 2567 flow [2024-06-27 23:06:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-27 23:06:08,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47840531561461797 [2024-06-27 23:06:08,570 INFO L175 Difference]: Start difference. First operand has 111 places, 162 transitions, 1963 flow. Second operand 7 states and 144 transitions. [2024-06-27 23:06:08,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 194 transitions, 2567 flow [2024-06-27 23:06:08,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 194 transitions, 2394 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-27 23:06:08,640 INFO L231 Difference]: Finished difference. Result has 115 places, 171 transitions, 2000 flow [2024-06-27 23:06:08,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2000, PETRI_PLACES=115, PETRI_TRANSITIONS=171} [2024-06-27 23:06:08,641 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 71 predicate places. [2024-06-27 23:06:08,641 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 171 transitions, 2000 flow [2024-06-27 23:06:08,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:08,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:08,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:08,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:06:08,642 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:08,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1995481559, now seen corresponding path program 3 times [2024-06-27 23:06:08,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:08,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715010358] [2024-06-27 23:06:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:08,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:09,957 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-27 23:06:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:09,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715010358] [2024-06-27 23:06:09,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715010358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:09,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:09,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:09,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184310568] [2024-06-27 23:06:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:09,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:09,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:09,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:10,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:10,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 171 transitions, 2000 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:10,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:10,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:10,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:10,808 INFO L124 PetriNetUnfolderBase]: 2237/3397 cut-off events. [2024-06-27 23:06:10,808 INFO L125 PetriNetUnfolderBase]: For 48570/48579 co-relation queries the response was YES. [2024-06-27 23:06:10,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17074 conditions, 3397 events. 2237/3397 cut-off events. For 48570/48579 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16995 event pairs, 946 based on Foata normal form. 12/3405 useless extension candidates. Maximal degree in co-relation 17018. Up to 3085 conditions per place. [2024-06-27 23:06:10,824 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 132 selfloop transitions, 63 changer transitions 0/200 dead transitions. [2024-06-27 23:06:10,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 200 transitions, 2627 flow [2024-06-27 23:06:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:06:10,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:06:10,825 INFO L175 Difference]: Start difference. First operand has 115 places, 171 transitions, 2000 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:06:10,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 200 transitions, 2627 flow [2024-06-27 23:06:10,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 200 transitions, 2480 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:10,892 INFO L231 Difference]: Finished difference. Result has 116 places, 177 transitions, 2075 flow [2024-06-27 23:06:10,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2075, PETRI_PLACES=116, PETRI_TRANSITIONS=177} [2024-06-27 23:06:10,893 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2024-06-27 23:06:10,893 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 177 transitions, 2075 flow [2024-06-27 23:06:10,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:10,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:10,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:10,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:06:10,894 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:10,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash 419398292, now seen corresponding path program 6 times [2024-06-27 23:06:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696800089] [2024-06-27 23:06:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:12,193 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-27 23:06:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696800089] [2024-06-27 23:06:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696800089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:12,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:12,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832572141] [2024-06-27 23:06:12,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:12,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:12,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:12,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:12,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:12,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 177 transitions, 2075 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:12,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:12,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:12,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:13,052 INFO L124 PetriNetUnfolderBase]: 2226/3371 cut-off events. [2024-06-27 23:06:13,052 INFO L125 PetriNetUnfolderBase]: For 51791/51794 co-relation queries the response was YES. [2024-06-27 23:06:13,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17167 conditions, 3371 events. 2226/3371 cut-off events. For 51791/51794 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16685 event pairs, 765 based on Foata normal form. 6/3368 useless extension candidates. Maximal degree in co-relation 17109. Up to 3077 conditions per place. [2024-06-27 23:06:13,067 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 93 selfloop transitions, 100 changer transitions 0/198 dead transitions. [2024-06-27 23:06:13,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 198 transitions, 2569 flow [2024-06-27 23:06:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 23:06:13,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2024-06-27 23:06:13,068 INFO L175 Difference]: Start difference. First operand has 116 places, 177 transitions, 2075 flow. Second operand 7 states and 138 transitions. [2024-06-27 23:06:13,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 198 transitions, 2569 flow [2024-06-27 23:06:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 198 transitions, 2428 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 23:06:13,119 INFO L231 Difference]: Finished difference. Result has 120 places, 177 transitions, 2149 flow [2024-06-27 23:06:13,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2149, PETRI_PLACES=120, PETRI_TRANSITIONS=177} [2024-06-27 23:06:13,120 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places. [2024-06-27 23:06:13,120 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 177 transitions, 2149 flow [2024-06-27 23:06:13,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:13,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:13,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:13,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:06:13,120 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:13,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1274110517, now seen corresponding path program 4 times [2024-06-27 23:06:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704037514] [2024-06-27 23:06:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:14,365 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-27 23:06:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704037514] [2024-06-27 23:06:14,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704037514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:14,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:06:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075145891] [2024-06-27 23:06:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:14,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:06:14,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:06:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:06:14,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:14,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 177 transitions, 2149 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:14,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:15,154 INFO L124 PetriNetUnfolderBase]: 2210/3361 cut-off events. [2024-06-27 23:06:15,155 INFO L125 PetriNetUnfolderBase]: For 56583/56589 co-relation queries the response was YES. [2024-06-27 23:06:15,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17207 conditions, 3361 events. 2210/3361 cut-off events. For 56583/56589 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16803 event pairs, 943 based on Foata normal form. 10/3367 useless extension candidates. Maximal degree in co-relation 17147. Up to 3057 conditions per place. [2024-06-27 23:06:15,174 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 136 selfloop transitions, 59 changer transitions 0/200 dead transitions. [2024-06-27 23:06:15,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 200 transitions, 2639 flow [2024-06-27 23:06:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:06:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:06:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:06:15,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:06:15,176 INFO L175 Difference]: Start difference. First operand has 120 places, 177 transitions, 2149 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:06:15,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 200 transitions, 2639 flow [2024-06-27 23:06:15,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 200 transitions, 2346 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:15,230 INFO L231 Difference]: Finished difference. Result has 121 places, 177 transitions, 1988 flow [2024-06-27 23:06:15,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1988, PETRI_PLACES=121, PETRI_TRANSITIONS=177} [2024-06-27 23:06:15,230 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2024-06-27 23:06:15,231 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 177 transitions, 1988 flow [2024-06-27 23:06:15,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-27 23:06:15,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:15,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:15,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:06:15,232 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:15,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash -685239082, now seen corresponding path program 1 times [2024-06-27 23:06:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:15,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304100568] [2024-06-27 23:06:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:16,359 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-27 23:06:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:16,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304100568] [2024-06-27 23:06:16,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304100568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:16,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:16,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:06:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249850321] [2024-06-27 23:06:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:16,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:06:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:06:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:06:16,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 23:06:16,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 177 transitions, 1988 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-27 23:06:16,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:16,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 23:06:16,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:16,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([408] L773-->L789: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_46 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd2~0_46 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~y$w_buff1_used~0_61 256) 0) .cse5)) (.cse11 (= (mod v_~y$w_buff0_used~0_66 256) 0)) (.cse2 (and .cse8 .cse5))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_60 256) 0)) (.cse3 (= 0 (mod v_~y$w_buff0_used~0_65 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_42 256) 0))) (.cse9 (or .cse1 .cse11 .cse2)) (.cse10 (and (not .cse11) .cse6))) (and (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1_used~0_60 (ite .cse0 v_~y$w_buff1_used~0_61 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_61 0))) (= (ite .cse0 v_~y$mem_tmp~0_28 v_~__unbuffered_p1_EBX~0_24) v_~y~0_58) (= v_~y$w_buff0~0_37 v_~y$w_buff0~0_36) (or (= v_~weak$$choice0~0_20 0) (= v_~weak$$choice0~0_20 1)) (= v_~y~0_59 v_~y$mem_tmp~0_28) (or (= v_~weak$$choice2~0_42 1) (= v_~weak$$choice2~0_42 0)) (= v_~y$r_buff0_thd2~0_45 (ite .cse0 v_~y$r_buff0_thd2~0_46 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~y$r_buff0_thd2~0_46 (ite (and .cse6 (not .cse3)) 0 v_~y$r_buff0_thd2~0_46)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_46 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_45 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse4) .cse3)) v_~y$r_buff1_thd2~0_46 0)) v_~y$r_buff1_thd2~0_45) (= v_~y$w_buff1~0_36 v_~y$w_buff1~0_35) (= v_~y$w_buff0_used~0_65 (ite .cse0 v_~y$w_buff0_used~0_66 (ite .cse9 v_~y$w_buff0_used~0_66 (ite .cse10 0 v_~y$w_buff0_used~0_66)))) (= v_~__unbuffered_p1_EBX~0_24 (ite .cse9 v_~y~0_59 (ite .cse10 v_~y$w_buff0~0_37 v_~y$w_buff1~0_36))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_46, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_65, P1Thread1of1ForFork1_#t~nondet4=|v_P1Thread1of1ForFork1_#t~nondet4_1|, P1Thread1of1ForFork1_#t~nondet3=|v_P1Thread1of1ForFork1_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, ~weak$$choice0~0=v_~weak$$choice0~0_20, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_45, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_42, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet4, P1Thread1of1ForFork1_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][40], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), 33#L789true, Black: 254#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 104#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 210#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 88#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 196#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 23#L859true, Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 225#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 227#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 14#L755true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 146#true, 310#true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork1InUse, 4#$Ultimate##0true, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, 294#true, Black: 58#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~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) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:06:16,729 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-06-27 23:06:16,729 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:06:16,729 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:06:16,730 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:06:16,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L799-->L810: Formula: (and (= v_~y$r_buff0_thd2~0_81 v_~y$r_buff1_thd2~0_87) (= v_~y$r_buff0_thd3~0_99 v_~y$r_buff1_thd3~0_95) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff1~0_101 v_~y$w_buff0~0_117) (not (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_171 256) 0)) (not (= (mod v_~y$w_buff1_used~0_154 256) 0)))) 1 0) 0)) (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_33) (= |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_2| |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_1|) (= v_~y$w_buff0_used~0_172 v_~y$w_buff1_used~0_154) (= v_~y$w_buff0_used~0_171 1) (= v_~y$r_buff0_thd3~0_98 1) (= |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_2| |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_1|) (= v_~y$w_buff0~0_116 1)) InVars {P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_172, P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41} OutVars{P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_2|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_171, P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_87, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_101, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_98, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_1|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_154} AuxVars[] AssignedVars[P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][173], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 104#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 210#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 15#L773true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 88#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 196#true, 23#L859true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 225#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 227#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 14#L755true, 146#true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 34#L810true, 310#true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork1InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), P2Thread1of1ForFork0InUse, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 294#true, Black: 58#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~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) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:06:16,744 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-27 23:06:16,744 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:06:16,744 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:06:16,744 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:06:16,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L859-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (and (let ((.cse4 (mod v_~y$r_buff0_thd0~0_7 256)) (.cse3 (mod v_~y$w_buff0_used~0_31 256)) (.cse7 (mod v_~y$r_buff1_thd2~0_15 256)) (.cse1 (mod v_~y$r_buff1_thd0~0_7 256)) (.cse6 (mod v_~y$r_buff1_thd1~0_7 256)) (.cse10 (mod v_~y$r_buff0_thd1~0_7 256)) (.cse11 (mod v_~y$flush_delayed~0_12 256)) (.cse2 (mod v_~y$r_buff0_thd3~0_22 256)) (.cse9 (mod v_~y$r_buff1_thd3~0_19 256)) (.cse8 (mod v_~y$read_delayed~0_6 256)) (.cse0 (mod v_~y$w_buff1_used~0_28 256)) (.cse5 (mod v_~y$r_buff0_thd2~0_15 256))) (or (< (+ .cse0 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse1)) (< v_~z~0_9 v_~__unbuffered_p0_EAX~0_7) (< (+ v_~__unbuffered_p0_EBX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< v_~y$w_buff0~0_15 .cse2) (< 2 (+ v_~__unbuffered_p0_EAX~0_7 v_~__unbuffered_p2_EBX~0_7)) (< v_~x~0_9 v_~__unbuffered_p0_EBX~0_7) (< v_~y$w_buff0~0_15 .cse0) (< v_~y$w_buff0~0_15 v_~__unbuffered_p1_EBX~0_7) (< (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_p2_EBX~0_7) (< (+ (mod v_~main$tmp_guard1~0_6 256) 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~__unbuffered_p2_EAX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< v_~y$w_buff0~0_15 v_~y~0_20) (< (+ v_~__unbuffered_p1_EAX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse3 1) v_~__unbuffered_p2_EBX~0_7) (< v_~y$w_buff0~0_15 v_~y$mem_tmp~0_10) (< (+ v_~__unbuffered_p0_EAX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ .cse4 v_~__unbuffered_p2_EBX~0_7)) (< (+ (mod v_~weak$$choice2~0_22 256) 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse5 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ .cse6 v_~__unbuffered_p2_EBX~0_7)) (< (+ .cse4 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~y~0_20 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~y$w_buff0~0_15 1) v_~__unbuffered_p2_EBX~0_7) (< (+ v_~y$w_buff1~0_14 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse7)) (< v_~y$w_buff0~0_15 v_~__unbuffered_p2_EAX~0_7) (< (+ v_~y$mem_tmp~0_10 1) v_~__unbuffered_p2_EBX~0_7) (< 2 (+ v_~__unbuffered_p2_EBX~0_7 v_~z~0_9)) (< v_~y$w_buff0~0_15 .cse3) (< v_~x~0_9 v_~__unbuffered_p1_EAX~0_7) (< (+ v_~__unbuffered_p1_EBX~0_7 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse8)) (< (+ 1 (mod v_~weak$$choice0~0_8 256)) v_~__unbuffered_p2_EBX~0_7) (< v_~y$w_buff0~0_15 v_~y$w_buff1~0_14) (< (+ .cse7 1) v_~__unbuffered_p2_EBX~0_7) (< v_~y$w_buff0~0_15 .cse9) (< (+ .cse1 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse10 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse6 1) v_~__unbuffered_p2_EBX~0_7) (< v_~z~0_9 v_~__unbuffered_p2_EBX~0_7) (< (+ .cse11 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse9 1) v_~__unbuffered_p2_EBX~0_7) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse10)) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse11)) (< (+ v_~x~0_9 1) v_~__unbuffered_p2_EBX~0_7) (< (+ .cse2 1) v_~__unbuffered_p2_EBX~0_7) (< v_~y$w_buff1~0_14 .cse9) (< (+ .cse8 1) v_~__unbuffered_p2_EBX~0_7) (< v_~y$w_buff1~0_14 .cse0) (< 1 (+ v_~__unbuffered_p2_EBX~0_7 .cse5)))) (not (= |v_#ghost~multithreaded_7| 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~y$w_buff0~0=v_~y$w_buff0~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_22, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_28} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~y$w_buff0~0=v_~y$w_buff0~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_22, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_28} AuxVars[] AssignedVars[][147], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 104#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 210#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 15#L773true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 88#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 196#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 225#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 227#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 14#L755true, 38#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 146#true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 310#true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 4#$Ultimate##0true, P1Thread1of1ForFork1InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), P2Thread1of1ForFork0InUse, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 294#true, Black: 58#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~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) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:06:16,747 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-27 23:06:16,747 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:06:16,747 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:06:16,747 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:06:16,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L799-->L810: Formula: (and (= v_~y$r_buff0_thd2~0_81 v_~y$r_buff1_thd2~0_87) (= v_~y$r_buff0_thd3~0_99 v_~y$r_buff1_thd3~0_95) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff1~0_101 v_~y$w_buff0~0_117) (not (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_171 256) 0)) (not (= (mod v_~y$w_buff1_used~0_154 256) 0)))) 1 0) 0)) (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_33) (= |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_2| |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_1|) (= v_~y$w_buff0_used~0_172 v_~y$w_buff1_used~0_154) (= v_~y$w_buff0_used~0_171 1) (= v_~y$r_buff0_thd3~0_98 1) (= |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_2| |v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_1|) (= v_~y$w_buff0~0_116 1)) InVars {P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_172, P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~y$w_buff0~0=v_~y$w_buff0~0_117, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41} OutVars{P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_2|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_171, P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_87, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_101, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_98, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_1|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_154} AuxVars[] AssignedVars[P2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0][173], [Black: 63#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 130#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 194#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 126#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 69#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 104#true, Black: 73#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 77#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 210#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 15#L773true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 88#(and (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$flush_delayed~0 0) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y$read_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0)), 196#true, Black: 156#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 23#L859true, Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 158#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 225#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 227#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (= |#ghost~multithreaded| 0) (= ~x~0 1)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 146#true, Black: 165#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), 34#L810true, 310#true, Black: 176#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork1InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (= ~__unbuffered_p0_EAX~0 1) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (or (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork2InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 244#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))))), Black: 302#(and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (<= ~y$r_buff1_thd3~0 (* 256 (div ~y$r_buff1_thd3~0 256))) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd3~0 (* (div ~y$r_buff0_thd3~0 256) 256)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= ~y$r_buff1_thd1~0 (+ (* 256 (div ~y$r_buff1_thd1~0 256)) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff1_thd0~0 (+ (* 256 (div ~y$r_buff1_thd0~0 256)) 1)) (<= ~y$r_buff0_thd2~0 (+ (* 256 (div ~y$r_buff0_thd2~0 256)) 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff1_thd2~0 (+ (* 256 (div ~y$r_buff1_thd2~0 256)) 1)) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, 35#L758true, 294#true, Black: 58#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~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) (= ~y$w_buff0_used~0 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff0_thd3~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 0 (div ~y$r_buff0_thd3~0 256)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~y$r_buff1_thd3~0 0) (= ~y$mem_tmp~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~y$r_buff1_thd1~0 0))]) [2024-06-27 23:06:16,781 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-27 23:06:16,782 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 23:06:16,782 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 23:06:16,782 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-27 23:06:16,943 INFO L124 PetriNetUnfolderBase]: 1554/2628 cut-off events. [2024-06-27 23:06:16,943 INFO L125 PetriNetUnfolderBase]: For 56016/56078 co-relation queries the response was YES. [2024-06-27 23:06:16,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 2628 events. 1554/2628 cut-off events. For 56016/56078 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15297 event pairs, 833 based on Foata normal form. 22/2600 useless extension candidates. Maximal degree in co-relation 13658. Up to 2227 conditions per place. [2024-06-27 23:06:16,959 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 102 selfloop transitions, 10 changer transitions 0/187 dead transitions. [2024-06-27 23:06:16,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 187 transitions, 2256 flow [2024-06-27 23:06:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:06:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:06:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-06-27 23:06:16,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:06:16,961 INFO L175 Difference]: Start difference. First operand has 121 places, 177 transitions, 1988 flow. Second operand 6 states and 124 transitions. [2024-06-27 23:06:16,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 187 transitions, 2256 flow [2024-06-27 23:06:17,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 187 transitions, 2191 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:06:17,014 INFO L231 Difference]: Finished difference. Result has 124 places, 180 transitions, 1975 flow [2024-06-27 23:06:17,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1975, PETRI_PLACES=124, PETRI_TRANSITIONS=180} [2024-06-27 23:06:17,015 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2024-06-27 23:06:17,015 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 180 transitions, 1975 flow [2024-06-27 23:06:17,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-27 23:06:17,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:17,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:17,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:06:17,016 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:17,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1999484143, now seen corresponding path program 1 times [2024-06-27 23:06:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767573131] [2024-06-27 23:06:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:18,782 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-27 23:06:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767573131] [2024-06-27 23:06:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767573131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871263148] [2024-06-27 23:06:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:18,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:18,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:18,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:18,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 180 transitions, 1975 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:18,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:18,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:18,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:19,819 INFO L124 PetriNetUnfolderBase]: 2261/3431 cut-off events. [2024-06-27 23:06:19,819 INFO L125 PetriNetUnfolderBase]: For 64458/64461 co-relation queries the response was YES. [2024-06-27 23:06:19,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17930 conditions, 3431 events. 2261/3431 cut-off events. For 64458/64461 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 17175 event pairs, 713 based on Foata normal form. 6/3424 useless extension candidates. Maximal degree in co-relation 17868. Up to 2819 conditions per place. [2024-06-27 23:06:19,848 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 101 selfloop transitions, 114 changer transitions 0/220 dead transitions. [2024-06-27 23:06:19,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 220 transitions, 2755 flow [2024-06-27 23:06:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-27 23:06:19,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49127906976744184 [2024-06-27 23:06:19,850 INFO L175 Difference]: Start difference. First operand has 124 places, 180 transitions, 1975 flow. Second operand 8 states and 169 transitions. [2024-06-27 23:06:19,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 220 transitions, 2755 flow [2024-06-27 23:06:19,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 220 transitions, 2725 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:19,945 INFO L231 Difference]: Finished difference. Result has 128 places, 189 transitions, 2280 flow [2024-06-27 23:06:19,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2280, PETRI_PLACES=128, PETRI_TRANSITIONS=189} [2024-06-27 23:06:19,946 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2024-06-27 23:06:19,946 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 189 transitions, 2280 flow [2024-06-27 23:06:19,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:19,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:19,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:19,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:06:19,947 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:19,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1677888663, now seen corresponding path program 1 times [2024-06-27 23:06:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345052070] [2024-06-27 23:06:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:21,282 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-27 23:06:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345052070] [2024-06-27 23:06:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345052070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064854563] [2024-06-27 23:06:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:21,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:21,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:21,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 189 transitions, 2280 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:21,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:21,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:21,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:22,222 INFO L124 PetriNetUnfolderBase]: 2296/3495 cut-off events. [2024-06-27 23:06:22,222 INFO L125 PetriNetUnfolderBase]: For 72492/72496 co-relation queries the response was YES. [2024-06-27 23:06:22,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19145 conditions, 3495 events. 2296/3495 cut-off events. For 72492/72496 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 17652 event pairs, 941 based on Foata normal form. 6/3500 useless extension candidates. Maximal degree in co-relation 19082. Up to 3265 conditions per place. [2024-06-27 23:06:22,242 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 181 selfloop transitions, 48 changer transitions 0/234 dead transitions. [2024-06-27 23:06:22,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 234 transitions, 2961 flow [2024-06-27 23:06:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 23:06:22,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45219638242894056 [2024-06-27 23:06:22,243 INFO L175 Difference]: Start difference. First operand has 128 places, 189 transitions, 2280 flow. Second operand 9 states and 175 transitions. [2024-06-27 23:06:22,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 234 transitions, 2961 flow [2024-06-27 23:06:22,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 234 transitions, 2911 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-27 23:06:22,323 INFO L231 Difference]: Finished difference. Result has 136 places, 202 transitions, 2462 flow [2024-06-27 23:06:22,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2462, PETRI_PLACES=136, PETRI_TRANSITIONS=202} [2024-06-27 23:06:22,324 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 92 predicate places. [2024-06-27 23:06:22,324 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 202 transitions, 2462 flow [2024-06-27 23:06:22,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:22,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:22,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:22,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:06:22,325 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:22,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -37134693, now seen corresponding path program 2 times [2024-06-27 23:06:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:22,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932972826] [2024-06-27 23:06:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:23,381 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-27 23:06:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:23,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932972826] [2024-06-27 23:06:23,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932972826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:23,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:23,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:23,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365228586] [2024-06-27 23:06:23,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:23,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:23,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:23,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:23,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:23,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 202 transitions, 2462 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:23,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:23,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:24,314 INFO L124 PetriNetUnfolderBase]: 2354/3583 cut-off events. [2024-06-27 23:06:24,315 INFO L125 PetriNetUnfolderBase]: For 80868/80874 co-relation queries the response was YES. [2024-06-27 23:06:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20475 conditions, 3583 events. 2354/3583 cut-off events. For 80868/80874 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18122 event pairs, 919 based on Foata normal form. 8/3589 useless extension candidates. Maximal degree in co-relation 20408. Up to 3316 conditions per place. [2024-06-27 23:06:24,337 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 189 selfloop transitions, 69 changer transitions 0/263 dead transitions. [2024-06-27 23:06:24,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 263 transitions, 3514 flow [2024-06-27 23:06:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:06:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:06:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-27 23:06:24,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4439746300211416 [2024-06-27 23:06:24,339 INFO L175 Difference]: Start difference. First operand has 136 places, 202 transitions, 2462 flow. Second operand 11 states and 210 transitions. [2024-06-27 23:06:24,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 263 transitions, 3514 flow [2024-06-27 23:06:24,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 263 transitions, 3357 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:24,486 INFO L231 Difference]: Finished difference. Result has 145 places, 222 transitions, 2737 flow [2024-06-27 23:06:24,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2737, PETRI_PLACES=145, PETRI_TRANSITIONS=222} [2024-06-27 23:06:24,486 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 101 predicate places. [2024-06-27 23:06:24,487 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 222 transitions, 2737 flow [2024-06-27 23:06:24,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:24,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:24,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:24,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:06:24,489 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:24,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1698120929, now seen corresponding path program 2 times [2024-06-27 23:06:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791563979] [2024-06-27 23:06:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:25,600 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-27 23:06:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791563979] [2024-06-27 23:06:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791563979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581029960] [2024-06-27 23:06:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:25,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:25,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:25,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:25,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 222 transitions, 2737 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:25,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:25,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:25,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:26,534 INFO L124 PetriNetUnfolderBase]: 2444/3730 cut-off events. [2024-06-27 23:06:26,534 INFO L125 PetriNetUnfolderBase]: For 92831/92835 co-relation queries the response was YES. [2024-06-27 23:06:26,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21909 conditions, 3730 events. 2444/3730 cut-off events. For 92831/92835 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19051 event pairs, 878 based on Foata normal form. 8/3733 useless extension candidates. Maximal degree in co-relation 21839. Up to 3035 conditions per place. [2024-06-27 23:06:26,558 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 135 selfloop transitions, 136 changer transitions 0/276 dead transitions. [2024-06-27 23:06:26,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 276 transitions, 3717 flow [2024-06-27 23:06:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-06-27 23:06:26,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48578811369509045 [2024-06-27 23:06:26,560 INFO L175 Difference]: Start difference. First operand has 145 places, 222 transitions, 2737 flow. Second operand 9 states and 188 transitions. [2024-06-27 23:06:26,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 276 transitions, 3717 flow [2024-06-27 23:06:26,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 276 transitions, 3557 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:26,726 INFO L231 Difference]: Finished difference. Result has 149 places, 238 transitions, 3068 flow [2024-06-27 23:06:26,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3068, PETRI_PLACES=149, PETRI_TRANSITIONS=238} [2024-06-27 23:06:26,727 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 105 predicate places. [2024-06-27 23:06:26,727 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 238 transitions, 3068 flow [2024-06-27 23:06:26,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:26,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:26,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:26,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:06:26,728 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:26,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1697054033, now seen corresponding path program 3 times [2024-06-27 23:06:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:26,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135232622] [2024-06-27 23:06:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:27,755 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-27 23:06:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:27,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135232622] [2024-06-27 23:06:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135232622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:27,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:27,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709882559] [2024-06-27 23:06:27,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:27,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:27,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:27,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 238 transitions, 3068 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:27,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:27,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:27,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:28,780 INFO L124 PetriNetUnfolderBase]: 2465/3750 cut-off events. [2024-06-27 23:06:28,780 INFO L125 PetriNetUnfolderBase]: For 99000/99005 co-relation queries the response was YES. [2024-06-27 23:06:28,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22963 conditions, 3750 events. 2465/3750 cut-off events. For 99000/99005 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19087 event pairs, 868 based on Foata normal form. 6/3754 useless extension candidates. Maximal degree in co-relation 22891. Up to 3259 conditions per place. [2024-06-27 23:06:28,806 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 151 selfloop transitions, 126 changer transitions 0/282 dead transitions. [2024-06-27 23:06:28,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 282 transitions, 4079 flow [2024-06-27 23:06:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-27 23:06:28,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702842377260982 [2024-06-27 23:06:28,808 INFO L175 Difference]: Start difference. First operand has 149 places, 238 transitions, 3068 flow. Second operand 9 states and 182 transitions. [2024-06-27 23:06:28,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 282 transitions, 4079 flow [2024-06-27 23:06:28,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 282 transitions, 3864 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:28,934 INFO L231 Difference]: Finished difference. Result has 154 places, 249 transitions, 3332 flow [2024-06-27 23:06:28,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2853, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3332, PETRI_PLACES=154, PETRI_TRANSITIONS=249} [2024-06-27 23:06:28,935 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2024-06-27 23:06:28,935 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 249 transitions, 3332 flow [2024-06-27 23:06:28,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:28,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:28,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:28,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 23:06:28,935 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:28,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1736843515, now seen corresponding path program 4 times [2024-06-27 23:06:28,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:28,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105236682] [2024-06-27 23:06:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:28,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:30,410 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-27 23:06:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105236682] [2024-06-27 23:06:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105236682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:30,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:30,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:30,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382566610] [2024-06-27 23:06:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:30,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:30,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:30,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:30,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:30,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 249 transitions, 3332 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:30,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:30,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:30,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:31,463 INFO L124 PetriNetUnfolderBase]: 2523/3848 cut-off events. [2024-06-27 23:06:31,463 INFO L125 PetriNetUnfolderBase]: For 108171/108173 co-relation queries the response was YES. [2024-06-27 23:06:31,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24122 conditions, 3848 events. 2523/3848 cut-off events. For 108171/108173 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19695 event pairs, 718 based on Foata normal form. 5/3852 useless extension candidates. Maximal degree in co-relation 24048. Up to 3567 conditions per place. [2024-06-27 23:06:31,486 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 228 selfloop transitions, 67 changer transitions 0/300 dead transitions. [2024-06-27 23:06:31,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 300 transitions, 4294 flow [2024-06-27 23:06:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-27 23:06:31,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-27 23:06:31,488 INFO L175 Difference]: Start difference. First operand has 154 places, 249 transitions, 3332 flow. Second operand 8 states and 165 transitions. [2024-06-27 23:06:31,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 300 transitions, 4294 flow [2024-06-27 23:06:31,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 300 transitions, 4160 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:31,652 INFO L231 Difference]: Finished difference. Result has 159 places, 272 transitions, 3650 flow [2024-06-27 23:06:31,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3206, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3650, PETRI_PLACES=159, PETRI_TRANSITIONS=272} [2024-06-27 23:06:31,652 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places. [2024-06-27 23:06:31,652 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 272 transitions, 3650 flow [2024-06-27 23:06:31,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:31,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:31,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:31,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 23:06:31,653 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:31,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1736723545, now seen corresponding path program 5 times [2024-06-27 23:06:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:31,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562169316] [2024-06-27 23:06:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:32,862 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-27 23:06:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562169316] [2024-06-27 23:06:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562169316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:32,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:32,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113856044] [2024-06-27 23:06:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:32,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:32,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:32,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:32,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:32,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 272 transitions, 3650 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:32,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:32,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:32,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:33,932 INFO L124 PetriNetUnfolderBase]: 2574/3938 cut-off events. [2024-06-27 23:06:33,933 INFO L125 PetriNetUnfolderBase]: For 115588/115593 co-relation queries the response was YES. [2024-06-27 23:06:33,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24874 conditions, 3938 events. 2574/3938 cut-off events. For 115588/115593 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 20427 event pairs, 737 based on Foata normal form. 7/3943 useless extension candidates. Maximal degree in co-relation 24798. Up to 3369 conditions per place. [2024-06-27 23:06:33,962 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 161 selfloop transitions, 156 changer transitions 0/322 dead transitions. [2024-06-27 23:06:33,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 322 transitions, 4912 flow [2024-06-27 23:06:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2024-06-27 23:06:33,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087209302325582 [2024-06-27 23:06:33,964 INFO L175 Difference]: Start difference. First operand has 159 places, 272 transitions, 3650 flow. Second operand 8 states and 175 transitions. [2024-06-27 23:06:33,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 322 transitions, 4912 flow [2024-06-27 23:06:34,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 322 transitions, 4786 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 23:06:34,129 INFO L231 Difference]: Finished difference. Result has 165 places, 289 transitions, 4118 flow [2024-06-27 23:06:34,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3524, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4118, PETRI_PLACES=165, PETRI_TRANSITIONS=289} [2024-06-27 23:06:34,130 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 121 predicate places. [2024-06-27 23:06:34,130 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 289 transitions, 4118 flow [2024-06-27 23:06:34,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:34,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:34,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:34,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 23:06:34,130 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:34,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1736723359, now seen corresponding path program 3 times [2024-06-27 23:06:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022206526] [2024-06-27 23:06:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:35,513 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-27 23:06:35,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:35,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022206526] [2024-06-27 23:06:35,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022206526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:35,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:35,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:35,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849717357] [2024-06-27 23:06:35,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:35,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:35,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:35,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:35,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:35,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:35,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 289 transitions, 4118 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:35,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:35,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:35,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:36,567 INFO L124 PetriNetUnfolderBase]: 2658/4095 cut-off events. [2024-06-27 23:06:36,567 INFO L125 PetriNetUnfolderBase]: For 129146/129150 co-relation queries the response was YES. [2024-06-27 23:06:36,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26121 conditions, 4095 events. 2658/4095 cut-off events. For 129146/129150 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 21659 event pairs, 878 based on Foata normal form. 10/4100 useless extension candidates. Maximal degree in co-relation 26044. Up to 3298 conditions per place. [2024-06-27 23:06:36,598 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 192 selfloop transitions, 146 changer transitions 0/343 dead transitions. [2024-06-27 23:06:36,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 343 transitions, 5361 flow [2024-06-27 23:06:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-06-27 23:06:36,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232558139534884 [2024-06-27 23:06:36,600 INFO L175 Difference]: Start difference. First operand has 165 places, 289 transitions, 4118 flow. Second operand 8 states and 180 transitions. [2024-06-27 23:06:36,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 343 transitions, 5361 flow [2024-06-27 23:06:36,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 343 transitions, 5114 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:36,846 INFO L231 Difference]: Finished difference. Result has 170 places, 305 transitions, 4374 flow [2024-06-27 23:06:36,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3871, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4374, PETRI_PLACES=170, PETRI_TRANSITIONS=305} [2024-06-27 23:06:36,847 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 126 predicate places. [2024-06-27 23:06:36,847 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 305 transitions, 4374 flow [2024-06-27 23:06:36,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:36,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:36,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:36,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 23:06:36,848 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:36,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash -701611039, now seen corresponding path program 4 times [2024-06-27 23:06:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846418045] [2024-06-27 23:06:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:38,036 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-27 23:06:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:38,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846418045] [2024-06-27 23:06:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846418045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:38,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348290602] [2024-06-27 23:06:38,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:38,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:38,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:38,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:38,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:38,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 305 transitions, 4374 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:38,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:38,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:38,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:39,122 INFO L124 PetriNetUnfolderBase]: 2728/4198 cut-off events. [2024-06-27 23:06:39,122 INFO L125 PetriNetUnfolderBase]: For 141712/141716 co-relation queries the response was YES. [2024-06-27 23:06:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27246 conditions, 4198 events. 2728/4198 cut-off events. For 141712/141716 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 22230 event pairs, 843 based on Foata normal form. 12/4205 useless extension candidates. Maximal degree in co-relation 27168. Up to 3361 conditions per place. [2024-06-27 23:06:39,153 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 198 selfloop transitions, 154 changer transitions 0/357 dead transitions. [2024-06-27 23:06:39,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 357 transitions, 5696 flow [2024-06-27 23:06:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-06-27 23:06:39,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261627906976745 [2024-06-27 23:06:39,154 INFO L175 Difference]: Start difference. First operand has 170 places, 305 transitions, 4374 flow. Second operand 8 states and 181 transitions. [2024-06-27 23:06:39,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 357 transitions, 5696 flow [2024-06-27 23:06:39,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 357 transitions, 5508 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 23:06:39,363 INFO L231 Difference]: Finished difference. Result has 175 places, 317 transitions, 4675 flow [2024-06-27 23:06:39,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4198, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4675, PETRI_PLACES=175, PETRI_TRANSITIONS=317} [2024-06-27 23:06:39,364 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 131 predicate places. [2024-06-27 23:06:39,365 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 317 transitions, 4675 flow [2024-06-27 23:06:39,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:39,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:39,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:39,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 23:06:39,365 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:39,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1732081915, now seen corresponding path program 6 times [2024-06-27 23:06:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532452022] [2024-06-27 23:06:39,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:40,551 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-27 23:06:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:40,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532452022] [2024-06-27 23:06:40,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532452022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:40,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:40,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000758879] [2024-06-27 23:06:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:40,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:40,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:40,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 317 transitions, 4675 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:40,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:40,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:40,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:41,596 INFO L124 PetriNetUnfolderBase]: 2730/4176 cut-off events. [2024-06-27 23:06:41,596 INFO L125 PetriNetUnfolderBase]: For 146898/146901 co-relation queries the response was YES. [2024-06-27 23:06:41,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27537 conditions, 4176 events. 2730/4176 cut-off events. For 146898/146901 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 21851 event pairs, 745 based on Foata normal form. 5/4179 useless extension candidates. Maximal degree in co-relation 27458. Up to 3592 conditions per place. [2024-06-27 23:06:41,626 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 185 selfloop transitions, 161 changer transitions 0/351 dead transitions. [2024-06-27 23:06:41,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 351 transitions, 5747 flow [2024-06-27 23:06:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-27 23:06:41,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49709302325581395 [2024-06-27 23:06:41,628 INFO L175 Difference]: Start difference. First operand has 175 places, 317 transitions, 4675 flow. Second operand 8 states and 171 transitions. [2024-06-27 23:06:41,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 351 transitions, 5747 flow [2024-06-27 23:06:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 351 transitions, 5473 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:41,957 INFO L231 Difference]: Finished difference. Result has 179 places, 320 transitions, 4788 flow [2024-06-27 23:06:41,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4401, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4788, PETRI_PLACES=179, PETRI_TRANSITIONS=320} [2024-06-27 23:06:41,958 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places. [2024-06-27 23:06:41,958 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 320 transitions, 4788 flow [2024-06-27 23:06:41,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:41,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:41,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:41,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 23:06:41,958 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:41,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -734672539, now seen corresponding path program 5 times [2024-06-27 23:06:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094112606] [2024-06-27 23:06:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:43,144 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-27 23:06:43,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094112606] [2024-06-27 23:06:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094112606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:43,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:43,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959623937] [2024-06-27 23:06:43,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:43,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:43,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:43,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:43,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 320 transitions, 4788 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:43,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:43,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:43,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:44,217 INFO L124 PetriNetUnfolderBase]: 2708/4175 cut-off events. [2024-06-27 23:06:44,217 INFO L125 PetriNetUnfolderBase]: For 156207/156211 co-relation queries the response was YES. [2024-06-27 23:06:44,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27297 conditions, 4175 events. 2708/4175 cut-off events. For 156207/156211 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 22205 event pairs, 849 based on Foata normal form. 12/4182 useless extension candidates. Maximal degree in co-relation 27217. Up to 3346 conditions per place. [2024-06-27 23:06:44,259 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 191 selfloop transitions, 160 changer transitions 0/356 dead transitions. [2024-06-27 23:06:44,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 356 transitions, 5831 flow [2024-06-27 23:06:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 23:06:44,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145348837209303 [2024-06-27 23:06:44,262 INFO L175 Difference]: Start difference. First operand has 179 places, 320 transitions, 4788 flow. Second operand 8 states and 177 transitions. [2024-06-27 23:06:44,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 356 transitions, 5831 flow [2024-06-27 23:06:44,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 356 transitions, 5517 flow, removed 55 selfloop flow, removed 3 redundant places. [2024-06-27 23:06:44,542 INFO L231 Difference]: Finished difference. Result has 184 places, 320 transitions, 4809 flow [2024-06-27 23:06:44,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4474, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4809, PETRI_PLACES=184, PETRI_TRANSITIONS=320} [2024-06-27 23:06:44,543 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 140 predicate places. [2024-06-27 23:06:44,543 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 320 transitions, 4809 flow [2024-06-27 23:06:44,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:44,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:44,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:44,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 23:06:44,544 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:44,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 636576739, now seen corresponding path program 7 times [2024-06-27 23:06:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056686644] [2024-06-27 23:06:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:45,943 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-27 23:06:45,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:45,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056686644] [2024-06-27 23:06:45,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056686644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251204031] [2024-06-27 23:06:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:45,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:46,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:46,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 320 transitions, 4809 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:46,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:46,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:46,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:47,213 INFO L124 PetriNetUnfolderBase]: 2742/4207 cut-off events. [2024-06-27 23:06:47,213 INFO L125 PetriNetUnfolderBase]: For 160524/160524 co-relation queries the response was YES. [2024-06-27 23:06:47,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27776 conditions, 4207 events. 2742/4207 cut-off events. For 160524/160524 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 22183 event pairs, 756 based on Foata normal form. 3/4200 useless extension candidates. Maximal degree in co-relation 27695. Up to 3871 conditions per place. [2024-06-27 23:06:47,240 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 277 selfloop transitions, 78 changer transitions 0/360 dead transitions. [2024-06-27 23:06:47,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 360 transitions, 5832 flow [2024-06-27 23:06:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:06:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:06:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 23:06:47,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43410852713178294 [2024-06-27 23:06:47,242 INFO L175 Difference]: Start difference. First operand has 184 places, 320 transitions, 4809 flow. Second operand 9 states and 168 transitions. [2024-06-27 23:06:47,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 360 transitions, 5832 flow [2024-06-27 23:06:47,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 360 transitions, 5511 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 23:06:47,500 INFO L231 Difference]: Finished difference. Result has 187 places, 339 transitions, 4922 flow [2024-06-27 23:06:47,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4488, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4922, PETRI_PLACES=187, PETRI_TRANSITIONS=339} [2024-06-27 23:06:47,501 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 143 predicate places. [2024-06-27 23:06:47,501 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 339 transitions, 4922 flow [2024-06-27 23:06:47,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:47,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:47,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:47,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 23:06:47,502 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:47,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash 636581389, now seen corresponding path program 8 times [2024-06-27 23:06:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:47,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020358684] [2024-06-27 23:06:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:48,845 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-27 23:06:48,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020358684] [2024-06-27 23:06:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020358684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:48,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:48,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259477916] [2024-06-27 23:06:48,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:48,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:48,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:48,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 339 transitions, 4922 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:48,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:48,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:48,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:50,053 INFO L124 PetriNetUnfolderBase]: 2781/4279 cut-off events. [2024-06-27 23:06:50,053 INFO L125 PetriNetUnfolderBase]: For 169336/169339 co-relation queries the response was YES. [2024-06-27 23:06:50,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28019 conditions, 4279 events. 2781/4279 cut-off events. For 169336/169339 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22799 event pairs, 793 based on Foata normal form. 5/4264 useless extension candidates. Maximal degree in co-relation 27936. Up to 3637 conditions per place. [2024-06-27 23:06:50,086 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 187 selfloop transitions, 186 changer transitions 0/378 dead transitions. [2024-06-27 23:06:50,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 378 transitions, 6090 flow [2024-06-27 23:06:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-27 23:06:50,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-27 23:06:50,088 INFO L175 Difference]: Start difference. First operand has 187 places, 339 transitions, 4922 flow. Second operand 8 states and 164 transitions. [2024-06-27 23:06:50,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 378 transitions, 6090 flow [2024-06-27 23:06:50,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 378 transitions, 5889 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 23:06:50,404 INFO L231 Difference]: Finished difference. Result has 188 places, 354 transitions, 5288 flow [2024-06-27 23:06:50,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4721, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5288, PETRI_PLACES=188, PETRI_TRANSITIONS=354} [2024-06-27 23:06:50,405 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 144 predicate places. [2024-06-27 23:06:50,405 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 354 transitions, 5288 flow [2024-06-27 23:06:50,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:50,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:50,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:50,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 23:06:50,406 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:50,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1994836003, now seen corresponding path program 6 times [2024-06-27 23:06:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293371163] [2024-06-27 23:06:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:50,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:51,914 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-27 23:06:51,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293371163] [2024-06-27 23:06:51,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293371163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:51,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:51,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:51,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191036273] [2024-06-27 23:06:51,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:51,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:51,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:51,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:51,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:51,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:51,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 354 transitions, 5288 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:51,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:51,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:51,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:53,169 INFO L124 PetriNetUnfolderBase]: 2903/4465 cut-off events. [2024-06-27 23:06:53,169 INFO L125 PetriNetUnfolderBase]: For 188639/188645 co-relation queries the response was YES. [2024-06-27 23:06:53,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29696 conditions, 4465 events. 2903/4465 cut-off events. For 188639/188645 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23897 event pairs, 739 based on Foata normal form. 12/4458 useless extension candidates. Maximal degree in co-relation 29612. Up to 3559 conditions per place. [2024-06-27 23:06:53,203 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 227 selfloop transitions, 172 changer transitions 0/404 dead transitions. [2024-06-27 23:06:53,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 404 transitions, 6779 flow [2024-06-27 23:06:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-27 23:06:53,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49127906976744184 [2024-06-27 23:06:53,205 INFO L175 Difference]: Start difference. First operand has 188 places, 354 transitions, 5288 flow. Second operand 8 states and 169 transitions. [2024-06-27 23:06:53,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 404 transitions, 6779 flow [2024-06-27 23:06:53,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 404 transitions, 6500 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:53,498 INFO L231 Difference]: Finished difference. Result has 191 places, 372 transitions, 5630 flow [2024-06-27 23:06:53,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5009, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5630, PETRI_PLACES=191, PETRI_TRANSITIONS=372} [2024-06-27 23:06:53,498 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places. [2024-06-27 23:06:53,498 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 372 transitions, 5630 flow [2024-06-27 23:06:53,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:53,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:53,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:53,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 23:06:53,499 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:53,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1994842513, now seen corresponding path program 7 times [2024-06-27 23:06:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495208477] [2024-06-27 23:06:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:54,892 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-27 23:06:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495208477] [2024-06-27 23:06:54,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495208477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:54,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:54,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881282119] [2024-06-27 23:06:54,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:54,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:54,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:54,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:54,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:54,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 372 transitions, 5630 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:54,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:54,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:54,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:56,151 INFO L124 PetriNetUnfolderBase]: 2881/4423 cut-off events. [2024-06-27 23:06:56,151 INFO L125 PetriNetUnfolderBase]: For 195814/195820 co-relation queries the response was YES. [2024-06-27 23:06:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29691 conditions, 4423 events. 2881/4423 cut-off events. For 195814/195820 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23630 event pairs, 783 based on Foata normal form. 12/4416 useless extension candidates. Maximal degree in co-relation 29605. Up to 3541 conditions per place. [2024-06-27 23:06:56,188 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 232 selfloop transitions, 168 changer transitions 0/405 dead transitions. [2024-06-27 23:06:56,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 405 transitions, 6778 flow [2024-06-27 23:06:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-27 23:06:56,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49127906976744184 [2024-06-27 23:06:56,190 INFO L175 Difference]: Start difference. First operand has 191 places, 372 transitions, 5630 flow. Second operand 8 states and 169 transitions. [2024-06-27 23:06:56,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 405 transitions, 6778 flow [2024-06-27 23:06:56,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 405 transitions, 6426 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-27 23:06:56,538 INFO L231 Difference]: Finished difference. Result has 195 places, 372 transitions, 5634 flow [2024-06-27 23:06:56,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5278, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5634, PETRI_PLACES=195, PETRI_TRANSITIONS=372} [2024-06-27 23:06:56,538 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-06-27 23:06:56,538 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 372 transitions, 5634 flow [2024-06-27 23:06:56,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:56,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:56,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:56,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 23:06:56,539 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:56,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1994842699, now seen corresponding path program 9 times [2024-06-27 23:06:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103223452] [2024-06-27 23:06:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:06:57,895 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-27 23:06:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:06:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103223452] [2024-06-27 23:06:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103223452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:06:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:06:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:06:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011002065] [2024-06-27 23:06:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:06:57,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:06:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:06:57,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:06:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:06:57,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:06:57,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 372 transitions, 5634 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:57,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:06:57,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:06:57,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:06:59,201 INFO L124 PetriNetUnfolderBase]: 2906/4476 cut-off events. [2024-06-27 23:06:59,201 INFO L125 PetriNetUnfolderBase]: For 204362/204365 co-relation queries the response was YES. [2024-06-27 23:06:59,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30153 conditions, 4476 events. 2906/4476 cut-off events. For 204362/204365 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 24110 event pairs, 818 based on Foata normal form. 6/4462 useless extension candidates. Maximal degree in co-relation 30066. Up to 3809 conditions per place. [2024-06-27 23:06:59,234 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 209 selfloop transitions, 193 changer transitions 0/407 dead transitions. [2024-06-27 23:06:59,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 407 transitions, 6940 flow [2024-06-27 23:06:59,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:06:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:06:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-27 23:06:59,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-27 23:06:59,236 INFO L175 Difference]: Start difference. First operand has 195 places, 372 transitions, 5634 flow. Second operand 8 states and 164 transitions. [2024-06-27 23:06:59,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 407 transitions, 6940 flow [2024-06-27 23:06:59,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 407 transitions, 6660 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 23:06:59,681 INFO L231 Difference]: Finished difference. Result has 198 places, 381 transitions, 5936 flow [2024-06-27 23:06:59,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5354, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5936, PETRI_PLACES=198, PETRI_TRANSITIONS=381} [2024-06-27 23:06:59,681 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places. [2024-06-27 23:06:59,682 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 381 transitions, 5936 flow [2024-06-27 23:06:59,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:06:59,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:06:59,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:06:59,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 23:06:59,682 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:06:59,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:06:59,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1730384735, now seen corresponding path program 8 times [2024-06-27 23:06:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:06:59,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89138693] [2024-06-27 23:06:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:06:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:06:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:01,030 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-27 23:07:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89138693] [2024-06-27 23:07:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89138693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:01,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:01,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:07:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845348828] [2024-06-27 23:07:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:01,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:07:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:01,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:07:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:07:01,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:01,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 381 transitions, 5936 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:01,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:01,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:01,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:02,245 INFO L124 PetriNetUnfolderBase]: 2956/4557 cut-off events. [2024-06-27 23:07:02,246 INFO L125 PetriNetUnfolderBase]: For 217650/217659 co-relation queries the response was YES. [2024-06-27 23:07:02,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30785 conditions, 4557 events. 2956/4557 cut-off events. For 217650/217659 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24510 event pairs, 702 based on Foata normal form. 14/4562 useless extension candidates. Maximal degree in co-relation 30696. Up to 3622 conditions per place. [2024-06-27 23:07:02,286 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 216 selfloop transitions, 196 changer transitions 0/417 dead transitions. [2024-06-27 23:07:02,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 417 transitions, 7176 flow [2024-06-27 23:07:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:07:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:07:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-27 23:07:02,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2024-06-27 23:07:02,288 INFO L175 Difference]: Start difference. First operand has 198 places, 381 transitions, 5936 flow. Second operand 8 states and 162 transitions. [2024-06-27 23:07:02,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 417 transitions, 7176 flow [2024-06-27 23:07:02,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 417 transitions, 6846 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-27 23:07:02,731 INFO L231 Difference]: Finished difference. Result has 202 places, 390 transitions, 6151 flow [2024-06-27 23:07:02,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5606, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6151, PETRI_PLACES=202, PETRI_TRANSITIONS=390} [2024-06-27 23:07:02,732 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 158 predicate places. [2024-06-27 23:07:02,732 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 390 transitions, 6151 flow [2024-06-27 23:07:02,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:02,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:02,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:02,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 23:07:02,732 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:02,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash 842721813, now seen corresponding path program 9 times [2024-06-27 23:07:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803449087] [2024-06-27 23:07:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:04,093 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-27 23:07:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:04,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803449087] [2024-06-27 23:07:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803449087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:04,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:07:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264710227] [2024-06-27 23:07:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:04,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:07:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:07:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:07:04,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:04,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 390 transitions, 6151 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:04,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:04,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:04,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:05,280 INFO L124 PetriNetUnfolderBase]: 3006/4638 cut-off events. [2024-06-27 23:07:05,280 INFO L125 PetriNetUnfolderBase]: For 231987/231996 co-relation queries the response was YES. [2024-06-27 23:07:05,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31737 conditions, 4638 events. 3006/4638 cut-off events. For 231987/231996 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25094 event pairs, 706 based on Foata normal form. 14/4643 useless extension candidates. Maximal degree in co-relation 31646. Up to 3667 conditions per place. [2024-06-27 23:07:05,320 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 239 selfloop transitions, 187 changer transitions 0/431 dead transitions. [2024-06-27 23:07:05,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 431 transitions, 7516 flow [2024-06-27 23:07:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:07:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:07:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-27 23:07:05,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-27 23:07:05,321 INFO L175 Difference]: Start difference. First operand has 202 places, 390 transitions, 6151 flow. Second operand 8 states and 165 transitions. [2024-06-27 23:07:05,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 431 transitions, 7516 flow [2024-06-27 23:07:05,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 431 transitions, 7154 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:05,760 INFO L231 Difference]: Finished difference. Result has 204 places, 399 transitions, 6334 flow [2024-06-27 23:07:05,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5798, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6334, PETRI_PLACES=204, PETRI_TRANSITIONS=399} [2024-06-27 23:07:05,760 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 160 predicate places. [2024-06-27 23:07:05,761 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 399 transitions, 6334 flow [2024-06-27 23:07:05,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:05,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:05,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 23:07:05,761 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:05,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash 842715117, now seen corresponding path program 10 times [2024-06-27 23:07:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:05,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944985103] [2024-06-27 23:07:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:05,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:07,179 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-27 23:07:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944985103] [2024-06-27 23:07:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944985103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:07,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:07:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267037822] [2024-06-27 23:07:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:07,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:07:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:07:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:07:07,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:07,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 399 transitions, 6334 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:07,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:07,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:07,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:08,412 INFO L124 PetriNetUnfolderBase]: 2995/4621 cut-off events. [2024-06-27 23:07:08,413 INFO L125 PetriNetUnfolderBase]: For 237975/237975 co-relation queries the response was YES. [2024-06-27 23:07:08,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31661 conditions, 4621 events. 2995/4621 cut-off events. For 237975/237975 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 24984 event pairs, 798 based on Foata normal form. 4/4609 useless extension candidates. Maximal degree in co-relation 31569. Up to 3942 conditions per place. [2024-06-27 23:07:08,453 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 215 selfloop transitions, 201 changer transitions 0/421 dead transitions. [2024-06-27 23:07:08,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 421 transitions, 7319 flow [2024-06-27 23:07:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:07:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:07:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-27 23:07:08,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45930232558139533 [2024-06-27 23:07:08,454 INFO L175 Difference]: Start difference. First operand has 204 places, 399 transitions, 6334 flow. Second operand 8 states and 158 transitions. [2024-06-27 23:07:08,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 421 transitions, 7319 flow [2024-06-27 23:07:08,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 421 transitions, 6588 flow, removed 105 selfloop flow, removed 7 redundant places. [2024-06-27 23:07:08,887 INFO L231 Difference]: Finished difference. Result has 205 places, 399 transitions, 6023 flow [2024-06-27 23:07:08,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5603, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6023, PETRI_PLACES=205, PETRI_TRANSITIONS=399} [2024-06-27 23:07:08,888 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places. [2024-06-27 23:07:08,888 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 399 transitions, 6023 flow [2024-06-27 23:07:08,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:08,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:08,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:08,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 23:07:08,889 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:08,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 842715303, now seen corresponding path program 10 times [2024-06-27 23:07:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065203474] [2024-06-27 23:07:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:10,377 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-27 23:07:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065203474] [2024-06-27 23:07:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065203474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:07:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181135897] [2024-06-27 23:07:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:10,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:07:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:07:10,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:07:10,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:10,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 399 transitions, 6023 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:10,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:10,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:10,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:11,673 INFO L124 PetriNetUnfolderBase]: 2973/4591 cut-off events. [2024-06-27 23:07:11,673 INFO L125 PetriNetUnfolderBase]: For 238117/238126 co-relation queries the response was YES. [2024-06-27 23:07:11,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30884 conditions, 4591 events. 2973/4591 cut-off events. For 238117/238126 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 24824 event pairs, 696 based on Foata normal form. 14/4596 useless extension candidates. Maximal degree in co-relation 30791. Up to 3634 conditions per place. [2024-06-27 23:07:11,710 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 233 selfloop transitions, 189 changer transitions 0/427 dead transitions. [2024-06-27 23:07:11,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 427 transitions, 7048 flow [2024-06-27 23:07:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:07:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:07:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-27 23:07:11,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2024-06-27 23:07:11,712 INFO L175 Difference]: Start difference. First operand has 205 places, 399 transitions, 6023 flow. Second operand 8 states and 162 transitions. [2024-06-27 23:07:11,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 427 transitions, 7048 flow [2024-06-27 23:07:12,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 427 transitions, 6704 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:12,114 INFO L231 Difference]: Finished difference. Result has 207 places, 399 transitions, 6075 flow [2024-06-27 23:07:12,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5681, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6075, PETRI_PLACES=207, PETRI_TRANSITIONS=399} [2024-06-27 23:07:12,115 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 163 predicate places. [2024-06-27 23:07:12,115 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 399 transitions, 6075 flow [2024-06-27 23:07:12,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-27 23:07:12,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:12,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:12,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 23:07:12,116 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:12,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 851303853, now seen corresponding path program 1 times [2024-06-27 23:07:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:12,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137937722] [2024-06-27 23:07:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:14,039 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-27 23:07:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137937722] [2024-06-27 23:07:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137937722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:07:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888188195] [2024-06-27 23:07:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:14,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:07:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:07:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:07:14,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 23:07:14,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 399 transitions, 6075 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-27 23:07:14,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:14,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 23:07:14,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:15,172 INFO L124 PetriNetUnfolderBase]: 2772/4330 cut-off events. [2024-06-27 23:07:15,172 INFO L125 PetriNetUnfolderBase]: For 252062/252085 co-relation queries the response was YES. [2024-06-27 23:07:15,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29822 conditions, 4330 events. 2772/4330 cut-off events. For 252062/252085 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 24035 event pairs, 1063 based on Foata normal form. 26/4307 useless extension candidates. Maximal degree in co-relation 29727. Up to 3975 conditions per place. [2024-06-27 23:07:15,210 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 385 selfloop transitions, 18 changer transitions 0/427 dead transitions. [2024-06-27 23:07:15,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 427 transitions, 7089 flow [2024-06-27 23:07:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 23:07:15,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4315245478036176 [2024-06-27 23:07:15,212 INFO L175 Difference]: Start difference. First operand has 207 places, 399 transitions, 6075 flow. Second operand 9 states and 167 transitions. [2024-06-27 23:07:15,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 427 transitions, 7089 flow [2024-06-27 23:07:15,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 427 transitions, 6546 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 23:07:15,545 INFO L231 Difference]: Finished difference. Result has 209 places, 404 transitions, 5655 flow [2024-06-27 23:07:15,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5536, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5655, PETRI_PLACES=209, PETRI_TRANSITIONS=404} [2024-06-27 23:07:15,546 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 165 predicate places. [2024-06-27 23:07:15,546 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 404 transitions, 5655 flow [2024-06-27 23:07:15,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-27 23:07:15,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:15,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:15,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 23:07:15,547 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:15,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash 232426522, now seen corresponding path program 1 times [2024-06-27 23:07:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:15,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257696715] [2024-06-27 23:07:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:17,500 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-27 23:07:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257696715] [2024-06-27 23:07:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257696715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:17,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:17,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:07:17,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811559908] [2024-06-27 23:07:17,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:17,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:07:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:17,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:07:17,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:07:17,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-27 23:07:17,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 404 transitions, 5655 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-27 23:07:17,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:17,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-27 23:07:17,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:18,293 INFO L124 PetriNetUnfolderBase]: 2253/3724 cut-off events. [2024-06-27 23:07:18,293 INFO L125 PetriNetUnfolderBase]: For 253844/253942 co-relation queries the response was YES. [2024-06-27 23:07:18,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26557 conditions, 3724 events. 2253/3724 cut-off events. For 253844/253942 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22230 event pairs, 966 based on Foata normal form. 39/3678 useless extension candidates. Maximal degree in co-relation 26460. Up to 3163 conditions per place. [2024-06-27 23:07:18,325 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 269 selfloop transitions, 13 changer transitions 0/415 dead transitions. [2024-06-27 23:07:18,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 415 transitions, 6281 flow [2024-06-27 23:07:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:07:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:07:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-27 23:07:18,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-27 23:07:18,326 INFO L175 Difference]: Start difference. First operand has 209 places, 404 transitions, 5655 flow. Second operand 6 states and 123 transitions. [2024-06-27 23:07:18,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 415 transitions, 6281 flow [2024-06-27 23:07:18,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 415 transitions, 6209 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:18,757 INFO L231 Difference]: Finished difference. Result has 209 places, 407 transitions, 5647 flow [2024-06-27 23:07:18,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5583, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5647, PETRI_PLACES=209, PETRI_TRANSITIONS=407} [2024-06-27 23:07:18,758 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 165 predicate places. [2024-06-27 23:07:18,758 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 407 transitions, 5647 flow [2024-06-27 23:07:18,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-27 23:07:18,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:18,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:18,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 23:07:18,759 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:18,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 437753242, now seen corresponding path program 1 times [2024-06-27 23:07:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543991544] [2024-06-27 23:07:18,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:18,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:20,505 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-27 23:07:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:20,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543991544] [2024-06-27 23:07:20,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543991544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:20,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940536798] [2024-06-27 23:07:20,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:20,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:20,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:20,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 407 transitions, 5647 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:20,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:20,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:20,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:21,836 INFO L124 PetriNetUnfolderBase]: 2984/4604 cut-off events. [2024-06-27 23:07:21,836 INFO L125 PetriNetUnfolderBase]: For 254952/254952 co-relation queries the response was YES. [2024-06-27 23:07:21,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31553 conditions, 4604 events. 2984/4604 cut-off events. For 254952/254952 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24904 event pairs, 758 based on Foata normal form. 4/4598 useless extension candidates. Maximal degree in co-relation 31457. Up to 4192 conditions per place. [2024-06-27 23:07:21,877 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 350 selfloop transitions, 81 changer transitions 0/436 dead transitions. [2024-06-27 23:07:21,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 436 transitions, 6659 flow [2024-06-27 23:07:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-27 23:07:21,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325581395348837 [2024-06-27 23:07:21,879 INFO L175 Difference]: Start difference. First operand has 209 places, 407 transitions, 5647 flow. Second operand 10 states and 186 transitions. [2024-06-27 23:07:21,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 436 transitions, 6659 flow [2024-06-27 23:07:22,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 436 transitions, 6617 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 23:07:22,376 INFO L231 Difference]: Finished difference. Result has 215 places, 410 transitions, 5829 flow [2024-06-27 23:07:22,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5605, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5829, PETRI_PLACES=215, PETRI_TRANSITIONS=410} [2024-06-27 23:07:22,377 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 171 predicate places. [2024-06-27 23:07:22,377 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 410 transitions, 5829 flow [2024-06-27 23:07:22,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:22,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:22,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:22,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 23:07:22,377 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:22,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1355639764, now seen corresponding path program 2 times [2024-06-27 23:07:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:22,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833997423] [2024-06-27 23:07:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:23,468 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-27 23:07:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833997423] [2024-06-27 23:07:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833997423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:23,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771985547] [2024-06-27 23:07:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:23,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:23,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:23,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 410 transitions, 5829 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:23,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:23,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:23,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:24,766 INFO L124 PetriNetUnfolderBase]: 3086/4772 cut-off events. [2024-06-27 23:07:24,767 INFO L125 PetriNetUnfolderBase]: For 276684/276688 co-relation queries the response was YES. [2024-06-27 23:07:24,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33622 conditions, 4772 events. 3086/4772 cut-off events. For 276684/276688 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26119 event pairs, 941 based on Foata normal form. 8/4779 useless extension candidates. Maximal degree in co-relation 33525. Up to 4206 conditions per place. [2024-06-27 23:07:24,811 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 346 selfloop transitions, 122 changer transitions 0/473 dead transitions. [2024-06-27 23:07:24,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 473 transitions, 7517 flow [2024-06-27 23:07:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:07:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:07:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 232 transitions. [2024-06-27 23:07:24,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-27 23:07:24,813 INFO L175 Difference]: Start difference. First operand has 215 places, 410 transitions, 5829 flow. Second operand 12 states and 232 transitions. [2024-06-27 23:07:24,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 473 transitions, 7517 flow [2024-06-27 23:07:25,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 473 transitions, 7291 flow, removed 57 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:25,224 INFO L231 Difference]: Finished difference. Result has 222 places, 426 transitions, 6171 flow [2024-06-27 23:07:25,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5685, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6171, PETRI_PLACES=222, PETRI_TRANSITIONS=426} [2024-06-27 23:07:25,225 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 178 predicate places. [2024-06-27 23:07:25,225 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 426 transitions, 6171 flow [2024-06-27 23:07:25,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:25,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:25,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:25,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 23:07:25,225 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:25,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash 67947388, now seen corresponding path program 3 times [2024-06-27 23:07:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:25,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276499666] [2024-06-27 23:07:25,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:25,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:26,612 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-27 23:07:26,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:26,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276499666] [2024-06-27 23:07:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276499666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:26,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:26,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430280699] [2024-06-27 23:07:26,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:26,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:26,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:26,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:26,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:26,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 426 transitions, 6171 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:26,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:26,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:26,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:27,868 INFO L124 PetriNetUnfolderBase]: 3150/4878 cut-off events. [2024-06-27 23:07:27,868 INFO L125 PetriNetUnfolderBase]: For 292997/293001 co-relation queries the response was YES. [2024-06-27 23:07:27,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34942 conditions, 4878 events. 3150/4878 cut-off events. For 292997/293001 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26950 event pairs, 971 based on Foata normal form. 10/4887 useless extension candidates. Maximal degree in co-relation 34843. Up to 4409 conditions per place. [2024-06-27 23:07:27,913 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 372 selfloop transitions, 95 changer transitions 0/472 dead transitions. [2024-06-27 23:07:27,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 472 transitions, 7467 flow [2024-06-27 23:07:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-27 23:07:27,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883720930232557 [2024-06-27 23:07:27,914 INFO L175 Difference]: Start difference. First operand has 222 places, 426 transitions, 6171 flow. Second operand 10 states and 193 transitions. [2024-06-27 23:07:27,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 472 transitions, 7467 flow [2024-06-27 23:07:28,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 472 transitions, 7238 flow, removed 74 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:28,396 INFO L231 Difference]: Finished difference. Result has 226 places, 438 transitions, 6384 flow [2024-06-27 23:07:28,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6016, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6384, PETRI_PLACES=226, PETRI_TRANSITIONS=438} [2024-06-27 23:07:28,396 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 182 predicate places. [2024-06-27 23:07:28,397 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 438 transitions, 6384 flow [2024-06-27 23:07:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:28,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:28,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:28,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 23:07:28,397 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:28,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1102137148, now seen corresponding path program 4 times [2024-06-27 23:07:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661039043] [2024-06-27 23:07:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:29,701 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-27 23:07:29,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:29,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661039043] [2024-06-27 23:07:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661039043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:29,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:29,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:29,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602164423] [2024-06-27 23:07:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:29,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:29,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:29,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:29,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:29,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 438 transitions, 6384 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:29,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:29,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:29,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:31,221 INFO L124 PetriNetUnfolderBase]: 3224/4995 cut-off events. [2024-06-27 23:07:31,221 INFO L125 PetriNetUnfolderBase]: For 311000/311005 co-relation queries the response was YES. [2024-06-27 23:07:31,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36298 conditions, 4995 events. 3224/4995 cut-off events. For 311000/311005 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27772 event pairs, 775 based on Foata normal form. 6/4997 useless extension candidates. Maximal degree in co-relation 36197. Up to 3262 conditions per place. [2024-06-27 23:07:31,265 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 198 selfloop transitions, 294 changer transitions 0/497 dead transitions. [2024-06-27 23:07:31,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 497 transitions, 8295 flow [2024-06-27 23:07:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-06-27 23:07:31,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49767441860465117 [2024-06-27 23:07:31,266 INFO L175 Difference]: Start difference. First operand has 226 places, 438 transitions, 6384 flow. Second operand 10 states and 214 transitions. [2024-06-27 23:07:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 497 transitions, 8295 flow [2024-06-27 23:07:31,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 497 transitions, 8111 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:31,816 INFO L231 Difference]: Finished difference. Result has 231 places, 452 transitions, 7181 flow [2024-06-27 23:07:31,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6200, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7181, PETRI_PLACES=231, PETRI_TRANSITIONS=452} [2024-06-27 23:07:31,817 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 187 predicate places. [2024-06-27 23:07:31,817 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 452 transitions, 7181 flow [2024-06-27 23:07:31,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:31,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:31,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:31,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 23:07:31,818 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:31,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:31,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1069074718, now seen corresponding path program 5 times [2024-06-27 23:07:31,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:31,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876205155] [2024-06-27 23:07:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:31,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:33,049 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-27 23:07:33,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:33,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876205155] [2024-06-27 23:07:33,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876205155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:33,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:33,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:33,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599440102] [2024-06-27 23:07:33,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:33,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:33,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:33,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:33,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:33,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 452 transitions, 7181 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:33,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:33,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:33,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:34,489 INFO L124 PetriNetUnfolderBase]: 3214/4981 cut-off events. [2024-06-27 23:07:34,489 INFO L125 PetriNetUnfolderBase]: For 325953/325958 co-relation queries the response was YES. [2024-06-27 23:07:34,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37726 conditions, 4981 events. 3214/4981 cut-off events. For 325953/325958 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 27709 event pairs, 775 based on Foata normal form. 6/4983 useless extension candidates. Maximal degree in co-relation 37623. Up to 3254 conditions per place. [2024-06-27 23:07:34,538 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 187 selfloop transitions, 302 changer transitions 0/494 dead transitions. [2024-06-27 23:07:34,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 494 transitions, 8667 flow [2024-06-27 23:07:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:07:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:07:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2024-06-27 23:07:34,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2024-06-27 23:07:34,540 INFO L175 Difference]: Start difference. First operand has 231 places, 452 transitions, 7181 flow. Second operand 10 states and 210 transitions. [2024-06-27 23:07:34,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 494 transitions, 8667 flow [2024-06-27 23:07:35,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 494 transitions, 8415 flow, removed 66 selfloop flow, removed 4 redundant places. [2024-06-27 23:07:35,345 INFO L231 Difference]: Finished difference. Result has 237 places, 452 transitions, 7555 flow [2024-06-27 23:07:35,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6941, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7555, PETRI_PLACES=237, PETRI_TRANSITIONS=452} [2024-06-27 23:07:35,346 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 193 predicate places. [2024-06-27 23:07:35,346 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 452 transitions, 7555 flow [2024-06-27 23:07:35,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:35,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:35,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:35,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 23:07:35,347 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:35,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1992427550, now seen corresponding path program 6 times [2024-06-27 23:07:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809588568] [2024-06-27 23:07:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:35,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:36,889 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-27 23:07:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809588568] [2024-06-27 23:07:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809588568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979040969] [2024-06-27 23:07:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:36,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:37,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:37,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 452 transitions, 7555 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:37,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:37,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:37,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:38,259 INFO L124 PetriNetUnfolderBase]: 3240/5027 cut-off events. [2024-06-27 23:07:38,259 INFO L125 PetriNetUnfolderBase]: For 332339/332341 co-relation queries the response was YES. [2024-06-27 23:07:38,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38377 conditions, 5027 events. 3240/5027 cut-off events. For 332339/332341 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27959 event pairs, 743 based on Foata normal form. 8/5034 useless extension candidates. Maximal degree in co-relation 38272. Up to 4532 conditions per place. [2024-06-27 23:07:38,309 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 393 selfloop transitions, 95 changer transitions 0/493 dead transitions. [2024-06-27 23:07:38,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 493 transitions, 8783 flow [2024-06-27 23:07:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-27 23:07:38,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2024-06-27 23:07:38,311 INFO L175 Difference]: Start difference. First operand has 237 places, 452 transitions, 7555 flow. Second operand 9 states and 183 transitions. [2024-06-27 23:07:38,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 493 transitions, 8783 flow [2024-06-27 23:07:39,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 493 transitions, 8077 flow, removed 20 selfloop flow, removed 11 redundant places. [2024-06-27 23:07:39,078 INFO L231 Difference]: Finished difference. Result has 235 places, 461 transitions, 7197 flow [2024-06-27 23:07:39,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6869, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7197, PETRI_PLACES=235, PETRI_TRANSITIONS=461} [2024-06-27 23:07:39,079 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 191 predicate places. [2024-06-27 23:07:39,079 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 461 transitions, 7197 flow [2024-06-27 23:07:39,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:39,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:39,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:39,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 23:07:39,080 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:39,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1996146620, now seen corresponding path program 7 times [2024-06-27 23:07:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:39,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348292557] [2024-06-27 23:07:39,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:40,583 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-27 23:07:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:40,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348292557] [2024-06-27 23:07:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348292557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:40,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:40,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574251396] [2024-06-27 23:07:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:40,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:40,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:40,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 461 transitions, 7197 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:40,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:40,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:40,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:42,193 INFO L124 PetriNetUnfolderBase]: 3408/5319 cut-off events. [2024-06-27 23:07:42,193 INFO L125 PetriNetUnfolderBase]: For 357913/357918 co-relation queries the response was YES. [2024-06-27 23:07:42,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40095 conditions, 5319 events. 3408/5319 cut-off events. For 357913/357918 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 30295 event pairs, 754 based on Foata normal form. 8/5323 useless extension candidates. Maximal degree in co-relation 39990. Up to 3428 conditions per place. [2024-06-27 23:07:42,243 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 212 selfloop transitions, 317 changer transitions 0/534 dead transitions. [2024-06-27 23:07:42,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 534 transitions, 9565 flow [2024-06-27 23:07:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-06-27 23:07:42,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2024-06-27 23:07:42,245 INFO L175 Difference]: Start difference. First operand has 235 places, 461 transitions, 7197 flow. Second operand 9 states and 207 transitions. [2024-06-27 23:07:42,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 534 transitions, 9565 flow [2024-06-27 23:07:42,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 534 transitions, 9379 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 23:07:42,924 INFO L231 Difference]: Finished difference. Result has 238 places, 487 transitions, 8133 flow [2024-06-27 23:07:42,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7011, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8133, PETRI_PLACES=238, PETRI_TRANSITIONS=487} [2024-06-27 23:07:42,924 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 194 predicate places. [2024-06-27 23:07:42,925 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 487 transitions, 8133 flow [2024-06-27 23:07:42,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:42,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:42,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:42,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 23:07:42,925 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:42,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1996152200, now seen corresponding path program 8 times [2024-06-27 23:07:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:42,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172918308] [2024-06-27 23:07:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:44,305 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-27 23:07:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172918308] [2024-06-27 23:07:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172918308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:44,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028550630] [2024-06-27 23:07:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:44,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:44,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:44,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 487 transitions, 8133 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:44,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:44,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:44,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:45,866 INFO L124 PetriNetUnfolderBase]: 3392/5297 cut-off events. [2024-06-27 23:07:45,866 INFO L125 PetriNetUnfolderBase]: For 368977/368982 co-relation queries the response was YES. [2024-06-27 23:07:45,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41040 conditions, 5297 events. 3392/5297 cut-off events. For 368977/368982 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30160 event pairs, 743 based on Foata normal form. 8/5301 useless extension candidates. Maximal degree in co-relation 40933. Up to 3415 conditions per place. [2024-06-27 23:07:45,919 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 204 selfloop transitions, 322 changer transitions 0/531 dead transitions. [2024-06-27 23:07:45,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 531 transitions, 9907 flow [2024-06-27 23:07:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-06-27 23:07:45,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524547803617571 [2024-06-27 23:07:45,921 INFO L175 Difference]: Start difference. First operand has 238 places, 487 transitions, 8133 flow. Second operand 9 states and 203 transitions. [2024-06-27 23:07:45,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 531 transitions, 9907 flow [2024-06-27 23:07:46,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 531 transitions, 9408 flow, removed 84 selfloop flow, removed 3 redundant places. [2024-06-27 23:07:46,886 INFO L231 Difference]: Finished difference. Result has 244 places, 487 transitions, 8295 flow [2024-06-27 23:07:46,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7634, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8295, PETRI_PLACES=244, PETRI_TRANSITIONS=487} [2024-06-27 23:07:46,891 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 200 predicate places. [2024-06-27 23:07:46,891 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 487 transitions, 8295 flow [2024-06-27 23:07:46,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:46,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:46,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:46,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 23:07:46,892 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:46,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash -274902438, now seen corresponding path program 9 times [2024-06-27 23:07:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:46,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858041589] [2024-06-27 23:07:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:48,290 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-27 23:07:48,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:48,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858041589] [2024-06-27 23:07:48,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858041589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:48,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:48,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585673762] [2024-06-27 23:07:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:48,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:48,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:48,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:48,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:48,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 487 transitions, 8295 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:48,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:48,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:48,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:49,913 INFO L124 PetriNetUnfolderBase]: 3448/5384 cut-off events. [2024-06-27 23:07:49,913 INFO L125 PetriNetUnfolderBase]: For 391075/391078 co-relation queries the response was YES. [2024-06-27 23:07:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41924 conditions, 5384 events. 3448/5384 cut-off events. For 391075/391078 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 30691 event pairs, 693 based on Foata normal form. 6/5386 useless extension candidates. Maximal degree in co-relation 41816. Up to 3465 conditions per place. [2024-06-27 23:07:49,960 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 185 selfloop transitions, 348 changer transitions 0/538 dead transitions. [2024-06-27 23:07:49,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 538 transitions, 10271 flow [2024-06-27 23:07:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-06-27 23:07:49,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2024-06-27 23:07:49,961 INFO L175 Difference]: Start difference. First operand has 244 places, 487 transitions, 8295 flow. Second operand 9 states and 201 transitions. [2024-06-27 23:07:49,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 538 transitions, 10271 flow [2024-06-27 23:07:50,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 538 transitions, 9774 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:50,674 INFO L231 Difference]: Finished difference. Result has 247 places, 496 transitions, 8708 flow [2024-06-27 23:07:50,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7816, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8708, PETRI_PLACES=247, PETRI_TRANSITIONS=496} [2024-06-27 23:07:50,674 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 203 predicate places. [2024-06-27 23:07:50,675 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 496 transitions, 8708 flow [2024-06-27 23:07:50,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:50,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:50,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:50,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 23:07:50,675 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:50,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1300212558, now seen corresponding path program 10 times [2024-06-27 23:07:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070117438] [2024-06-27 23:07:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:52,060 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-27 23:07:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070117438] [2024-06-27 23:07:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070117438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935338328] [2024-06-27 23:07:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:52,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:52,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:52,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 496 transitions, 8708 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:52,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:52,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:52,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:53,688 INFO L124 PetriNetUnfolderBase]: 3484/5448 cut-off events. [2024-06-27 23:07:53,689 INFO L125 PetriNetUnfolderBase]: For 411121/411124 co-relation queries the response was YES. [2024-06-27 23:07:53,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42746 conditions, 5448 events. 3484/5448 cut-off events. For 411121/411124 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31261 event pairs, 693 based on Foata normal form. 6/5450 useless extension candidates. Maximal degree in co-relation 42637. Up to 3497 conditions per place. [2024-06-27 23:07:53,746 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 213 selfloop transitions, 331 changer transitions 0/549 dead transitions. [2024-06-27 23:07:53,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 549 transitions, 10726 flow [2024-06-27 23:07:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-06-27 23:07:53,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365 [2024-06-27 23:07:53,748 INFO L175 Difference]: Start difference. First operand has 247 places, 496 transitions, 8708 flow. Second operand 9 states and 204 transitions. [2024-06-27 23:07:53,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 549 transitions, 10726 flow [2024-06-27 23:07:55,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 549 transitions, 10089 flow, removed 56 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:55,025 INFO L231 Difference]: Finished difference. Result has 250 places, 502 transitions, 8879 flow [2024-06-27 23:07:55,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8089, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=325, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8879, PETRI_PLACES=250, PETRI_TRANSITIONS=502} [2024-06-27 23:07:55,026 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 206 predicate places. [2024-06-27 23:07:55,026 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 502 transitions, 8879 flow [2024-06-27 23:07:55,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:55,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:55,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:55,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 23:07:55,026 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:55,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1300218138, now seen corresponding path program 11 times [2024-06-27 23:07:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309880802] [2024-06-27 23:07:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:07:56,488 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-27 23:07:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:07:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309880802] [2024-06-27 23:07:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309880802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:07:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:07:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:07:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133140907] [2024-06-27 23:07:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:07:56,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:07:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:07:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:07:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:07:56,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:07:56,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 502 transitions, 8879 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:56,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:07:56,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:07:56,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:07:58,205 INFO L124 PetriNetUnfolderBase]: 3468/5426 cut-off events. [2024-06-27 23:07:58,206 INFO L125 PetriNetUnfolderBase]: For 418995/418998 co-relation queries the response was YES. [2024-06-27 23:07:58,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42342 conditions, 5426 events. 3468/5426 cut-off events. For 418995/418998 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 31145 event pairs, 690 based on Foata normal form. 6/5428 useless extension candidates. Maximal degree in co-relation 42232. Up to 3484 conditions per place. [2024-06-27 23:07:58,257 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 206 selfloop transitions, 334 changer transitions 0/545 dead transitions. [2024-06-27 23:07:58,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 545 transitions, 10523 flow [2024-06-27 23:07:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:07:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:07:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-06-27 23:07:58,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2024-06-27 23:07:58,259 INFO L175 Difference]: Start difference. First operand has 250 places, 502 transitions, 8879 flow. Second operand 9 states and 201 transitions. [2024-06-27 23:07:58,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 545 transitions, 10523 flow [2024-06-27 23:07:59,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 545 transitions, 9734 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-27 23:07:59,139 INFO L231 Difference]: Finished difference. Result has 253 places, 502 transitions, 8771 flow [2024-06-27 23:07:59,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8090, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=334, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8771, PETRI_PLACES=253, PETRI_TRANSITIONS=502} [2024-06-27 23:07:59,139 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 209 predicate places. [2024-06-27 23:07:59,140 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 502 transitions, 8771 flow [2024-06-27 23:07:59,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:07:59,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:07:59,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:07:59,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 23:07:59,140 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:07:59,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:07:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1035338055, now seen corresponding path program 1 times [2024-06-27 23:07:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:07:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284805381] [2024-06-27 23:07:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:07:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:07:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:00,110 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-27 23:08:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284805381] [2024-06-27 23:08:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284805381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:00,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:00,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530343009] [2024-06-27 23:08:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:00,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:00,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:08:00,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 502 transitions, 8771 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-27 23:08:00,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:00,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:08:00,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:01,285 INFO L124 PetriNetUnfolderBase]: 2976/4836 cut-off events. [2024-06-27 23:08:01,285 INFO L125 PetriNetUnfolderBase]: For 428222/428252 co-relation queries the response was YES. [2024-06-27 23:08:01,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39270 conditions, 4836 events. 2976/4836 cut-off events. For 428222/428252 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29184 event pairs, 956 based on Foata normal form. 15/4775 useless extension candidates. Maximal degree in co-relation 39159. Up to 4108 conditions per place. [2024-06-27 23:08:01,337 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 387 selfloop transitions, 21 changer transitions 0/522 dead transitions. [2024-06-27 23:08:01,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 522 transitions, 9695 flow [2024-06-27 23:08:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-27 23:08:01,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750830564784053 [2024-06-27 23:08:01,338 INFO L175 Difference]: Start difference. First operand has 253 places, 502 transitions, 8771 flow. Second operand 7 states and 143 transitions. [2024-06-27 23:08:01,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 522 transitions, 9695 flow [2024-06-27 23:08:02,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 522 transitions, 8974 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-27 23:08:02,223 INFO L231 Difference]: Finished difference. Result has 251 places, 505 transitions, 8131 flow [2024-06-27 23:08:02,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8050, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8131, PETRI_PLACES=251, PETRI_TRANSITIONS=505} [2024-06-27 23:08:02,223 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 207 predicate places. [2024-06-27 23:08:02,224 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 505 transitions, 8131 flow [2024-06-27 23:08:02,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-27 23:08:02,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:02,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:02,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 23:08:02,225 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:02,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1740811754, now seen corresponding path program 12 times [2024-06-27 23:08:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963295170] [2024-06-27 23:08:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:03,788 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-27 23:08:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963295170] [2024-06-27 23:08:03,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963295170] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:03,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:03,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103326482] [2024-06-27 23:08:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:03,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:03,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:03,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 505 transitions, 8131 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:03,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:03,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:03,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:05,457 INFO L124 PetriNetUnfolderBase]: 3659/5750 cut-off events. [2024-06-27 23:08:05,457 INFO L125 PetriNetUnfolderBase]: For 445900/445903 co-relation queries the response was YES. [2024-06-27 23:08:05,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43597 conditions, 5750 events. 3659/5750 cut-off events. For 445900/445903 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 33591 event pairs, 867 based on Foata normal form. 6/5714 useless extension candidates. Maximal degree in co-relation 43484. Up to 3659 conditions per place. [2024-06-27 23:08:05,516 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 213 selfloop transitions, 358 changer transitions 0/576 dead transitions. [2024-06-27 23:08:05,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 576 transitions, 10363 flow [2024-06-27 23:08:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-06-27 23:08:05,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012919896640827 [2024-06-27 23:08:05,518 INFO L175 Difference]: Start difference. First operand has 251 places, 505 transitions, 8131 flow. Second operand 9 states and 194 transitions. [2024-06-27 23:08:05,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 576 transitions, 10363 flow [2024-06-27 23:08:06,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 576 transitions, 10297 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:06,714 INFO L231 Difference]: Finished difference. Result has 255 places, 538 transitions, 9225 flow [2024-06-27 23:08:06,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8065, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=325, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9225, PETRI_PLACES=255, PETRI_TRANSITIONS=538} [2024-06-27 23:08:06,715 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 211 predicate places. [2024-06-27 23:08:06,715 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 538 transitions, 9225 flow [2024-06-27 23:08:06,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:06,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:06,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:06,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 23:08:06,715 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:06,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1740806174, now seen corresponding path program 13 times [2024-06-27 23:08:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:06,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637156573] [2024-06-27 23:08:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:08,256 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-27 23:08:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637156573] [2024-06-27 23:08:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637156573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:08,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013301329] [2024-06-27 23:08:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:08,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:08,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 538 transitions, 9225 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:08,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:08,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:09,813 INFO L124 PetriNetUnfolderBase]: 3643/5728 cut-off events. [2024-06-27 23:08:09,813 INFO L125 PetriNetUnfolderBase]: For 459271/459274 co-relation queries the response was YES. [2024-06-27 23:08:09,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44769 conditions, 5728 events. 3643/5728 cut-off events. For 459271/459274 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 33483 event pairs, 867 based on Foata normal form. 6/5692 useless extension candidates. Maximal degree in co-relation 44654. Up to 3646 conditions per place. [2024-06-27 23:08:09,872 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 205 selfloop transitions, 363 changer transitions 0/573 dead transitions. [2024-06-27 23:08:09,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 573 transitions, 10815 flow [2024-06-27 23:08:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-27 23:08:09,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909560723514212 [2024-06-27 23:08:09,874 INFO L175 Difference]: Start difference. First operand has 255 places, 538 transitions, 9225 flow. Second operand 9 states and 190 transitions. [2024-06-27 23:08:09,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 573 transitions, 10815 flow [2024-06-27 23:08:11,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 573 transitions, 10249 flow, removed 96 selfloop flow, removed 3 redundant places. [2024-06-27 23:08:11,062 INFO L231 Difference]: Finished difference. Result has 261 places, 538 transitions, 9407 flow [2024-06-27 23:08:11,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8659, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=363, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9407, PETRI_PLACES=261, PETRI_TRANSITIONS=538} [2024-06-27 23:08:11,063 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 217 predicate places. [2024-06-27 23:08:11,063 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 538 transitions, 9407 flow [2024-06-27 23:08:11,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:11,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:11,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:11,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 23:08:11,063 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:11,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1710579858, now seen corresponding path program 14 times [2024-06-27 23:08:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230213438] [2024-06-27 23:08:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:12,623 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-27 23:08:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230213438] [2024-06-27 23:08:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230213438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:12,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299762226] [2024-06-27 23:08:12,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:12,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:12,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:12,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:12,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:12,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:12,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 538 transitions, 9407 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:12,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:12,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:12,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:14,410 INFO L124 PetriNetUnfolderBase]: 3765/5935 cut-off events. [2024-06-27 23:08:14,410 INFO L125 PetriNetUnfolderBase]: For 502695/502698 co-relation queries the response was YES. [2024-06-27 23:08:14,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46832 conditions, 5935 events. 3765/5935 cut-off events. For 502695/502698 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 35165 event pairs, 919 based on Foata normal form. 8/5901 useless extension candidates. Maximal degree in co-relation 46714. Up to 3754 conditions per place. [2024-06-27 23:08:14,470 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 220 selfloop transitions, 374 changer transitions 0/599 dead transitions. [2024-06-27 23:08:14,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 599 transitions, 11885 flow [2024-06-27 23:08:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-06-27 23:08:14,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012919896640827 [2024-06-27 23:08:14,471 INFO L175 Difference]: Start difference. First operand has 261 places, 538 transitions, 9407 flow. Second operand 9 states and 194 transitions. [2024-06-27 23:08:14,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 599 transitions, 11885 flow [2024-06-27 23:08:15,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 599 transitions, 11154 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 23:08:15,517 INFO L231 Difference]: Finished difference. Result has 264 places, 556 transitions, 9902 flow [2024-06-27 23:08:15,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8712, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9902, PETRI_PLACES=264, PETRI_TRANSITIONS=556} [2024-06-27 23:08:15,518 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 220 predicate places. [2024-06-27 23:08:15,519 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 556 transitions, 9902 flow [2024-06-27 23:08:15,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:15,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:15,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:15,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 23:08:15,519 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:15,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1710574278, now seen corresponding path program 15 times [2024-06-27 23:08:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:15,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151561465] [2024-06-27 23:08:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:17,144 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-27 23:08:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151561465] [2024-06-27 23:08:17,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151561465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:17,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:17,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091749284] [2024-06-27 23:08:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:17,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:17,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:17,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:17,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:17,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 556 transitions, 9902 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:17,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:17,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:17,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:18,911 INFO L124 PetriNetUnfolderBase]: 3815/6025 cut-off events. [2024-06-27 23:08:18,911 INFO L125 PetriNetUnfolderBase]: For 521309/521312 co-relation queries the response was YES. [2024-06-27 23:08:18,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47790 conditions, 6025 events. 3815/6025 cut-off events. For 521309/521312 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 35973 event pairs, 919 based on Foata normal form. 8/5991 useless extension candidates. Maximal degree in co-relation 47669. Up to 3799 conditions per place. [2024-06-27 23:08:18,980 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 226 selfloop transitions, 379 changer transitions 0/610 dead transitions. [2024-06-27 23:08:18,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 610 transitions, 12229 flow [2024-06-27 23:08:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-27 23:08:18,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2024-06-27 23:08:18,981 INFO L175 Difference]: Start difference. First operand has 264 places, 556 transitions, 9902 flow. Second operand 9 states and 195 transitions. [2024-06-27 23:08:18,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 610 transitions, 12229 flow [2024-06-27 23:08:20,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 610 transitions, 11433 flow, removed 84 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:20,108 INFO L231 Difference]: Finished difference. Result has 268 places, 565 transitions, 10114 flow [2024-06-27 23:08:20,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9151, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10114, PETRI_PLACES=268, PETRI_TRANSITIONS=565} [2024-06-27 23:08:20,109 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 224 predicate places. [2024-06-27 23:08:20,109 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 565 transitions, 10114 flow [2024-06-27 23:08:20,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:20,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:20,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:20,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 23:08:20,109 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:20,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1710372468, now seen corresponding path program 16 times [2024-06-27 23:08:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:20,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112604179] [2024-06-27 23:08:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:21,689 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-27 23:08:21,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:21,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112604179] [2024-06-27 23:08:21,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112604179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:21,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:21,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631553158] [2024-06-27 23:08:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:21,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:21,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:21,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:21,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:21,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 565 transitions, 10114 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:21,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:21,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:21,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:23,441 INFO L124 PetriNetUnfolderBase]: 3793/6000 cut-off events. [2024-06-27 23:08:23,441 INFO L125 PetriNetUnfolderBase]: For 524186/524189 co-relation queries the response was YES. [2024-06-27 23:08:23,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47122 conditions, 6000 events. 3793/6000 cut-off events. For 524186/524189 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 35875 event pairs, 945 based on Foata normal form. 8/5966 useless extension candidates. Maximal degree in co-relation 46998. Up to 3781 conditions per place. [2024-06-27 23:08:23,650 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 205 selfloop transitions, 392 changer transitions 0/602 dead transitions. [2024-06-27 23:08:23,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 602 transitions, 11837 flow [2024-06-27 23:08:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-27 23:08:23,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909560723514212 [2024-06-27 23:08:23,651 INFO L175 Difference]: Start difference. First operand has 268 places, 565 transitions, 10114 flow. Second operand 9 states and 190 transitions. [2024-06-27 23:08:23,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 602 transitions, 11837 flow [2024-06-27 23:08:24,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 602 transitions, 10947 flow, removed 114 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:24,778 INFO L231 Difference]: Finished difference. Result has 272 places, 565 transitions, 10030 flow [2024-06-27 23:08:24,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9224, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10030, PETRI_PLACES=272, PETRI_TRANSITIONS=565} [2024-06-27 23:08:24,779 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 228 predicate places. [2024-06-27 23:08:24,779 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 565 transitions, 10030 flow [2024-06-27 23:08:24,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:24,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:24,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 23:08:24,780 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:24,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1398059147, now seen corresponding path program 2 times [2024-06-27 23:08:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:24,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402102105] [2024-06-27 23:08:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:24,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:25,805 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-27 23:08:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:25,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402102105] [2024-06-27 23:08:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402102105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:25,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280562843] [2024-06-27 23:08:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:25,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:25,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:08:25,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 565 transitions, 10030 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-27 23:08:25,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:25,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:08:25,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:27,064 INFO L124 PetriNetUnfolderBase]: 3216/5271 cut-off events. [2024-06-27 23:08:27,065 INFO L125 PetriNetUnfolderBase]: For 528895/528923 co-relation queries the response was YES. [2024-06-27 23:08:27,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43581 conditions, 5271 events. 3216/5271 cut-off events. For 528895/528923 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 32861 event pairs, 969 based on Foata normal form. 12/5175 useless extension candidates. Maximal degree in co-relation 43454. Up to 4463 conditions per place. [2024-06-27 23:08:27,120 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 445 selfloop transitions, 23 changer transitions 0/582 dead transitions. [2024-06-27 23:08:27,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 582 transitions, 11058 flow [2024-06-27 23:08:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 23:08:27,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45182724252491696 [2024-06-27 23:08:27,122 INFO L175 Difference]: Start difference. First operand has 272 places, 565 transitions, 10030 flow. Second operand 7 states and 136 transitions. [2024-06-27 23:08:27,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 582 transitions, 11058 flow [2024-06-27 23:08:28,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 582 transitions, 10314 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 23:08:28,438 INFO L231 Difference]: Finished difference. Result has 273 places, 571 transitions, 9398 flow [2024-06-27 23:08:28,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9286, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9398, PETRI_PLACES=273, PETRI_TRANSITIONS=571} [2024-06-27 23:08:28,438 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 229 predicate places. [2024-06-27 23:08:28,438 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 571 transitions, 9398 flow [2024-06-27 23:08:28,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-27 23:08:28,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:28,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:28,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 23:08:28,439 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:28,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash 611074418, now seen corresponding path program 17 times [2024-06-27 23:08:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:28,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372916572] [2024-06-27 23:08:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:28,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:30,035 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-27 23:08:30,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372916572] [2024-06-27 23:08:30,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372916572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:30,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:30,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232605643] [2024-06-27 23:08:30,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:30,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:30,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:30,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:30,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:30,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 571 transitions, 9398 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:30,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:30,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:30,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:32,063 INFO L124 PetriNetUnfolderBase]: 3853/6105 cut-off events. [2024-06-27 23:08:32,063 INFO L125 PetriNetUnfolderBase]: For 542987/542987 co-relation queries the response was YES. [2024-06-27 23:08:32,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46816 conditions, 6105 events. 3853/6105 cut-off events. For 542987/542987 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 36494 event pairs, 771 based on Foata normal form. 8/6097 useless extension candidates. Maximal degree in co-relation 46687. Up to 3840 conditions per place. [2024-06-27 23:08:32,137 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 169 selfloop transitions, 438 changer transitions 0/612 dead transitions. [2024-06-27 23:08:32,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 612 transitions, 11261 flow [2024-06-27 23:08:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-27 23:08:32,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754521963824289 [2024-06-27 23:08:32,139 INFO L175 Difference]: Start difference. First operand has 273 places, 571 transitions, 9398 flow. Second operand 9 states and 184 transitions. [2024-06-27 23:08:32,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 612 transitions, 11261 flow [2024-06-27 23:08:33,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 612 transitions, 11172 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:33,576 INFO L231 Difference]: Finished difference. Result has 277 places, 580 transitions, 10422 flow [2024-06-27 23:08:33,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9309, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10422, PETRI_PLACES=277, PETRI_TRANSITIONS=580} [2024-06-27 23:08:33,577 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 233 predicate places. [2024-06-27 23:08:33,577 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 580 transitions, 10422 flow [2024-06-27 23:08:33,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:33,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:33,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:33,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 23:08:33,578 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:33,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash -658354984, now seen corresponding path program 18 times [2024-06-27 23:08:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760092185] [2024-06-27 23:08:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:35,126 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-27 23:08:35,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:35,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760092185] [2024-06-27 23:08:35,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760092185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:35,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:35,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:35,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511040873] [2024-06-27 23:08:35,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:35,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:35,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:35,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:35,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:35,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:35,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 580 transitions, 10422 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:35,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:35,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:35,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:36,874 INFO L124 PetriNetUnfolderBase]: 3975/6304 cut-off events. [2024-06-27 23:08:36,874 INFO L125 PetriNetUnfolderBase]: For 593456/593456 co-relation queries the response was YES. [2024-06-27 23:08:36,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50818 conditions, 6304 events. 3975/6304 cut-off events. For 593456/593456 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 38123 event pairs, 781 based on Foata normal form. 8/6296 useless extension candidates. Maximal degree in co-relation 50687. Up to 3948 conditions per place. [2024-06-27 23:08:36,950 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 220 selfloop transitions, 413 changer transitions 0/638 dead transitions. [2024-06-27 23:08:36,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 638 transitions, 12982 flow [2024-06-27 23:08:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-06-27 23:08:36,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2024-06-27 23:08:36,952 INFO L175 Difference]: Start difference. First operand has 277 places, 580 transitions, 10422 flow. Second operand 9 states and 189 transitions. [2024-06-27 23:08:36,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 638 transitions, 12982 flow [2024-06-27 23:08:38,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 638 transitions, 12407 flow, removed 63 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:38,168 INFO L231 Difference]: Finished difference. Result has 281 places, 598 transitions, 11165 flow [2024-06-27 23:08:38,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9901, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11165, PETRI_PLACES=281, PETRI_TRANSITIONS=598} [2024-06-27 23:08:38,169 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 237 predicate places. [2024-06-27 23:08:38,169 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 598 transitions, 11165 flow [2024-06-27 23:08:38,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:38,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:38,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 23:08:38,169 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:38,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash -685119634, now seen corresponding path program 19 times [2024-06-27 23:08:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221966587] [2024-06-27 23:08:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:39,785 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-27 23:08:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221966587] [2024-06-27 23:08:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221966587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:39,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:39,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906966501] [2024-06-27 23:08:39,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:39,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:39,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:39,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:39,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:39,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:39,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 598 transitions, 11165 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:39,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:39,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:39,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:41,560 INFO L124 PetriNetUnfolderBase]: 3953/6269 cut-off events. [2024-06-27 23:08:41,560 INFO L125 PetriNetUnfolderBase]: For 600467/600467 co-relation queries the response was YES. [2024-06-27 23:08:41,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50192 conditions, 6269 events. 3953/6269 cut-off events. For 600467/600467 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 37837 event pairs, 774 based on Foata normal form. 8/6261 useless extension candidates. Maximal degree in co-relation 50058. Up to 3930 conditions per place. [2024-06-27 23:08:41,639 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 210 selfloop transitions, 419 changer transitions 0/634 dead transitions. [2024-06-27 23:08:41,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 634 transitions, 12960 flow [2024-06-27 23:08:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:08:41,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:08:41,640 INFO L175 Difference]: Start difference. First operand has 281 places, 598 transitions, 11165 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:08:41,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 634 transitions, 12960 flow [2024-06-27 23:08:42,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 634 transitions, 11926 flow, removed 108 selfloop flow, removed 6 redundant places. [2024-06-27 23:08:42,978 INFO L231 Difference]: Finished difference. Result has 284 places, 598 transitions, 10987 flow [2024-06-27 23:08:42,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10131, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=419, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10987, PETRI_PLACES=284, PETRI_TRANSITIONS=598} [2024-06-27 23:08:42,978 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 240 predicate places. [2024-06-27 23:08:42,978 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 598 transitions, 10987 flow [2024-06-27 23:08:42,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:42,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:42,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:42,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 23:08:42,979 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:42,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash -544494540, now seen corresponding path program 20 times [2024-06-27 23:08:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594746939] [2024-06-27 23:08:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:44,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-27 23:08:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594746939] [2024-06-27 23:08:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594746939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:44,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:08:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175790507] [2024-06-27 23:08:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:44,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:08:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:08:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:08:44,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:08:44,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 598 transitions, 10987 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:44,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:44,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:08:44,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:46,518 INFO L124 PetriNetUnfolderBase]: 3931/6239 cut-off events. [2024-06-27 23:08:46,518 INFO L125 PetriNetUnfolderBase]: For 596935/596935 co-relation queries the response was YES. [2024-06-27 23:08:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49136 conditions, 6239 events. 3931/6239 cut-off events. For 596935/596935 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 37696 event pairs, 795 based on Foata normal form. 8/6231 useless extension candidates. Maximal degree in co-relation 49000. Up to 3912 conditions per place. [2024-06-27 23:08:46,576 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 220 selfloop transitions, 411 changer transitions 0/636 dead transitions. [2024-06-27 23:08:46,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 636 transitions, 12628 flow [2024-06-27 23:08:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:08:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:08:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:08:46,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:08:46,578 INFO L175 Difference]: Start difference. First operand has 284 places, 598 transitions, 10987 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:08:46,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 636 transitions, 12628 flow [2024-06-27 23:08:48,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 636 transitions, 11342 flow, removed 126 selfloop flow, removed 8 redundant places. [2024-06-27 23:08:48,155 INFO L231 Difference]: Finished difference. Result has 285 places, 598 transitions, 10541 flow [2024-06-27 23:08:48,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9701, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10541, PETRI_PLACES=285, PETRI_TRANSITIONS=598} [2024-06-27 23:08:48,156 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 241 predicate places. [2024-06-27 23:08:48,156 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 598 transitions, 10541 flow [2024-06-27 23:08:48,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:08:48,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:48,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 23:08:48,157 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:48,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1397671337, now seen corresponding path program 3 times [2024-06-27 23:08:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379915345] [2024-06-27 23:08:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:49,331 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-27 23:08:49,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:49,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379915345] [2024-06-27 23:08:49,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379915345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:49,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:49,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:49,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503108763] [2024-06-27 23:08:49,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:49,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:49,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:08:49,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 598 transitions, 10541 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-27 23:08:49,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:49,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:08:49,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:50,633 INFO L124 PetriNetUnfolderBase]: 3308/5452 cut-off events. [2024-06-27 23:08:50,633 INFO L125 PetriNetUnfolderBase]: For 592595/592636 co-relation queries the response was YES. [2024-06-27 23:08:50,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44984 conditions, 5452 events. 3308/5452 cut-off events. For 592595/592636 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 34436 event pairs, 984 based on Foata normal form. 14/5343 useless extension candidates. Maximal degree in co-relation 44845. Up to 4595 conditions per place. [2024-06-27 23:08:50,688 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 464 selfloop transitions, 31 changer transitions 0/609 dead transitions. [2024-06-27 23:08:50,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 609 transitions, 11607 flow [2024-06-27 23:08:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 23:08:50,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-27 23:08:50,690 INFO L175 Difference]: Start difference. First operand has 285 places, 598 transitions, 10541 flow. Second operand 7 states and 133 transitions. [2024-06-27 23:08:50,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 609 transitions, 11607 flow [2024-06-27 23:08:52,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 609 transitions, 10889 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:08:52,430 INFO L231 Difference]: Finished difference. Result has 288 places, 601 transitions, 9935 flow [2024-06-27 23:08:52,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9823, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9935, PETRI_PLACES=288, PETRI_TRANSITIONS=601} [2024-06-27 23:08:52,431 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 244 predicate places. [2024-06-27 23:08:52,431 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 601 transitions, 9935 flow [2024-06-27 23:08:52,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-27 23:08:52,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:52,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:52,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 23:08:52,431 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:52,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:52,431 INFO L85 PathProgramCache]: Analyzing trace with hash -189258275, now seen corresponding path program 1 times [2024-06-27 23:08:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101694997] [2024-06-27 23:08:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:53,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-27 23:08:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:53,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101694997] [2024-06-27 23:08:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101694997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72991780] [2024-06-27 23:08:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:53,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:53,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 23:08:53,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 601 transitions, 9935 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-27 23:08:53,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:53,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 23:08:53,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:54,869 INFO L124 PetriNetUnfolderBase]: 3759/6014 cut-off events. [2024-06-27 23:08:54,869 INFO L125 PetriNetUnfolderBase]: For 610071/610095 co-relation queries the response was YES. [2024-06-27 23:08:54,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46217 conditions, 6014 events. 3759/6014 cut-off events. For 610071/610095 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 37149 event pairs, 1341 based on Foata normal form. 24/5982 useless extension candidates. Maximal degree in co-relation 46076. Up to 5397 conditions per place. [2024-06-27 23:08:54,934 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 574 selfloop transitions, 13 changer transitions 0/615 dead transitions. [2024-06-27 23:08:54,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 615 transitions, 11209 flow [2024-06-27 23:08:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 23:08:54,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219269102990033 [2024-06-27 23:08:54,935 INFO L175 Difference]: Start difference. First operand has 288 places, 601 transitions, 9935 flow. Second operand 7 states and 127 transitions. [2024-06-27 23:08:54,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 615 transitions, 11209 flow [2024-06-27 23:08:56,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 615 transitions, 11119 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:56,395 INFO L231 Difference]: Finished difference. Result has 290 places, 604 transitions, 9919 flow [2024-06-27 23:08:56,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9845, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9919, PETRI_PLACES=290, PETRI_TRANSITIONS=604} [2024-06-27 23:08:56,396 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 246 predicate places. [2024-06-27 23:08:56,396 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 604 transitions, 9919 flow [2024-06-27 23:08:56,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-27 23:08:56,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:56,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:56,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 23:08:56,397 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:56,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1384719723, now seen corresponding path program 2 times [2024-06-27 23:08:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093824789] [2024-06-27 23:08:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:57,480 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-27 23:08:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093824789] [2024-06-27 23:08:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093824789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:57,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771400970] [2024-06-27 23:08:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:57,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:57,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:57,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:57,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 23:08:57,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 604 transitions, 9919 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-27 23:08:57,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:57,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 23:08:57,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:58,788 INFO L124 PetriNetUnfolderBase]: 3756/6011 cut-off events. [2024-06-27 23:08:58,788 INFO L125 PetriNetUnfolderBase]: For 622420/622447 co-relation queries the response was YES. [2024-06-27 23:08:58,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46625 conditions, 6011 events. 3756/6011 cut-off events. For 622420/622447 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 37145 event pairs, 1345 based on Foata normal form. 26/5979 useless extension candidates. Maximal degree in co-relation 46483. Up to 5387 conditions per place. [2024-06-27 23:08:58,855 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 569 selfloop transitions, 18 changer transitions 0/615 dead transitions. [2024-06-27 23:08:58,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 615 transitions, 11173 flow [2024-06-27 23:08:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-27 23:08:58,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-27 23:08:58,856 INFO L175 Difference]: Start difference. First operand has 290 places, 604 transitions, 9919 flow. Second operand 7 states and 126 transitions. [2024-06-27 23:08:58,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 615 transitions, 11173 flow [2024-06-27 23:09:00,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 615 transitions, 11121 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 23:09:00,661 INFO L231 Difference]: Finished difference. Result has 292 places, 607 transitions, 9957 flow [2024-06-27 23:09:00,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9867, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9957, PETRI_PLACES=292, PETRI_TRANSITIONS=607} [2024-06-27 23:09:00,661 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 248 predicate places. [2024-06-27 23:09:00,661 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 607 transitions, 9957 flow [2024-06-27 23:09:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-27 23:09:00,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:00,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:00,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 23:09:00,662 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:00,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -27134925, now seen corresponding path program 1 times [2024-06-27 23:09:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149406003] [2024-06-27 23:09:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:02,507 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-27 23:09:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149406003] [2024-06-27 23:09:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149406003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:02,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:02,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:02,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946032969] [2024-06-27 23:09:02,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:02,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:02,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-27 23:09:02,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 607 transitions, 9957 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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-27 23:09:02,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:02,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-27 23:09:02,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:03,874 INFO L124 PetriNetUnfolderBase]: 3127/5027 cut-off events. [2024-06-27 23:09:03,874 INFO L125 PetriNetUnfolderBase]: For 662383/662569 co-relation queries the response was YES. [2024-06-27 23:09:03,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42220 conditions, 5027 events. 3127/5027 cut-off events. For 662383/662569 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 30500 event pairs, 1032 based on Foata normal form. 54/4766 useless extension candidates. Maximal degree in co-relation 42077. Up to 4269 conditions per place. [2024-06-27 23:09:03,932 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 465 selfloop transitions, 16 changer transitions 0/620 dead transitions. [2024-06-27 23:09:03,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 620 transitions, 11001 flow [2024-06-27 23:09:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:09:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:09:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-06-27 23:09:03,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684385382059801 [2024-06-27 23:09:03,933 INFO L175 Difference]: Start difference. First operand has 292 places, 607 transitions, 9957 flow. Second operand 7 states and 141 transitions. [2024-06-27 23:09:03,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 620 transitions, 11001 flow [2024-06-27 23:09:05,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 620 transitions, 10933 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 23:09:05,259 INFO L231 Difference]: Finished difference. Result has 294 places, 610 transitions, 9973 flow [2024-06-27 23:09:05,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9889, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9973, PETRI_PLACES=294, PETRI_TRANSITIONS=610} [2024-06-27 23:09:05,259 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 250 predicate places. [2024-06-27 23:09:05,259 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 610 transitions, 9973 flow [2024-06-27 23:09:05,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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-27 23:09:05,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:05,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:05,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 23:09:05,260 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:05,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1934986456, now seen corresponding path program 1 times [2024-06-27 23:09:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888489695] [2024-06-27 23:09:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:06,334 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-27 23:09:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888489695] [2024-06-27 23:09:06,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888489695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:06,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:06,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:06,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020278935] [2024-06-27 23:09:06,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:06,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:06,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:06,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:06,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 610 transitions, 9973 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:06,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:06,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:07,964 INFO L124 PetriNetUnfolderBase]: 3984/6339 cut-off events. [2024-06-27 23:09:07,964 INFO L125 PetriNetUnfolderBase]: For 646206/646210 co-relation queries the response was YES. [2024-06-27 23:09:08,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49914 conditions, 6339 events. 3984/6339 cut-off events. For 646206/646210 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 38793 event pairs, 1101 based on Foata normal form. 8/6346 useless extension candidates. Maximal degree in co-relation 49770. Up to 5530 conditions per place. [2024-06-27 23:09:08,037 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 542 selfloop transitions, 117 changer transitions 0/664 dead transitions. [2024-06-27 23:09:08,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 664 transitions, 11903 flow [2024-06-27 23:09:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:09:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:09:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-27 23:09:08,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:09:08,038 INFO L175 Difference]: Start difference. First operand has 294 places, 610 transitions, 9973 flow. Second operand 11 states and 220 transitions. [2024-06-27 23:09:08,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 664 transitions, 11903 flow [2024-06-27 23:09:09,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 664 transitions, 11841 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 23:09:09,839 INFO L231 Difference]: Finished difference. Result has 301 places, 616 transitions, 10279 flow [2024-06-27 23:09:09,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9911, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10279, PETRI_PLACES=301, PETRI_TRANSITIONS=616} [2024-06-27 23:09:09,840 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 257 predicate places. [2024-06-27 23:09:09,840 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 616 transitions, 10279 flow [2024-06-27 23:09:09,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:09,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:09,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:09,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 23:09:09,841 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:09,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -656795330, now seen corresponding path program 2 times [2024-06-27 23:09:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846541005] [2024-06-27 23:09:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:10,903 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-27 23:09:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846541005] [2024-06-27 23:09:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846541005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:10,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:10,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829174355] [2024-06-27 23:09:10,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:10,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:10,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:10,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:11,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:11,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 616 transitions, 10279 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:11,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:11,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:11,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:12,584 INFO L124 PetriNetUnfolderBase]: 3992/6353 cut-off events. [2024-06-27 23:09:12,584 INFO L125 PetriNetUnfolderBase]: For 656698/656702 co-relation queries the response was YES. [2024-06-27 23:09:12,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50691 conditions, 6353 events. 3992/6353 cut-off events. For 656698/656702 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 38941 event pairs, 1134 based on Foata normal form. 8/6360 useless extension candidates. Maximal degree in co-relation 50546. Up to 5611 conditions per place. [2024-06-27 23:09:12,656 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 542 selfloop transitions, 113 changer transitions 0/660 dead transitions. [2024-06-27 23:09:12,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 660 transitions, 11863 flow [2024-06-27 23:09:12,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:09:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:09:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2024-06-27 23:09:12,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452431289640592 [2024-06-27 23:09:12,658 INFO L175 Difference]: Start difference. First operand has 301 places, 616 transitions, 10279 flow. Second operand 11 states and 214 transitions. [2024-06-27 23:09:12,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 660 transitions, 11863 flow [2024-06-27 23:09:14,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 660 transitions, 11658 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:14,850 INFO L231 Difference]: Finished difference. Result has 306 places, 618 transitions, 10368 flow [2024-06-27 23:09:14,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10092, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10368, PETRI_PLACES=306, PETRI_TRANSITIONS=618} [2024-06-27 23:09:14,851 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 262 predicate places. [2024-06-27 23:09:14,851 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 618 transitions, 10368 flow [2024-06-27 23:09:14,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:14,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:14,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:14,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 23:09:14,852 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:14,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:14,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1281126198, now seen corresponding path program 3 times [2024-06-27 23:09:14,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219068614] [2024-06-27 23:09:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:15,669 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-27 23:09:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:15,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219068614] [2024-06-27 23:09:15,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219068614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:15,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:15,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865539008] [2024-06-27 23:09:15,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:15,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:15,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:15,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:15,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-27 23:09:15,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 618 transitions, 10368 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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-27 23:09:15,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:15,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-27 23:09:15,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:17,296 INFO L124 PetriNetUnfolderBase]: 3477/5867 cut-off events. [2024-06-27 23:09:17,296 INFO L125 PetriNetUnfolderBase]: For 724556/724623 co-relation queries the response was YES. [2024-06-27 23:09:17,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49280 conditions, 5867 events. 3477/5867 cut-off events. For 724556/724623 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 38674 event pairs, 868 based on Foata normal form. 29/5864 useless extension candidates. Maximal degree in co-relation 49133. Up to 4131 conditions per place. [2024-06-27 23:09:17,373 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 356 selfloop transitions, 109 changer transitions 0/671 dead transitions. [2024-06-27 23:09:17,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 671 transitions, 12110 flow [2024-06-27 23:09:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:09:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:09:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 237 transitions. [2024-06-27 23:09:17,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010570824524313 [2024-06-27 23:09:17,374 INFO L175 Difference]: Start difference. First operand has 306 places, 618 transitions, 10368 flow. Second operand 11 states and 237 transitions. [2024-06-27 23:09:17,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 671 transitions, 12110 flow [2024-06-27 23:09:19,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 671 transitions, 11848 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-27 23:09:19,826 INFO L231 Difference]: Finished difference. Result has 309 places, 628 transitions, 10616 flow [2024-06-27 23:09:19,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10106, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10616, PETRI_PLACES=309, PETRI_TRANSITIONS=628} [2024-06-27 23:09:19,827 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 265 predicate places. [2024-06-27 23:09:19,827 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 628 transitions, 10616 flow [2024-06-27 23:09:19,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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-27 23:09:19,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:19,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:19,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 23:09:19,828 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:19,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2103508806, now seen corresponding path program 4 times [2024-06-27 23:09:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361418850] [2024-06-27 23:09:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:19,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:21,160 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-27 23:09:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:21,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361418850] [2024-06-27 23:09:21,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361418850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:21,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:21,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026182781] [2024-06-27 23:09:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:21,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:21,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:21,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:21,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 628 transitions, 10616 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:21,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:21,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:21,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:23,143 INFO L124 PetriNetUnfolderBase]: 4226/6727 cut-off events. [2024-06-27 23:09:23,143 INFO L125 PetriNetUnfolderBase]: For 740225/740229 co-relation queries the response was YES. [2024-06-27 23:09:23,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55284 conditions, 6727 events. 4226/6727 cut-off events. For 740225/740229 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 41826 event pairs, 1177 based on Foata normal form. 10/6736 useless extension candidates. Maximal degree in co-relation 55133. Up to 5886 conditions per place. [2024-06-27 23:09:23,224 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 584 selfloop transitions, 104 changer transitions 0/693 dead transitions. [2024-06-27 23:09:23,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 693 transitions, 12925 flow [2024-06-27 23:09:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:09:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:09:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-27 23:09:23,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720930232558139 [2024-06-27 23:09:23,225 INFO L175 Difference]: Start difference. First operand has 309 places, 628 transitions, 10616 flow. Second operand 10 states and 203 transitions. [2024-06-27 23:09:23,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 693 transitions, 12925 flow [2024-06-27 23:09:25,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 693 transitions, 12634 flow, removed 112 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:25,887 INFO L231 Difference]: Finished difference. Result has 313 places, 650 transitions, 11067 flow [2024-06-27 23:09:25,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10452, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11067, PETRI_PLACES=313, PETRI_TRANSITIONS=650} [2024-06-27 23:09:25,888 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 269 predicate places. [2024-06-27 23:09:25,888 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 650 transitions, 11067 flow [2024-06-27 23:09:25,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:25,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:25,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:25,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 23:09:25,889 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:25,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1223067002, now seen corresponding path program 5 times [2024-06-27 23:09:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075899974] [2024-06-27 23:09:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:27,120 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-27 23:09:27,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075899974] [2024-06-27 23:09:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075899974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:27,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:27,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:27,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230880161] [2024-06-27 23:09:27,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:27,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:27,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:27,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 650 transitions, 11067 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:27,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:27,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:27,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:28,966 INFO L124 PetriNetUnfolderBase]: 4208/6705 cut-off events. [2024-06-27 23:09:28,966 INFO L125 PetriNetUnfolderBase]: For 705366/705370 co-relation queries the response was YES. [2024-06-27 23:09:29,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54155 conditions, 6705 events. 4208/6705 cut-off events. For 705366/705370 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 41766 event pairs, 1206 based on Foata normal form. 12/6716 useless extension candidates. Maximal degree in co-relation 54005. Up to 5973 conditions per place. [2024-06-27 23:09:29,042 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 589 selfloop transitions, 90 changer transitions 0/684 dead transitions. [2024-06-27 23:09:29,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 684 transitions, 12594 flow [2024-06-27 23:09:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-27 23:09:29,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702842377260982 [2024-06-27 23:09:29,043 INFO L175 Difference]: Start difference. First operand has 313 places, 650 transitions, 11067 flow. Second operand 9 states and 182 transitions. [2024-06-27 23:09:29,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 684 transitions, 12594 flow [2024-06-27 23:09:31,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 684 transitions, 12296 flow, removed 87 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:31,324 INFO L231 Difference]: Finished difference. Result has 315 places, 650 transitions, 10978 flow [2024-06-27 23:09:31,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10781, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10978, PETRI_PLACES=315, PETRI_TRANSITIONS=650} [2024-06-27 23:09:31,324 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 271 predicate places. [2024-06-27 23:09:31,324 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 650 transitions, 10978 flow [2024-06-27 23:09:31,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:31,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:31,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:31,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 23:09:31,325 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:31,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -193490042, now seen corresponding path program 6 times [2024-06-27 23:09:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401814593] [2024-06-27 23:09:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:32,540 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-27 23:09:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:32,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401814593] [2024-06-27 23:09:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401814593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:32,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:32,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512276574] [2024-06-27 23:09:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:32,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:32,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:32,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 650 transitions, 10978 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:32,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:32,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:32,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:34,356 INFO L124 PetriNetUnfolderBase]: 4225/6707 cut-off events. [2024-06-27 23:09:34,357 INFO L125 PetriNetUnfolderBase]: For 709202/709207 co-relation queries the response was YES. [2024-06-27 23:09:34,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54361 conditions, 6707 events. 4225/6707 cut-off events. For 709202/709207 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 41374 event pairs, 1038 based on Foata normal form. 8/6713 useless extension candidates. Maximal degree in co-relation 54209. Up to 5733 conditions per place. [2024-06-27 23:09:34,435 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 472 selfloop transitions, 210 changer transitions 0/687 dead transitions. [2024-06-27 23:09:34,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 687 transitions, 12594 flow [2024-06-27 23:09:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-27 23:09:34,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-06-27 23:09:34,436 INFO L175 Difference]: Start difference. First operand has 315 places, 650 transitions, 10978 flow. Second operand 9 states and 186 transitions. [2024-06-27 23:09:34,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 687 transitions, 12594 flow [2024-06-27 23:09:36,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 687 transitions, 12413 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:36,634 INFO L231 Difference]: Finished difference. Result has 317 places, 652 transitions, 11282 flow [2024-06-27 23:09:36,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10797, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11282, PETRI_PLACES=317, PETRI_TRANSITIONS=652} [2024-06-27 23:09:36,635 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 273 predicate places. [2024-06-27 23:09:36,635 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 652 transitions, 11282 flow [2024-06-27 23:09:36,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:36,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:36,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:36,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 23:09:36,636 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:36,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1118386383, now seen corresponding path program 1 times [2024-06-27 23:09:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607582101] [2024-06-27 23:09:36,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:37,670 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-27 23:09:37,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:37,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607582101] [2024-06-27 23:09:37,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607582101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:37,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165688655] [2024-06-27 23:09:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:37,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:37,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:37,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:37,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:09:37,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 652 transitions, 11282 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:09:37,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:37,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:09:37,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:39,127 INFO L124 PetriNetUnfolderBase]: 3576/5905 cut-off events. [2024-06-27 23:09:39,127 INFO L125 PetriNetUnfolderBase]: For 737245/737308 co-relation queries the response was YES. [2024-06-27 23:09:39,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50502 conditions, 5905 events. 3576/5905 cut-off events. For 737245/737308 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 38348 event pairs, 1043 based on Foata normal form. 25/5797 useless extension candidates. Maximal degree in co-relation 50349. Up to 4888 conditions per place. [2024-06-27 23:09:39,197 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 479 selfloop transitions, 68 changer transitions 0/678 dead transitions. [2024-06-27 23:09:39,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 678 transitions, 12540 flow [2024-06-27 23:09:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-27 23:09:39,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-27 23:09:39,198 INFO L175 Difference]: Start difference. First operand has 317 places, 652 transitions, 11282 flow. Second operand 8 states and 165 transitions. [2024-06-27 23:09:39,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 678 transitions, 12540 flow [2024-06-27 23:09:41,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 678 transitions, 12077 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:41,509 INFO L231 Difference]: Finished difference. Result has 318 places, 655 transitions, 11024 flow [2024-06-27 23:09:41,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10819, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11024, PETRI_PLACES=318, PETRI_TRANSITIONS=655} [2024-06-27 23:09:41,510 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 274 predicate places. [2024-06-27 23:09:41,510 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 655 transitions, 11024 flow [2024-06-27 23:09:41,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:09:41,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:41,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:41,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 23:09:41,510 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:41,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1635708644, now seen corresponding path program 7 times [2024-06-27 23:09:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004845642] [2024-06-27 23:09:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:42,930 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-27 23:09:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004845642] [2024-06-27 23:09:42,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004845642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:42,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:42,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079746982] [2024-06-27 23:09:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:42,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:42,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:42,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:43,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:43,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 655 transitions, 11024 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:43,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:43,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:43,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:44,927 INFO L124 PetriNetUnfolderBase]: 4296/6832 cut-off events. [2024-06-27 23:09:44,928 INFO L125 PetriNetUnfolderBase]: For 754916/754918 co-relation queries the response was YES. [2024-06-27 23:09:44,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55928 conditions, 6832 events. 4296/6832 cut-off events. For 754916/754918 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 42519 event pairs, 926 based on Foata normal form. 10/6841 useless extension candidates. Maximal degree in co-relation 55773. Up to 6102 conditions per place. [2024-06-27 23:09:45,011 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 602 selfloop transitions, 90 changer transitions 0/697 dead transitions. [2024-06-27 23:09:45,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 697 transitions, 12737 flow [2024-06-27 23:09:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-27 23:09:45,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702842377260982 [2024-06-27 23:09:45,012 INFO L175 Difference]: Start difference. First operand has 318 places, 655 transitions, 11024 flow. Second operand 9 states and 182 transitions. [2024-06-27 23:09:45,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 697 transitions, 12737 flow [2024-06-27 23:09:47,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 697 transitions, 12572 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:47,439 INFO L231 Difference]: Finished difference. Result has 321 places, 665 transitions, 11272 flow [2024-06-27 23:09:47,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10859, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11272, PETRI_PLACES=321, PETRI_TRANSITIONS=665} [2024-06-27 23:09:47,439 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 277 predicate places. [2024-06-27 23:09:47,439 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 665 transitions, 11272 flow [2024-06-27 23:09:47,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:47,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:47,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:47,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 23:09:47,440 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:47,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1632851684, now seen corresponding path program 8 times [2024-06-27 23:09:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67622669] [2024-06-27 23:09:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:49,010 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-27 23:09:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67622669] [2024-06-27 23:09:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67622669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:49,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:49,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:49,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102955784] [2024-06-27 23:09:49,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:49,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:49,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:49,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:49,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:49,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:49,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 665 transitions, 11272 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:49,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:49,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:49,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:51,074 INFO L124 PetriNetUnfolderBase]: 4408/7012 cut-off events. [2024-06-27 23:09:51,074 INFO L125 PetriNetUnfolderBase]: For 771374/771376 co-relation queries the response was YES. [2024-06-27 23:09:51,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57394 conditions, 7012 events. 4408/7012 cut-off events. For 771374/771376 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 43937 event pairs, 924 based on Foata normal form. 8/7019 useless extension candidates. Maximal degree in co-relation 57239. Up to 6157 conditions per place. [2024-06-27 23:09:51,164 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 609 selfloop transitions, 108 changer transitions 0/722 dead transitions. [2024-06-27 23:09:51,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 722 transitions, 13138 flow [2024-06-27 23:09:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:09:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:09:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-06-27 23:09:51,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46744186046511627 [2024-06-27 23:09:51,165 INFO L175 Difference]: Start difference. First operand has 321 places, 665 transitions, 11272 flow. Second operand 10 states and 201 transitions. [2024-06-27 23:09:51,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 722 transitions, 13138 flow [2024-06-27 23:09:53,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 722 transitions, 12883 flow, removed 45 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:53,453 INFO L231 Difference]: Finished difference. Result has 325 places, 683 transitions, 11571 flow [2024-06-27 23:09:53,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11017, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11571, PETRI_PLACES=325, PETRI_TRANSITIONS=683} [2024-06-27 23:09:53,453 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 281 predicate places. [2024-06-27 23:09:53,453 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 683 transitions, 11571 flow [2024-06-27 23:09:53,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:53,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:53,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:53,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 23:09:53,454 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:53,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1818293656, now seen corresponding path program 9 times [2024-06-27 23:09:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:53,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823646861] [2024-06-27 23:09:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:54,842 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-27 23:09:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823646861] [2024-06-27 23:09:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823646861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:54,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:09:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241002275] [2024-06-27 23:09:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:09:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:09:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:09:54,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:09:54,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 683 transitions, 11571 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:09:54,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:54,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:09:54,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:56,935 INFO L124 PetriNetUnfolderBase]: 4436/7061 cut-off events. [2024-06-27 23:09:56,935 INFO L125 PetriNetUnfolderBase]: For 784576/784581 co-relation queries the response was YES. [2024-06-27 23:09:56,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58104 conditions, 7061 events. 4436/7061 cut-off events. For 784576/784581 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 44252 event pairs, 903 based on Foata normal form. 8/7067 useless extension candidates. Maximal degree in co-relation 57947. Up to 6052 conditions per place. [2024-06-27 23:09:57,025 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 511 selfloop transitions, 204 changer transitions 0/720 dead transitions. [2024-06-27 23:09:57,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 720 transitions, 13239 flow [2024-06-27 23:09:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-27 23:09:57,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48320413436692505 [2024-06-27 23:09:57,027 INFO L175 Difference]: Start difference. First operand has 325 places, 683 transitions, 11571 flow. Second operand 9 states and 187 transitions. [2024-06-27 23:09:57,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 720 transitions, 13239 flow [2024-06-27 23:10:00,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 720 transitions, 12993 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:00,127 INFO L231 Difference]: Finished difference. Result has 328 places, 687 transitions, 11817 flow [2024-06-27 23:10:00,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11325, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11817, PETRI_PLACES=328, PETRI_TRANSITIONS=687} [2024-06-27 23:10:00,128 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 284 predicate places. [2024-06-27 23:10:00,128 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 687 transitions, 11817 flow [2024-06-27 23:10:00,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:00,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:00,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:00,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 23:10:00,129 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:00,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash 61526662, now seen corresponding path program 10 times [2024-06-27 23:10:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:00,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521838470] [2024-06-27 23:10:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:10:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:01,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521838470] [2024-06-27 23:10:01,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521838470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:01,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:01,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722199274] [2024-06-27 23:10:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:01,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:01,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:01,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:01,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:01,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 687 transitions, 11817 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:01,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:01,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:01,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:03,505 INFO L124 PetriNetUnfolderBase]: 4453/7092 cut-off events. [2024-06-27 23:10:03,505 INFO L125 PetriNetUnfolderBase]: For 807186/807189 co-relation queries the response was YES. [2024-06-27 23:10:03,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58888 conditions, 7092 events. 4453/7092 cut-off events. For 807186/807189 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 44561 event pairs, 883 based on Foata normal form. 6/7096 useless extension candidates. Maximal degree in co-relation 58730. Up to 6089 conditions per place. [2024-06-27 23:10:03,607 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 511 selfloop transitions, 206 changer transitions 0/722 dead transitions. [2024-06-27 23:10:03,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 722 transitions, 13501 flow [2024-06-27 23:10:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-27 23:10:03,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780361757105943 [2024-06-27 23:10:03,608 INFO L175 Difference]: Start difference. First operand has 328 places, 687 transitions, 11817 flow. Second operand 9 states and 185 transitions. [2024-06-27 23:10:03,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 722 transitions, 13501 flow [2024-06-27 23:10:06,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 722 transitions, 13053 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-27 23:10:06,299 INFO L231 Difference]: Finished difference. Result has 330 places, 689 transitions, 11854 flow [2024-06-27 23:10:06,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11369, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11854, PETRI_PLACES=330, PETRI_TRANSITIONS=689} [2024-06-27 23:10:06,299 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 286 predicate places. [2024-06-27 23:10:06,299 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 689 transitions, 11854 flow [2024-06-27 23:10:06,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:06,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:06,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:06,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 23:10:06,300 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:06,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1220393206, now seen corresponding path program 1 times [2024-06-27 23:10:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968763840] [2024-06-27 23:10:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:06,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:07,944 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-27 23:10:07,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:07,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968763840] [2024-06-27 23:10:07,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968763840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:07,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035952187] [2024-06-27 23:10:07,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:07,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:07,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:07,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:07,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:08,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:08,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 689 transitions, 11854 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:08,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:08,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:08,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:09,877 INFO L124 PetriNetUnfolderBase]: 4470/7120 cut-off events. [2024-06-27 23:10:09,877 INFO L125 PetriNetUnfolderBase]: For 829110/829115 co-relation queries the response was YES. [2024-06-27 23:10:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59410 conditions, 7120 events. 4470/7120 cut-off events. For 829110/829115 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 44909 event pairs, 1171 based on Foata normal form. 6/7122 useless extension candidates. Maximal degree in co-relation 59251. Up to 6365 conditions per place. [2024-06-27 23:10:09,967 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 656 selfloop transitions, 70 changer transitions 0/731 dead transitions. [2024-06-27 23:10:09,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 731 transitions, 13647 flow [2024-06-27 23:10:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:10:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:10:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-27 23:10:09,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-27 23:10:09,968 INFO L175 Difference]: Start difference. First operand has 330 places, 689 transitions, 11854 flow. Second operand 10 states and 195 transitions. [2024-06-27 23:10:09,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 731 transitions, 13647 flow [2024-06-27 23:10:13,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 731 transitions, 13278 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-27 23:10:13,280 INFO L231 Difference]: Finished difference. Result has 336 places, 696 transitions, 11785 flow [2024-06-27 23:10:13,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11485, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11785, PETRI_PLACES=336, PETRI_TRANSITIONS=696} [2024-06-27 23:10:13,280 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 292 predicate places. [2024-06-27 23:10:13,280 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 696 transitions, 11785 flow [2024-06-27 23:10:13,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:13,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:13,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:13,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 23:10:13,281 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:13,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1327425863, now seen corresponding path program 2 times [2024-06-27 23:10:13,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:13,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316598299] [2024-06-27 23:10:13,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:13,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:14,419 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-27 23:10:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316598299] [2024-06-27 23:10:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316598299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:14,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:10:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308933564] [2024-06-27 23:10:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:10:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:10:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:10:14,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:10:14,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 696 transitions, 11785 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:10:14,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:14,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:10:14,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:16,045 INFO L124 PetriNetUnfolderBase]: 3805/6337 cut-off events. [2024-06-27 23:10:16,045 INFO L125 PetriNetUnfolderBase]: For 832953/832975 co-relation queries the response was YES. [2024-06-27 23:10:16,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55087 conditions, 6337 events. 3805/6337 cut-off events. For 832953/832975 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 42098 event pairs, 806 based on Foata normal form. 9/6245 useless extension candidates. Maximal degree in co-relation 54925. Up to 5183 conditions per place. [2024-06-27 23:10:16,129 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 510 selfloop transitions, 69 changer transitions 0/723 dead transitions. [2024-06-27 23:10:16,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 723 transitions, 13103 flow [2024-06-27 23:10:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-27 23:10:16,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-27 23:10:16,130 INFO L175 Difference]: Start difference. First operand has 336 places, 696 transitions, 11785 flow. Second operand 8 states and 165 transitions. [2024-06-27 23:10:16,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 723 transitions, 13103 flow [2024-06-27 23:10:18,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 723 transitions, 12917 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-27 23:10:18,437 INFO L231 Difference]: Finished difference. Result has 337 places, 702 transitions, 11830 flow [2024-06-27 23:10:18,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11599, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11830, PETRI_PLACES=337, PETRI_TRANSITIONS=702} [2024-06-27 23:10:18,438 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 293 predicate places. [2024-06-27 23:10:18,438 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 702 transitions, 11830 flow [2024-06-27 23:10:18,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:10:18,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:18,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:18,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 23:10:18,439 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:18,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2030710217, now seen corresponding path program 1 times [2024-06-27 23:10:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:18,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638357783] [2024-06-27 23:10:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:19,895 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-27 23:10:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638357783] [2024-06-27 23:10:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638357783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:19,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:10:19,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772348016] [2024-06-27 23:10:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:19,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:10:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:10:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:10:20,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:10:20,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 702 transitions, 11830 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:10:20,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:20,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:10:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:21,519 INFO L124 PetriNetUnfolderBase]: 3788/6281 cut-off events. [2024-06-27 23:10:21,519 INFO L125 PetriNetUnfolderBase]: For 862979/863027 co-relation queries the response was YES. [2024-06-27 23:10:21,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55228 conditions, 6281 events. 3788/6281 cut-off events. For 862979/863027 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 41666 event pairs, 1117 based on Foata normal form. 13/6165 useless extension candidates. Maximal degree in co-relation 55065. Up to 5252 conditions per place. [2024-06-27 23:10:21,599 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 552 selfloop transitions, 27 changer transitions 0/723 dead transitions. [2024-06-27 23:10:21,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 723 transitions, 13118 flow [2024-06-27 23:10:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-27 23:10:21,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622093023255814 [2024-06-27 23:10:21,600 INFO L175 Difference]: Start difference. First operand has 337 places, 702 transitions, 11830 flow. Second operand 8 states and 159 transitions. [2024-06-27 23:10:21,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 723 transitions, 13118 flow [2024-06-27 23:10:24,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 723 transitions, 12951 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:24,143 INFO L231 Difference]: Finished difference. Result has 339 places, 705 transitions, 11776 flow [2024-06-27 23:10:24,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11663, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11776, PETRI_PLACES=339, PETRI_TRANSITIONS=705} [2024-06-27 23:10:24,144 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 295 predicate places. [2024-06-27 23:10:24,144 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 705 transitions, 11776 flow [2024-06-27 23:10:24,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:10:24,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:24,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:24,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 23:10:24,144 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:24,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2030709783, now seen corresponding path program 3 times [2024-06-27 23:10:24,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:24,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714813023] [2024-06-27 23:10:24,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:25,348 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-27 23:10:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714813023] [2024-06-27 23:10:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714813023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:25,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:25,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:10:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032583249] [2024-06-27 23:10:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:25,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:10:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:25,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:10:25,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:10:25,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:10:25,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 705 transitions, 11776 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:10:25,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:25,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:10:25,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:26,929 INFO L124 PetriNetUnfolderBase]: 3824/6363 cut-off events. [2024-06-27 23:10:26,929 INFO L125 PetriNetUnfolderBase]: For 865469/865471 co-relation queries the response was YES. [2024-06-27 23:10:26,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56155 conditions, 6363 events. 3824/6363 cut-off events. For 865469/865471 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 42204 event pairs, 785 based on Foata normal form. 2/6266 useless extension candidates. Maximal degree in co-relation 55991. Up to 5178 conditions per place. [2024-06-27 23:10:27,013 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 503 selfloop transitions, 79 changer transitions 0/726 dead transitions. [2024-06-27 23:10:27,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 726 transitions, 13086 flow [2024-06-27 23:10:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-27 23:10:27,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2024-06-27 23:10:27,015 INFO L175 Difference]: Start difference. First operand has 339 places, 705 transitions, 11776 flow. Second operand 8 states and 162 transitions. [2024-06-27 23:10:27,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 726 transitions, 13086 flow [2024-06-27 23:10:29,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 726 transitions, 13005 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 23:10:29,643 INFO L231 Difference]: Finished difference. Result has 342 places, 708 transitions, 11928 flow [2024-06-27 23:10:29,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11695, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11928, PETRI_PLACES=342, PETRI_TRANSITIONS=708} [2024-06-27 23:10:29,644 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 298 predicate places. [2024-06-27 23:10:29,644 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 708 transitions, 11928 flow [2024-06-27 23:10:29,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:10:29,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:29,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:29,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 23:10:29,645 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:29,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash 685445352, now seen corresponding path program 11 times [2024-06-27 23:10:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:29,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095730794] [2024-06-27 23:10:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:31,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-27 23:10:31,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:31,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095730794] [2024-06-27 23:10:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095730794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:31,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:31,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416577760] [2024-06-27 23:10:31,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:31,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:31,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:31,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:31,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:31,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 708 transitions, 11928 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:31,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:31,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:31,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:33,427 INFO L124 PetriNetUnfolderBase]: 4561/7257 cut-off events. [2024-06-27 23:10:33,428 INFO L125 PetriNetUnfolderBase]: For 910299/910299 co-relation queries the response was YES. [2024-06-27 23:10:33,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62109 conditions, 7257 events. 4561/7257 cut-off events. For 910299/910299 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 45740 event pairs, 931 based on Foata normal form. 8/7255 useless extension candidates. Maximal degree in co-relation 61944. Up to 6506 conditions per place. [2024-06-27 23:10:33,522 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 649 selfloop transitions, 90 changer transitions 0/744 dead transitions. [2024-06-27 23:10:33,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 744 transitions, 13703 flow [2024-06-27 23:10:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 23:10:33,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45219638242894056 [2024-06-27 23:10:33,524 INFO L175 Difference]: Start difference. First operand has 342 places, 708 transitions, 11928 flow. Second operand 9 states and 175 transitions. [2024-06-27 23:10:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 744 transitions, 13703 flow [2024-06-27 23:10:36,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 744 transitions, 13470 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:36,108 INFO L231 Difference]: Finished difference. Result has 345 places, 718 transitions, 12112 flow [2024-06-27 23:10:36,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11695, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12112, PETRI_PLACES=345, PETRI_TRANSITIONS=718} [2024-06-27 23:10:36,109 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 301 predicate places. [2024-06-27 23:10:36,109 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 718 transitions, 12112 flow [2024-06-27 23:10:36,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:36,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:36,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:36,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 23:10:36,110 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:36,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 682588392, now seen corresponding path program 12 times [2024-06-27 23:10:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:36,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664060398] [2024-06-27 23:10:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:36,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:37,707 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-27 23:10:37,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664060398] [2024-06-27 23:10:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664060398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:37,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:37,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:37,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340452433] [2024-06-27 23:10:37,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:37,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:37,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:37,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:37,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:37,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 718 transitions, 12112 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:37,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:37,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:37,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:39,878 INFO L124 PetriNetUnfolderBase]: 4636/7376 cut-off events. [2024-06-27 23:10:39,878 INFO L125 PetriNetUnfolderBase]: For 905820/905820 co-relation queries the response was YES. [2024-06-27 23:10:39,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62541 conditions, 7376 events. 4636/7376 cut-off events. For 905820/905820 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 46727 event pairs, 923 based on Foata normal form. 6/7372 useless extension candidates. Maximal degree in co-relation 62375. Up to 6482 conditions per place. [2024-06-27 23:10:39,991 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 650 selfloop transitions, 112 changer transitions 0/767 dead transitions. [2024-06-27 23:10:39,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 767 transitions, 13980 flow [2024-06-27 23:10:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:10:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:10:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 23:10:39,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511627906976744 [2024-06-27 23:10:39,992 INFO L175 Difference]: Start difference. First operand has 345 places, 718 transitions, 12112 flow. Second operand 10 states and 194 transitions. [2024-06-27 23:10:39,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 767 transitions, 13980 flow [2024-06-27 23:10:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 767 transitions, 13705 flow, removed 65 selfloop flow, removed 5 redundant places. [2024-06-27 23:10:43,024 INFO L231 Difference]: Finished difference. Result has 351 places, 734 transitions, 12348 flow [2024-06-27 23:10:43,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11837, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12348, PETRI_PLACES=351, PETRI_TRANSITIONS=734} [2024-06-27 23:10:43,024 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 307 predicate places. [2024-06-27 23:10:43,024 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 734 transitions, 12348 flow [2024-06-27 23:10:43,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:43,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:43,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:43,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 23:10:43,025 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:43,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1869407212, now seen corresponding path program 13 times [2024-06-27 23:10:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305027098] [2024-06-27 23:10:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:44,603 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-27 23:10:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305027098] [2024-06-27 23:10:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305027098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342001618] [2024-06-27 23:10:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:44,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:44,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:44,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:44,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:44,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 734 transitions, 12348 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:44,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:44,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:44,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:46,677 INFO L124 PetriNetUnfolderBase]: 4675/7440 cut-off events. [2024-06-27 23:10:46,677 INFO L125 PetriNetUnfolderBase]: For 919235/919238 co-relation queries the response was YES. [2024-06-27 23:10:46,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63276 conditions, 7440 events. 4675/7440 cut-off events. For 919235/919238 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 47145 event pairs, 934 based on Foata normal form. 6/7426 useless extension candidates. Maximal degree in co-relation 63108. Up to 6414 conditions per place. [2024-06-27 23:10:46,782 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 561 selfloop transitions, 201 changer transitions 0/767 dead transitions. [2024-06-27 23:10:46,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 767 transitions, 14128 flow [2024-06-27 23:10:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 23:10:46,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625322997416021 [2024-06-27 23:10:46,784 INFO L175 Difference]: Start difference. First operand has 351 places, 734 transitions, 12348 flow. Second operand 9 states and 179 transitions. [2024-06-27 23:10:46,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 767 transitions, 14128 flow [2024-06-27 23:10:50,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 767 transitions, 13890 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-27 23:10:50,069 INFO L231 Difference]: Finished difference. Result has 352 places, 740 transitions, 12628 flow [2024-06-27 23:10:50,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12110, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12628, PETRI_PLACES=352, PETRI_TRANSITIONS=740} [2024-06-27 23:10:50,069 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 308 predicate places. [2024-06-27 23:10:50,069 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 740 transitions, 12628 flow [2024-06-27 23:10:50,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:50,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:50,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:50,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 23:10:50,070 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:50,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2035046346, now seen corresponding path program 14 times [2024-06-27 23:10:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:50,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580222435] [2024-06-27 23:10:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:51,627 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-27 23:10:51,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580222435] [2024-06-27 23:10:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580222435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:51,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:51,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:51,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817814] [2024-06-27 23:10:51,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:51,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:51,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:51,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:51,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 740 transitions, 12628 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:51,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:51,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:51,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:53,891 INFO L124 PetriNetUnfolderBase]: 4703/7491 cut-off events. [2024-06-27 23:10:53,891 INFO L125 PetriNetUnfolderBase]: For 923932/923935 co-relation queries the response was YES. [2024-06-27 23:10:53,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63933 conditions, 7491 events. 4703/7491 cut-off events. For 923932/923935 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 47556 event pairs, 931 based on Foata normal form. 6/7477 useless extension candidates. Maximal degree in co-relation 63765. Up to 6465 conditions per place. [2024-06-27 23:10:53,984 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 571 selfloop transitions, 197 changer transitions 0/773 dead transitions. [2024-06-27 23:10:53,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 773 transitions, 14495 flow [2024-06-27 23:10:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 23:10:53,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625322997416021 [2024-06-27 23:10:53,986 INFO L175 Difference]: Start difference. First operand has 352 places, 740 transitions, 12628 flow. Second operand 9 states and 179 transitions. [2024-06-27 23:10:53,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 773 transitions, 14495 flow [2024-06-27 23:10:57,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 773 transitions, 14005 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-27 23:10:57,289 INFO L231 Difference]: Finished difference. Result has 353 places, 744 transitions, 12630 flow [2024-06-27 23:10:57,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12138, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12630, PETRI_PLACES=353, PETRI_TRANSITIONS=744} [2024-06-27 23:10:57,290 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 309 predicate places. [2024-06-27 23:10:57,290 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 744 transitions, 12630 flow [2024-06-27 23:10:57,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:57,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:57,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:57,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 23:10:57,290 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:57,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1862536018, now seen corresponding path program 2 times [2024-06-27 23:10:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996331959] [2024-06-27 23:10:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:59,134 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-27 23:10:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996331959] [2024-06-27 23:10:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996331959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182732686] [2024-06-27 23:10:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:59,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:59,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:59,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:59,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:10:59,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 744 transitions, 12630 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:10:59,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:59,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:10:59,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:01,398 INFO L124 PetriNetUnfolderBase]: 4731/7543 cut-off events. [2024-06-27 23:11:01,398 INFO L125 PetriNetUnfolderBase]: For 946217/946223 co-relation queries the response was YES. [2024-06-27 23:11:01,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64488 conditions, 7543 events. 4731/7543 cut-off events. For 946217/946223 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 48287 event pairs, 1276 based on Foata normal form. 6/7543 useless extension candidates. Maximal degree in co-relation 64320. Up to 6758 conditions per place. [2024-06-27 23:11:01,501 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 702 selfloop transitions, 75 changer transitions 0/782 dead transitions. [2024-06-27 23:11:01,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 782 transitions, 14521 flow [2024-06-27 23:11:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 23:11:01,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45219638242894056 [2024-06-27 23:11:01,502 INFO L175 Difference]: Start difference. First operand has 353 places, 744 transitions, 12630 flow. Second operand 9 states and 175 transitions. [2024-06-27 23:11:01,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 782 transitions, 14521 flow [2024-06-27 23:11:04,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 782 transitions, 14044 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:04,532 INFO L231 Difference]: Finished difference. Result has 356 places, 754 transitions, 12505 flow [2024-06-27 23:11:04,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12153, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12505, PETRI_PLACES=356, PETRI_TRANSITIONS=754} [2024-06-27 23:11:04,533 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 312 predicate places. [2024-06-27 23:11:04,533 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 754 transitions, 12505 flow [2024-06-27 23:11:04,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:04,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:04,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:04,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 23:11:04,534 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:04,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2031557223, now seen corresponding path program 4 times [2024-06-27 23:11:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911551467] [2024-06-27 23:11:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:05,637 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-27 23:11:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911551467] [2024-06-27 23:11:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911551467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:11:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718453832] [2024-06-27 23:11:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:05,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:11:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:11:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:11:05,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:11:05,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 754 transitions, 12505 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:11:05,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:05,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:11:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:07,400 INFO L124 PetriNetUnfolderBase]: 4039/6708 cut-off events. [2024-06-27 23:11:07,400 INFO L125 PetriNetUnfolderBase]: For 946120/946144 co-relation queries the response was YES. [2024-06-27 23:11:07,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59626 conditions, 6708 events. 4039/6708 cut-off events. For 946120/946144 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 44922 event pairs, 809 based on Foata normal form. 7/6590 useless extension candidates. Maximal degree in co-relation 59457. Up to 5497 conditions per place. [2024-06-27 23:11:07,497 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 551 selfloop transitions, 69 changer transitions 0/778 dead transitions. [2024-06-27 23:11:07,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 778 transitions, 13909 flow [2024-06-27 23:11:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:11:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:11:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-27 23:11:07,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45930232558139533 [2024-06-27 23:11:07,498 INFO L175 Difference]: Start difference. First operand has 356 places, 754 transitions, 12505 flow. Second operand 8 states and 158 transitions. [2024-06-27 23:11:07,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 778 transitions, 13909 flow [2024-06-27 23:11:09,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 778 transitions, 13487 flow, removed 29 selfloop flow, removed 11 redundant places. [2024-06-27 23:11:09,901 INFO L231 Difference]: Finished difference. Result has 353 places, 763 transitions, 12361 flow [2024-06-27 23:11:09,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12083, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12361, PETRI_PLACES=353, PETRI_TRANSITIONS=763} [2024-06-27 23:11:09,902 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 309 predicate places. [2024-06-27 23:11:09,903 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 763 transitions, 12361 flow [2024-06-27 23:11:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:11:09,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:09,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:09,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 23:11:09,903 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:09,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash -390159447, now seen corresponding path program 5 times [2024-06-27 23:11:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067273090] [2024-06-27 23:11:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:11,124 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-27 23:11:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:11,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067273090] [2024-06-27 23:11:11,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067273090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:11,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:11,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:11:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651104601] [2024-06-27 23:11:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:11,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:11:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:11:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:11:11,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:11:11,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 763 transitions, 12361 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:11:11,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:11,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:11:11,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:12,809 INFO L124 PetriNetUnfolderBase]: 4051/6738 cut-off events. [2024-06-27 23:11:12,809 INFO L125 PetriNetUnfolderBase]: For 953983/953998 co-relation queries the response was YES. [2024-06-27 23:11:12,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60089 conditions, 6738 events. 4051/6738 cut-off events. For 953983/953998 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 45209 event pairs, 802 based on Foata normal form. 2/6611 useless extension candidates. Maximal degree in co-relation 59920. Up to 5499 conditions per place. [2024-06-27 23:11:12,903 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 544 selfloop transitions, 79 changer transitions 0/781 dead transitions. [2024-06-27 23:11:12,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 781 transitions, 13743 flow [2024-06-27 23:11:12,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:11:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:11:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 23:11:12,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-27 23:11:12,905 INFO L175 Difference]: Start difference. First operand has 353 places, 763 transitions, 12361 flow. Second operand 8 states and 156 transitions. [2024-06-27 23:11:12,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 781 transitions, 13743 flow [2024-06-27 23:11:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 781 transitions, 13604 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-27 23:11:16,097 INFO L231 Difference]: Finished difference. Result has 356 places, 769 transitions, 12488 flow [2024-06-27 23:11:16,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12222, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12488, PETRI_PLACES=356, PETRI_TRANSITIONS=769} [2024-06-27 23:11:16,098 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 312 predicate places. [2024-06-27 23:11:16,098 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 769 transitions, 12488 flow [2024-06-27 23:11:16,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:11:16,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:16,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:16,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 23:11:16,098 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:16,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2031198739, now seen corresponding path program 2 times [2024-06-27 23:11:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861546760] [2024-06-27 23:11:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:17,823 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-27 23:11:17,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861546760] [2024-06-27 23:11:17,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861546760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:17,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:17,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:11:17,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976840013] [2024-06-27 23:11:17,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:17,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:11:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:17,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:11:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:11:17,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:11:17,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 769 transitions, 12488 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:11:17,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:17,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:11:17,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:19,543 INFO L124 PetriNetUnfolderBase]: 4035/6685 cut-off events. [2024-06-27 23:11:19,544 INFO L125 PetriNetUnfolderBase]: For 993638/993693 co-relation queries the response was YES. [2024-06-27 23:11:19,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60314 conditions, 6685 events. 4035/6685 cut-off events. For 993638/993693 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 44854 event pairs, 1163 based on Foata normal form. 13/6547 useless extension candidates. Maximal degree in co-relation 60144. Up to 5588 conditions per place. [2024-06-27 23:11:19,636 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 600 selfloop transitions, 29 changer transitions 0/787 dead transitions. [2024-06-27 23:11:19,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 787 transitions, 13868 flow [2024-06-27 23:11:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:11:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:11:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:11:19,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:11:19,637 INFO L175 Difference]: Start difference. First operand has 356 places, 769 transitions, 12488 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:11:19,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 787 transitions, 13868 flow [2024-06-27 23:11:23,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 787 transitions, 13656 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-27 23:11:23,515 INFO L231 Difference]: Finished difference. Result has 357 places, 775 transitions, 12428 flow [2024-06-27 23:11:23,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12276, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12428, PETRI_PLACES=357, PETRI_TRANSITIONS=775} [2024-06-27 23:11:23,516 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 313 predicate places. [2024-06-27 23:11:23,516 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 775 transitions, 12428 flow [2024-06-27 23:11:23,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:11:23,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:23,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:23,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 23:11:23,516 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:23,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1333592244, now seen corresponding path program 15 times [2024-06-27 23:11:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:23,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136121181] [2024-06-27 23:11:23,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:25,100 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-27 23:11:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136121181] [2024-06-27 23:11:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136121181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571531247] [2024-06-27 23:11:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:25,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:25,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:25,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 775 transitions, 12428 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:25,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:25,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:25,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:27,287 INFO L124 PetriNetUnfolderBase]: 4783/7625 cut-off events. [2024-06-27 23:11:27,287 INFO L125 PetriNetUnfolderBase]: For 999766/999766 co-relation queries the response was YES. [2024-06-27 23:11:27,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66098 conditions, 7625 events. 4783/7625 cut-off events. For 999766/999766 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 48609 event pairs, 888 based on Foata normal form. 4/7613 useless extension candidates. Maximal degree in co-relation 65927. Up to 6591 conditions per place. [2024-06-27 23:11:27,407 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 596 selfloop transitions, 203 changer transitions 0/804 dead transitions. [2024-06-27 23:11:27,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 804 transitions, 14309 flow [2024-06-27 23:11:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 23:11:27,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45219638242894056 [2024-06-27 23:11:27,409 INFO L175 Difference]: Start difference. First operand has 357 places, 775 transitions, 12428 flow. Second operand 9 states and 175 transitions. [2024-06-27 23:11:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 804 transitions, 14309 flow [2024-06-27 23:11:30,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 804 transitions, 14219 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-27 23:11:30,988 INFO L231 Difference]: Finished difference. Result has 362 places, 777 transitions, 12833 flow [2024-06-27 23:11:30,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12338, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12833, PETRI_PLACES=362, PETRI_TRANSITIONS=777} [2024-06-27 23:11:30,988 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 318 predicate places. [2024-06-27 23:11:30,988 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 777 transitions, 12833 flow [2024-06-27 23:11:30,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:30,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:30,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 23:11:30,989 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:30,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1340272372, now seen corresponding path program 3 times [2024-06-27 23:11:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129494991] [2024-06-27 23:11:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:32,824 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-27 23:11:32,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:32,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129494991] [2024-06-27 23:11:32,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129494991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:32,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959179654] [2024-06-27 23:11:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:32,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:32,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 777 transitions, 12833 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:32,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:32,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:35,143 INFO L124 PetriNetUnfolderBase]: 4800/7660 cut-off events. [2024-06-27 23:11:35,143 INFO L125 PetriNetUnfolderBase]: For 1030591/1030597 co-relation queries the response was YES. [2024-06-27 23:11:35,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67287 conditions, 7660 events. 4800/7660 cut-off events. For 1030591/1030597 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 49250 event pairs, 1283 based on Foata normal form. 8/7664 useless extension candidates. Maximal degree in co-relation 67115. Up to 6867 conditions per place. [2024-06-27 23:11:35,237 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 732 selfloop transitions, 76 changer transitions 0/813 dead transitions. [2024-06-27 23:11:35,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 813 transitions, 14812 flow [2024-06-27 23:11:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 23:11:35,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255813953488372 [2024-06-27 23:11:35,239 INFO L175 Difference]: Start difference. First operand has 362 places, 777 transitions, 12833 flow. Second operand 10 states and 183 transitions. [2024-06-27 23:11:35,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 813 transitions, 14812 flow [2024-06-27 23:11:38,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 813 transitions, 14087 flow, removed 36 selfloop flow, removed 9 redundant places. [2024-06-27 23:11:38,020 INFO L231 Difference]: Finished difference. Result has 364 places, 784 transitions, 12440 flow [2024-06-27 23:11:38,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12108, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12440, PETRI_PLACES=364, PETRI_TRANSITIONS=784} [2024-06-27 23:11:38,020 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 320 predicate places. [2024-06-27 23:11:38,021 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 784 transitions, 12440 flow [2024-06-27 23:11:38,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:38,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:38,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:38,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 23:11:38,021 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:38,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash -395614090, now seen corresponding path program 4 times [2024-06-27 23:11:38,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590882043] [2024-06-27 23:11:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:39,861 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-27 23:11:39,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590882043] [2024-06-27 23:11:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590882043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697486415] [2024-06-27 23:11:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:39,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:39,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:39,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:40,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:40,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 784 transitions, 12440 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:40,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:40,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:40,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:42,195 INFO L124 PetriNetUnfolderBase]: 4835/7700 cut-off events. [2024-06-27 23:11:42,195 INFO L125 PetriNetUnfolderBase]: For 1045046/1045052 co-relation queries the response was YES. [2024-06-27 23:11:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67980 conditions, 7700 events. 4835/7700 cut-off events. For 1045046/1045052 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 49366 event pairs, 1240 based on Foata normal form. 8/7704 useless extension candidates. Maximal degree in co-relation 67807. Up to 6914 conditions per place. [2024-06-27 23:11:42,314 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 729 selfloop transitions, 86 changer transitions 0/820 dead transitions. [2024-06-27 23:11:42,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 820 transitions, 14434 flow [2024-06-27 23:11:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 23:11:42,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 23:11:42,315 INFO L175 Difference]: Start difference. First operand has 364 places, 784 transitions, 12440 flow. Second operand 9 states and 172 transitions. [2024-06-27 23:11:42,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 820 transitions, 14434 flow [2024-06-27 23:11:44,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 820 transitions, 14105 flow, removed 37 selfloop flow, removed 10 redundant places. [2024-06-27 23:11:44,766 INFO L231 Difference]: Finished difference. Result has 364 places, 793 transitions, 12500 flow [2024-06-27 23:11:44,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12129, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12500, PETRI_PLACES=364, PETRI_TRANSITIONS=793} [2024-06-27 23:11:44,767 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 320 predicate places. [2024-06-27 23:11:44,767 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 793 transitions, 12500 flow [2024-06-27 23:11:44,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:44,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:44,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:44,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 23:11:44,768 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:44,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2048785420, now seen corresponding path program 5 times [2024-06-27 23:11:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289115171] [2024-06-27 23:11:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:46,802 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-27 23:11:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289115171] [2024-06-27 23:11:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289115171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:46,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037275047] [2024-06-27 23:11:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:46,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:46,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 793 transitions, 12500 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:46,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:46,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:46,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:49,277 INFO L124 PetriNetUnfolderBase]: 4852/7731 cut-off events. [2024-06-27 23:11:49,277 INFO L125 PetriNetUnfolderBase]: For 1067311/1067317 co-relation queries the response was YES. [2024-06-27 23:11:49,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68933 conditions, 7731 events. 4852/7731 cut-off events. For 1067311/1067317 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 49642 event pairs, 1239 based on Foata normal form. 8/7735 useless extension candidates. Maximal degree in co-relation 68759. Up to 6941 conditions per place. [2024-06-27 23:11:49,378 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 728 selfloop transitions, 94 changer transitions 0/827 dead transitions. [2024-06-27 23:11:49,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 827 transitions, 14487 flow [2024-06-27 23:11:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 23:11:49,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42093023255813955 [2024-06-27 23:11:49,380 INFO L175 Difference]: Start difference. First operand has 364 places, 793 transitions, 12500 flow. Second operand 10 states and 181 transitions. [2024-06-27 23:11:49,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 827 transitions, 14487 flow [2024-06-27 23:11:52,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 827 transitions, 14233 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-27 23:11:52,890 INFO L231 Difference]: Finished difference. Result has 368 places, 799 transitions, 12599 flow [2024-06-27 23:11:52,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12254, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12599, PETRI_PLACES=368, PETRI_TRANSITIONS=799} [2024-06-27 23:11:52,890 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 324 predicate places. [2024-06-27 23:11:52,890 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 799 transitions, 12599 flow [2024-06-27 23:11:52,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:52,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:52,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 23:11:52,891 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:52,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2059260940, now seen corresponding path program 6 times [2024-06-27 23:11:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807203404] [2024-06-27 23:11:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:54,605 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-27 23:11:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807203404] [2024-06-27 23:11:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807203404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:54,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:54,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14058300] [2024-06-27 23:11:54,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:54,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:54,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:54,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:54,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:11:54,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 799 transitions, 12599 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:11:54,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:54,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:11:54,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:56,821 INFO L124 PetriNetUnfolderBase]: 4844/7724 cut-off events. [2024-06-27 23:11:56,821 INFO L125 PetriNetUnfolderBase]: For 1073136/1073142 co-relation queries the response was YES. [2024-06-27 23:11:56,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68682 conditions, 7724 events. 4844/7724 cut-off events. For 1073136/1073142 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 49750 event pairs, 1207 based on Foata normal form. 8/7728 useless extension candidates. Maximal degree in co-relation 68507. Up to 6797 conditions per place. [2024-06-27 23:11:56,931 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 718 selfloop transitions, 107 changer transitions 0/830 dead transitions. [2024-06-27 23:11:56,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 830 transitions, 14528 flow [2024-06-27 23:11:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 23:11:56,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4232558139534884 [2024-06-27 23:11:56,932 INFO L175 Difference]: Start difference. First operand has 368 places, 799 transitions, 12599 flow. Second operand 10 states and 182 transitions. [2024-06-27 23:11:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 830 transitions, 14528 flow [2024-06-27 23:12:00,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 830 transitions, 14305 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-27 23:12:00,126 INFO L231 Difference]: Finished difference. Result has 372 places, 801 transitions, 12685 flow [2024-06-27 23:12:00,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12376, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12685, PETRI_PLACES=372, PETRI_TRANSITIONS=801} [2024-06-27 23:12:00,127 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 328 predicate places. [2024-06-27 23:12:00,127 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 801 transitions, 12685 flow [2024-06-27 23:12:00,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 23:12:00,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:00,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:00,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 23:12:00,127 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:00,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash 23147867, now seen corresponding path program 3 times [2024-06-27 23:12:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403279360] [2024-06-27 23:12:00,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:01,751 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-27 23:12:01,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403279360] [2024-06-27 23:12:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403279360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:01,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:01,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:01,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740828258] [2024-06-27 23:12:01,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:01,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:01,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:01,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:01,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:12:01,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 801 transitions, 12685 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:01,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:01,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:12:01,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:03,471 INFO L124 PetriNetUnfolderBase]: 4093/6789 cut-off events. [2024-06-27 23:12:03,472 INFO L125 PetriNetUnfolderBase]: For 1090704/1090762 co-relation queries the response was YES. [2024-06-27 23:12:03,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63057 conditions, 6789 events. 4093/6789 cut-off events. For 1090704/1090762 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 45716 event pairs, 1140 based on Foata normal form. 15/6659 useless extension candidates. Maximal degree in co-relation 62881. Up to 5676 conditions per place. [2024-06-27 23:12:03,784 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 620 selfloop transitions, 34 changer transitions 0/813 dead transitions. [2024-06-27 23:12:03,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 813 transitions, 14107 flow [2024-06-27 23:12:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-27 23:12:03,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45514950166112955 [2024-06-27 23:12:03,786 INFO L175 Difference]: Start difference. First operand has 372 places, 801 transitions, 12685 flow. Second operand 7 states and 137 transitions. [2024-06-27 23:12:03,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 813 transitions, 14107 flow [2024-06-27 23:12:06,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 813 transitions, 13816 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-27 23:12:06,787 INFO L231 Difference]: Finished difference. Result has 371 places, 804 transitions, 12548 flow [2024-06-27 23:12:06,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12394, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12548, PETRI_PLACES=371, PETRI_TRANSITIONS=804} [2024-06-27 23:12:06,788 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 327 predicate places. [2024-06-27 23:12:06,788 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 804 transitions, 12548 flow [2024-06-27 23:12:06,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:06,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:06,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:06,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 23:12:06,788 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:06,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1503753939, now seen corresponding path program 6 times [2024-06-27 23:12:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897865979] [2024-06-27 23:12:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:08,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-27 23:12:08,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:08,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897865979] [2024-06-27 23:12:08,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897865979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:08,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:08,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703189508] [2024-06-27 23:12:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:08,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:12:08,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 804 transitions, 12548 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:08,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:08,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:12:08,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:10,123 INFO L124 PetriNetUnfolderBase]: 4116/6857 cut-off events. [2024-06-27 23:12:10,123 INFO L125 PetriNetUnfolderBase]: For 1085039/1085042 co-relation queries the response was YES. [2024-06-27 23:12:10,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63294 conditions, 6857 events. 4116/6857 cut-off events. For 1085039/1085042 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 46214 event pairs, 771 based on Foata normal form. 4/6754 useless extension candidates. Maximal degree in co-relation 63117. Up to 5564 conditions per place. [2024-06-27 23:12:10,222 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 558 selfloop transitions, 99 changer transitions 0/816 dead transitions. [2024-06-27 23:12:10,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 816 transitions, 13986 flow [2024-06-27 23:12:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:12:10,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:12:10,224 INFO L175 Difference]: Start difference. First operand has 371 places, 804 transitions, 12548 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:12:10,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 816 transitions, 13986 flow [2024-06-27 23:12:13,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 816 transitions, 13854 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:13,437 INFO L231 Difference]: Finished difference. Result has 373 places, 807 transitions, 12710 flow [2024-06-27 23:12:13,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12416, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12710, PETRI_PLACES=373, PETRI_TRANSITIONS=807} [2024-06-27 23:12:13,438 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 329 predicate places. [2024-06-27 23:12:13,438 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 807 transitions, 12710 flow [2024-06-27 23:12:13,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:13,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:13,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:13,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 23:12:13,439 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:13,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1503739555, now seen corresponding path program 4 times [2024-06-27 23:12:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727422232] [2024-06-27 23:12:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:15,161 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-27 23:12:15,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:15,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727422232] [2024-06-27 23:12:15,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727422232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:15,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:15,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639503062] [2024-06-27 23:12:15,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:15,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:15,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:15,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:15,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:15,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:12:15,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 807 transitions, 12710 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:15,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:15,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:12:15,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:16,866 INFO L124 PetriNetUnfolderBase]: 4087/6787 cut-off events. [2024-06-27 23:12:16,866 INFO L125 PetriNetUnfolderBase]: For 1119895/1119937 co-relation queries the response was YES. [2024-06-27 23:12:16,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63457 conditions, 6787 events. 4087/6787 cut-off events. For 1119895/1119937 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 45800 event pairs, 1128 based on Foata normal form. 15/6674 useless extension candidates. Maximal degree in co-relation 63279. Up to 5653 conditions per place. [2024-06-27 23:12:16,965 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 612 selfloop transitions, 48 changer transitions 0/819 dead transitions. [2024-06-27 23:12:16,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 819 transitions, 14152 flow [2024-06-27 23:12:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 23:12:16,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2024-06-27 23:12:16,966 INFO L175 Difference]: Start difference. First operand has 373 places, 807 transitions, 12710 flow. Second operand 7 states and 138 transitions. [2024-06-27 23:12:16,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 819 transitions, 14152 flow [2024-06-27 23:12:21,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 819 transitions, 13880 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:21,086 INFO L231 Difference]: Finished difference. Result has 375 places, 810 transitions, 12628 flow [2024-06-27 23:12:21,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12438, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12628, PETRI_PLACES=375, PETRI_TRANSITIONS=810} [2024-06-27 23:12:21,086 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 331 predicate places. [2024-06-27 23:12:21,087 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 810 transitions, 12628 flow [2024-06-27 23:12:21,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:21,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:21,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:21,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 23:12:21,087 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:21,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -183440256, now seen corresponding path program 1 times [2024-06-27 23:12:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:21,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439731487] [2024-06-27 23:12:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:22,082 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-27 23:12:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439731487] [2024-06-27 23:12:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439731487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292627573] [2024-06-27 23:12:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:22,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:22,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:12:22,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 810 transitions, 12628 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:22,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:22,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:12:22,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:24,031 INFO L124 PetriNetUnfolderBase]: 4572/7409 cut-off events. [2024-06-27 23:12:24,031 INFO L125 PetriNetUnfolderBase]: For 1160487/1160510 co-relation queries the response was YES. [2024-06-27 23:12:24,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66988 conditions, 7409 events. 4572/7409 cut-off events. For 1160487/1160510 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 48865 event pairs, 1433 based on Foata normal form. 23/7395 useless extension candidates. Maximal degree in co-relation 66809. Up to 6543 conditions per place. [2024-06-27 23:12:24,147 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 755 selfloop transitions, 16 changer transitions 0/828 dead transitions. [2024-06-27 23:12:24,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 828 transitions, 14320 flow [2024-06-27 23:12:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:12:24,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:12:24,149 INFO L175 Difference]: Start difference. First operand has 375 places, 810 transitions, 12628 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:12:24,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 828 transitions, 14320 flow [2024-06-27 23:12:27,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 828 transitions, 14152 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:27,999 INFO L231 Difference]: Finished difference. Result has 377 places, 813 transitions, 12562 flow [2024-06-27 23:12:27,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12460, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12562, PETRI_PLACES=377, PETRI_TRANSITIONS=813} [2024-06-27 23:12:27,999 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 333 predicate places. [2024-06-27 23:12:28,000 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 813 transitions, 12562 flow [2024-06-27 23:12:28,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:28,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:28,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 23:12:28,000 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:28,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1572037645, now seen corresponding path program 1 times [2024-06-27 23:12:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165261057] [2024-06-27 23:12:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:29,695 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-27 23:12:29,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:29,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165261057] [2024-06-27 23:12:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165261057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:29,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559071293] [2024-06-27 23:12:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:29,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:29,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:29,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 23:12:29,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 813 transitions, 12562 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-27 23:12:29,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:29,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 23:12:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:31,585 INFO L124 PetriNetUnfolderBase]: 4713/7552 cut-off events. [2024-06-27 23:12:31,585 INFO L125 PetriNetUnfolderBase]: For 1181558/1181581 co-relation queries the response was YES. [2024-06-27 23:12:31,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68665 conditions, 7552 events. 4713/7552 cut-off events. For 1181558/1181581 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 49153 event pairs, 1510 based on Foata normal form. 23/7538 useless extension candidates. Maximal degree in co-relation 68485. Up to 6806 conditions per place. [2024-06-27 23:12:31,698 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 762 selfloop transitions, 16 changer transitions 0/828 dead transitions. [2024-06-27 23:12:31,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 828 transitions, 14248 flow [2024-06-27 23:12:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 23:12:31,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-27 23:12:31,699 INFO L175 Difference]: Start difference. First operand has 377 places, 813 transitions, 12562 flow. Second operand 7 states and 131 transitions. [2024-06-27 23:12:31,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 828 transitions, 14248 flow [2024-06-27 23:12:35,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 828 transitions, 14168 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:35,066 INFO L231 Difference]: Finished difference. Result has 379 places, 816 transitions, 12590 flow [2024-06-27 23:12:35,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12482, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12590, PETRI_PLACES=379, PETRI_TRANSITIONS=816} [2024-06-27 23:12:35,067 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 335 predicate places. [2024-06-27 23:12:35,067 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 816 transitions, 12590 flow [2024-06-27 23:12:35,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-27 23:12:35,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:35,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:35,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 23:12:35,068 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:35,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash -183290526, now seen corresponding path program 2 times [2024-06-27 23:12:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:35,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502318714] [2024-06-27 23:12:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:36,263 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-27 23:12:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:36,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502318714] [2024-06-27 23:12:36,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502318714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:36,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:36,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272302583] [2024-06-27 23:12:36,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:36,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:36,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:36,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 23:12:36,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 816 transitions, 12590 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-27 23:12:36,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:36,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 23:12:36,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:38,182 INFO L124 PetriNetUnfolderBase]: 4726/7572 cut-off events. [2024-06-27 23:12:38,182 INFO L125 PetriNetUnfolderBase]: For 1208310/1208333 co-relation queries the response was YES. [2024-06-27 23:12:38,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69418 conditions, 7572 events. 4726/7572 cut-off events. For 1208310/1208333 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 49357 event pairs, 1509 based on Foata normal form. 23/7558 useless extension candidates. Maximal degree in co-relation 69237. Up to 6799 conditions per place. [2024-06-27 23:12:38,295 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 759 selfloop transitions, 26 changer transitions 0/835 dead transitions. [2024-06-27 23:12:38,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 835 transitions, 14554 flow [2024-06-27 23:12:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:12:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:12:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 23:12:38,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4273255813953488 [2024-06-27 23:12:38,296 INFO L175 Difference]: Start difference. First operand has 379 places, 816 transitions, 12590 flow. Second operand 8 states and 147 transitions. [2024-06-27 23:12:38,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 835 transitions, 14554 flow [2024-06-27 23:12:42,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 835 transitions, 14468 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:42,286 INFO L231 Difference]: Finished difference. Result has 383 places, 822 transitions, 12712 flow [2024-06-27 23:12:42,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12504, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12712, PETRI_PLACES=383, PETRI_TRANSITIONS=822} [2024-06-27 23:12:42,287 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 339 predicate places. [2024-06-27 23:12:42,287 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 822 transitions, 12712 flow [2024-06-27 23:12:42,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-27 23:12:42,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:42,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:42,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 23:12:42,287 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:42,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash 23362914, now seen corresponding path program 3 times [2024-06-27 23:12:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:42,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022298750] [2024-06-27 23:12:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:43,599 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-27 23:12:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022298750] [2024-06-27 23:12:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022298750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118097718] [2024-06-27 23:12:43,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:43,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:43,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:43,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:43,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:12:43,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 822 transitions, 12712 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:43,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:43,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:12:43,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:45,821 INFO L124 PetriNetUnfolderBase]: 4599/7446 cut-off events. [2024-06-27 23:12:45,821 INFO L125 PetriNetUnfolderBase]: For 1233115/1233141 co-relation queries the response was YES. [2024-06-27 23:12:45,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69528 conditions, 7446 events. 4599/7446 cut-off events. For 1233115/1233141 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 49118 event pairs, 1440 based on Foata normal form. 25/7432 useless extension candidates. Maximal degree in co-relation 69345. Up to 6559 conditions per place. [2024-06-27 23:12:45,920 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 748 selfloop transitions, 28 changer transitions 0/834 dead transitions. [2024-06-27 23:12:45,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 834 transitions, 14376 flow [2024-06-27 23:12:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:12:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:12:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 23:12:45,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-27 23:12:45,922 INFO L175 Difference]: Start difference. First operand has 383 places, 822 transitions, 12712 flow. Second operand 8 states and 150 transitions. [2024-06-27 23:12:45,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 834 transitions, 14376 flow [2024-06-27 23:12:49,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 834 transitions, 14293 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-27 23:12:49,654 INFO L231 Difference]: Finished difference. Result has 387 places, 825 transitions, 12769 flow [2024-06-27 23:12:49,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12629, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12769, PETRI_PLACES=387, PETRI_TRANSITIONS=825} [2024-06-27 23:12:49,654 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 343 predicate places. [2024-06-27 23:12:49,654 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 825 transitions, 12769 flow [2024-06-27 23:12:49,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:49,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:49,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:49,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 23:12:49,655 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:49,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 23363131, now seen corresponding path program 2 times [2024-06-27 23:12:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:49,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422785663] [2024-06-27 23:12:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:51,355 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-27 23:12:51,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422785663] [2024-06-27 23:12:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422785663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:51,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:51,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416101189] [2024-06-27 23:12:51,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:51,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:51,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:51,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:51,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 23:12:51,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 825 transitions, 12769 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-27 23:12:51,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:51,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 23:12:51,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:53,229 INFO L124 PetriNetUnfolderBase]: 4728/7576 cut-off events. [2024-06-27 23:12:53,229 INFO L125 PetriNetUnfolderBase]: For 1255199/1255225 co-relation queries the response was YES. [2024-06-27 23:12:53,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71176 conditions, 7576 events. 4728/7576 cut-off events. For 1255199/1255225 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 49319 event pairs, 1514 based on Foata normal form. 25/7563 useless extension candidates. Maximal degree in co-relation 70991. Up to 6821 conditions per place. [2024-06-27 23:12:53,344 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 766 selfloop transitions, 21 changer transitions 0/837 dead transitions. [2024-06-27 23:12:53,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 837 transitions, 14457 flow [2024-06-27 23:12:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:12:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:12:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-27 23:12:53,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318936877076412 [2024-06-27 23:12:53,346 INFO L175 Difference]: Start difference. First operand has 387 places, 825 transitions, 12769 flow. Second operand 7 states and 130 transitions. [2024-06-27 23:12:53,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 837 transitions, 14457 flow [2024-06-27 23:12:57,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 837 transitions, 14339 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 23:12:57,300 INFO L231 Difference]: Finished difference. Result has 388 places, 828 transitions, 12779 flow [2024-06-27 23:12:57,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12651, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12779, PETRI_PLACES=388, PETRI_TRANSITIONS=828} [2024-06-27 23:12:57,300 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 344 predicate places. [2024-06-27 23:12:57,300 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 828 transitions, 12779 flow [2024-06-27 23:12:57,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-27 23:12:57,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:57,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:57,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 23:12:57,301 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:57,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:57,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1566466015, now seen corresponding path program 3 times [2024-06-27 23:12:57,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:57,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683012624] [2024-06-27 23:12:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:57,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:59,061 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-27 23:12:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683012624] [2024-06-27 23:12:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683012624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:59,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:12:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166980641] [2024-06-27 23:12:59,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:59,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:12:59,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:59,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:12:59,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:12:59,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:12:59,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 828 transitions, 12779 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:12:59,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:59,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:12:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:00,970 INFO L124 PetriNetUnfolderBase]: 4610/7461 cut-off events. [2024-06-27 23:13:00,971 INFO L125 PetriNetUnfolderBase]: For 1283139/1283165 co-relation queries the response was YES. [2024-06-27 23:13:01,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70877 conditions, 7461 events. 4610/7461 cut-off events. For 1283139/1283165 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 49232 event pairs, 1435 based on Foata normal form. 27/7450 useless extension candidates. Maximal degree in co-relation 70691. Up to 6564 conditions per place. [2024-06-27 23:13:01,084 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 755 selfloop transitions, 32 changer transitions 0/846 dead transitions. [2024-06-27 23:13:01,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 846 transitions, 14737 flow [2024-06-27 23:13:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:13:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:13:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:13:01,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-27 23:13:01,085 INFO L175 Difference]: Start difference. First operand has 388 places, 828 transitions, 12779 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:13:01,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 846 transitions, 14737 flow [2024-06-27 23:13:05,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 846 transitions, 14631 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-27 23:13:05,556 INFO L231 Difference]: Finished difference. Result has 390 places, 834 transitions, 12886 flow [2024-06-27 23:13:05,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12673, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12886, PETRI_PLACES=390, PETRI_TRANSITIONS=834} [2024-06-27 23:13:05,557 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 346 predicate places. [2024-06-27 23:13:05,557 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 834 transitions, 12886 flow [2024-06-27 23:13:05,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-27 23:13:05,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:05,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:05,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 23:13:05,558 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:05,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 170905149, now seen corresponding path program 1 times [2024-06-27 23:13:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:05,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50833701] [2024-06-27 23:13:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:06,925 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-27 23:13:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50833701] [2024-06-27 23:13:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50833701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:06,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:06,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305460150] [2024-06-27 23:13:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:06,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:07,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:13:07,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 834 transitions, 12886 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:07,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:07,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:13:07,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:09,656 INFO L124 PetriNetUnfolderBase]: 5000/7962 cut-off events. [2024-06-27 23:13:09,656 INFO L125 PetriNetUnfolderBase]: For 1373859/1373863 co-relation queries the response was YES. [2024-06-27 23:13:09,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77511 conditions, 7962 events. 5000/7962 cut-off events. For 1373859/1373863 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 51478 event pairs, 1079 based on Foata normal form. 8/7967 useless extension candidates. Maximal degree in co-relation 77324. Up to 6559 conditions per place. [2024-06-27 23:13:09,760 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 724 selfloop transitions, 167 changer transitions 0/896 dead transitions. [2024-06-27 23:13:09,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 896 transitions, 15538 flow [2024-06-27 23:13:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:13:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:13:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 245 transitions. [2024-06-27 23:13:09,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748062015503876 [2024-06-27 23:13:09,762 INFO L175 Difference]: Start difference. First operand has 390 places, 834 transitions, 12886 flow. Second operand 12 states and 245 transitions. [2024-06-27 23:13:09,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 896 transitions, 15538 flow [2024-06-27 23:13:14,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 896 transitions, 15455 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-27 23:13:14,043 INFO L231 Difference]: Finished difference. Result has 400 places, 838 transitions, 13347 flow [2024-06-27 23:13:14,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12803, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13347, PETRI_PLACES=400, PETRI_TRANSITIONS=838} [2024-06-27 23:13:14,043 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 356 predicate places. [2024-06-27 23:13:14,044 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 838 transitions, 13347 flow [2024-06-27 23:13:14,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:14,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:14,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:14,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 23:13:14,044 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:14,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash 259470909, now seen corresponding path program 2 times [2024-06-27 23:13:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:14,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141234714] [2024-06-27 23:13:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:14,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:15,327 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-27 23:13:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141234714] [2024-06-27 23:13:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141234714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:15,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:15,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533519188] [2024-06-27 23:13:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:15,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:15,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:15,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:15,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:13:15,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 838 transitions, 13347 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:15,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:15,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:13:15,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:18,063 INFO L124 PetriNetUnfolderBase]: 5089/8126 cut-off events. [2024-06-27 23:13:18,063 INFO L125 PetriNetUnfolderBase]: For 1469951/1469955 co-relation queries the response was YES. [2024-06-27 23:13:18,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82010 conditions, 8126 events. 5089/8126 cut-off events. For 1469951/1469955 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 52811 event pairs, 1196 based on Foata normal form. 8/8133 useless extension candidates. Maximal degree in co-relation 81821. Up to 6915 conditions per place. [2024-06-27 23:13:18,194 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 740 selfloop transitions, 152 changer transitions 0/897 dead transitions. [2024-06-27 23:13:18,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 897 transitions, 16019 flow [2024-06-27 23:13:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:13:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:13:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 243 transitions. [2024-06-27 23:13:18,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2024-06-27 23:13:18,196 INFO L175 Difference]: Start difference. First operand has 400 places, 838 transitions, 13347 flow. Second operand 12 states and 243 transitions. [2024-06-27 23:13:18,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 897 transitions, 16019 flow [2024-06-27 23:13:22,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 897 transitions, 15773 flow, removed 57 selfloop flow, removed 6 redundant places. [2024-06-27 23:13:22,594 INFO L231 Difference]: Finished difference. Result has 406 places, 842 transitions, 13583 flow [2024-06-27 23:13:22,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=13129, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13583, PETRI_PLACES=406, PETRI_TRANSITIONS=842} [2024-06-27 23:13:22,594 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 362 predicate places. [2024-06-27 23:13:22,595 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 842 transitions, 13583 flow [2024-06-27 23:13:22,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:22,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:22,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:22,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 23:13:22,595 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:22,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1114330787, now seen corresponding path program 3 times [2024-06-27 23:13:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:22,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412093498] [2024-06-27 23:13:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:23,860 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-27 23:13:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412093498] [2024-06-27 23:13:23,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412093498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:23,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:23,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577303277] [2024-06-27 23:13:23,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:23,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:23,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:24,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:13:24,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 842 transitions, 13583 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:24,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:24,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:13:24,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:26,495 INFO L124 PetriNetUnfolderBase]: 5053/8078 cut-off events. [2024-06-27 23:13:26,495 INFO L125 PetriNetUnfolderBase]: For 1481177/1481181 co-relation queries the response was YES. [2024-06-27 23:13:26,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80030 conditions, 8078 events. 5053/8078 cut-off events. For 1481177/1481181 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 52604 event pairs, 1201 based on Foata normal form. 24/8101 useless extension candidates. Maximal degree in co-relation 79839. Up to 6990 conditions per place. [2024-06-27 23:13:26,622 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 743 selfloop transitions, 146 changer transitions 0/894 dead transitions. [2024-06-27 23:13:26,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 894 transitions, 15715 flow [2024-06-27 23:13:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:13:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:13:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-27 23:13:26,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4631782945736434 [2024-06-27 23:13:26,623 INFO L175 Difference]: Start difference. First operand has 406 places, 842 transitions, 13583 flow. Second operand 12 states and 239 transitions. [2024-06-27 23:13:26,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 894 transitions, 15715 flow [2024-06-27 23:13:31,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 894 transitions, 15444 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-27 23:13:31,519 INFO L231 Difference]: Finished difference. Result has 410 places, 842 transitions, 13618 flow [2024-06-27 23:13:31,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=13312, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13618, PETRI_PLACES=410, PETRI_TRANSITIONS=842} [2024-06-27 23:13:31,520 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 366 predicate places. [2024-06-27 23:13:31,520 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 842 transitions, 13618 flow [2024-06-27 23:13:31,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:31,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:31,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:31,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 23:13:31,520 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:31,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1376070297, now seen corresponding path program 4 times [2024-06-27 23:13:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937912737] [2024-06-27 23:13:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:32,544 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-27 23:13:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937912737] [2024-06-27 23:13:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937912737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:32,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:32,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:13:32,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566009879] [2024-06-27 23:13:32,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:32,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:13:32,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:32,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:13:32,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:13:32,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-27 23:13:32,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 842 transitions, 13618 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 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-27 23:13:32,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:32,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-27 23:13:32,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:35,033 INFO L124 PetriNetUnfolderBase]: 4608/7734 cut-off events. [2024-06-27 23:13:35,034 INFO L125 PetriNetUnfolderBase]: For 1752684/1752992 co-relation queries the response was YES. [2024-06-27 23:13:35,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83161 conditions, 7734 events. 4608/7734 cut-off events. For 1752684/1752992 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 53878 event pairs, 782 based on Foata normal form. 70/7721 useless extension candidates. Maximal degree in co-relation 82968. Up to 4679 conditions per place. [2024-06-27 23:13:35,174 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 500 selfloop transitions, 179 changer transitions 0/900 dead transitions. [2024-06-27 23:13:35,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 900 transitions, 16060 flow [2024-06-27 23:13:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:13:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:13:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 262 transitions. [2024-06-27 23:13:35,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077519379844961 [2024-06-27 23:13:35,175 INFO L175 Difference]: Start difference. First operand has 410 places, 842 transitions, 13618 flow. Second operand 12 states and 262 transitions. [2024-06-27 23:13:35,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 900 transitions, 16060 flow [2024-06-27 23:13:41,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 900 transitions, 15754 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-27 23:13:41,125 INFO L231 Difference]: Finished difference. Result has 412 places, 846 transitions, 13947 flow [2024-06-27 23:13:41,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=13312, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13947, PETRI_PLACES=412, PETRI_TRANSITIONS=846} [2024-06-27 23:13:41,125 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 368 predicate places. [2024-06-27 23:13:41,125 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 846 transitions, 13947 flow [2024-06-27 23:13:41,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 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-27 23:13:41,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:41,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:41,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 23:13:41,126 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:41,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash 784265213, now seen corresponding path program 5 times [2024-06-27 23:13:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:41,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548792050] [2024-06-27 23:13:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:42,559 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-27 23:13:42,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548792050] [2024-06-27 23:13:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548792050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:42,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499720657] [2024-06-27 23:13:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:42,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:42,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:42,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:42,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:42,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:13:42,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 846 transitions, 13947 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:42,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:42,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:13:42,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:45,253 INFO L124 PetriNetUnfolderBase]: 5423/8661 cut-off events. [2024-06-27 23:13:45,253 INFO L125 PetriNetUnfolderBase]: For 1693157/1693161 co-relation queries the response was YES. [2024-06-27 23:13:45,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90780 conditions, 8661 events. 5423/8661 cut-off events. For 1693157/1693161 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 57074 event pairs, 1374 based on Foata normal form. 10/8661 useless extension candidates. Maximal degree in co-relation 90584. Up to 7506 conditions per place. [2024-06-27 23:13:45,406 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 786 selfloop transitions, 131 changer transitions 0/922 dead transitions. [2024-06-27 23:13:45,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 922 transitions, 17123 flow [2024-06-27 23:13:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:13:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:13:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2024-06-27 23:13:45,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693446088794926 [2024-06-27 23:13:45,408 INFO L175 Difference]: Start difference. First operand has 412 places, 846 transitions, 13947 flow. Second operand 11 states and 222 transitions. [2024-06-27 23:13:45,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 922 transitions, 17123 flow [2024-06-27 23:13:51,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 922 transitions, 16767 flow, removed 81 selfloop flow, removed 10 redundant places. [2024-06-27 23:13:51,321 INFO L231 Difference]: Finished difference. Result has 415 places, 872 transitions, 14694 flow [2024-06-27 23:13:51,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=13690, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14694, PETRI_PLACES=415, PETRI_TRANSITIONS=872} [2024-06-27 23:13:51,322 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 371 predicate places. [2024-06-27 23:13:51,322 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 872 transitions, 14694 flow [2024-06-27 23:13:51,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:51,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:51,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:51,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 23:13:51,323 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:51,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 872830973, now seen corresponding path program 6 times [2024-06-27 23:13:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788343676] [2024-06-27 23:13:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:52,979 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-27 23:13:52,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:52,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788343676] [2024-06-27 23:13:52,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788343676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:52,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:52,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33711241] [2024-06-27 23:13:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:52,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:52,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:53,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:13:53,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 872 transitions, 14694 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:13:53,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:53,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:13:53,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:55,734 INFO L124 PetriNetUnfolderBase]: 5462/8726 cut-off events. [2024-06-27 23:13:55,734 INFO L125 PetriNetUnfolderBase]: For 1648620/1648624 co-relation queries the response was YES. [2024-06-27 23:13:55,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91437 conditions, 8726 events. 5462/8726 cut-off events. For 1648620/1648624 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 57553 event pairs, 1459 based on Foata normal form. 12/8732 useless extension candidates. Maximal degree in co-relation 91241. Up to 7755 conditions per place. [2024-06-27 23:13:55,884 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 801 selfloop transitions, 114 changer transitions 0/920 dead transitions. [2024-06-27 23:13:55,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 920 transitions, 17338 flow [2024-06-27 23:13:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:13:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:13:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-27 23:13:55,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720930232558139 [2024-06-27 23:13:55,886 INFO L175 Difference]: Start difference. First operand has 415 places, 872 transitions, 14694 flow. Second operand 10 states and 203 transitions. [2024-06-27 23:13:55,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 920 transitions, 17338 flow [2024-06-27 23:14:00,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 920 transitions, 17005 flow, removed 117 selfloop flow, removed 6 redundant places. [2024-06-27 23:14:00,657 INFO L231 Difference]: Finished difference. Result has 419 places, 877 transitions, 14834 flow [2024-06-27 23:14:00,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14395, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14834, PETRI_PLACES=419, PETRI_TRANSITIONS=877} [2024-06-27 23:14:00,657 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 375 predicate places. [2024-06-27 23:14:00,658 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 877 transitions, 14834 flow [2024-06-27 23:14:00,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:00,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:00,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:00,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 23:14:00,658 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:00,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 872978843, now seen corresponding path program 7 times [2024-06-27 23:14:00,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:00,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994328507] [2024-06-27 23:14:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:02,105 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-27 23:14:02,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994328507] [2024-06-27 23:14:02,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994328507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:02,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:02,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:02,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495496581] [2024-06-27 23:14:02,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:02,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:02,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:14:02,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 877 transitions, 14834 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:02,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:02,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:14:02,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:04,837 INFO L124 PetriNetUnfolderBase]: 5444/8710 cut-off events. [2024-06-27 23:14:04,837 INFO L125 PetriNetUnfolderBase]: For 1631243/1631247 co-relation queries the response was YES. [2024-06-27 23:14:04,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90126 conditions, 8710 events. 5444/8710 cut-off events. For 1631243/1631247 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 57631 event pairs, 1494 based on Foata normal form. 12/8716 useless extension candidates. Maximal degree in co-relation 89928. Up to 7880 conditions per place. [2024-06-27 23:14:04,993 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 810 selfloop transitions, 100 changer transitions 0/915 dead transitions. [2024-06-27 23:14:04,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 915 transitions, 16835 flow [2024-06-27 23:14:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-27 23:14:04,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627906976744186 [2024-06-27 23:14:04,995 INFO L175 Difference]: Start difference. First operand has 419 places, 877 transitions, 14834 flow. Second operand 10 states and 199 transitions. [2024-06-27 23:14:04,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 915 transitions, 16835 flow [2024-06-27 23:14:10,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 915 transitions, 16335 flow, removed 147 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:10,565 INFO L231 Difference]: Finished difference. Result has 422 places, 877 transitions, 14550 flow [2024-06-27 23:14:10,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14334, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14550, PETRI_PLACES=422, PETRI_TRANSITIONS=877} [2024-06-27 23:14:10,566 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 378 predicate places. [2024-06-27 23:14:10,566 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 877 transitions, 14550 flow [2024-06-27 23:14:10,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:10,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:10,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:10,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 23:14:10,567 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:10,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1697712089, now seen corresponding path program 8 times [2024-06-27 23:14:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004619879] [2024-06-27 23:14:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:12,029 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-27 23:14:12,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:12,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004619879] [2024-06-27 23:14:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004619879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:12,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284860943] [2024-06-27 23:14:12,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:12,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:12,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:12,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:12,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:14:12,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 877 transitions, 14550 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:12,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:12,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:14:12,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:15,156 INFO L124 PetriNetUnfolderBase]: 5519/8826 cut-off events. [2024-06-27 23:14:15,156 INFO L125 PetriNetUnfolderBase]: For 1706781/1706786 co-relation queries the response was YES. [2024-06-27 23:14:15,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90896 conditions, 8826 events. 5519/8826 cut-off events. For 1706781/1706786 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 58413 event pairs, 1080 based on Foata normal form. 22/8840 useless extension candidates. Maximal degree in co-relation 90697. Up to 6270 conditions per place. [2024-06-27 23:14:15,292 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 448 selfloop transitions, 472 changer transitions 0/925 dead transitions. [2024-06-27 23:14:15,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 925 transitions, 16838 flow [2024-06-27 23:14:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-06-27 23:14:15,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046511627906977 [2024-06-27 23:14:15,294 INFO L175 Difference]: Start difference. First operand has 422 places, 877 transitions, 14550 flow. Second operand 10 states and 217 transitions. [2024-06-27 23:14:15,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 925 transitions, 16838 flow [2024-06-27 23:14:20,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 925 transitions, 16606 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-27 23:14:20,975 INFO L231 Difference]: Finished difference. Result has 423 places, 879 transitions, 15362 flow [2024-06-27 23:14:20,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14318, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=470, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15362, PETRI_PLACES=423, PETRI_TRANSITIONS=879} [2024-06-27 23:14:20,975 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 379 predicate places. [2024-06-27 23:14:20,975 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 879 transitions, 15362 flow [2024-06-27 23:14:20,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:20,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:20,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:20,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 23:14:20,976 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:20,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 878306289, now seen corresponding path program 9 times [2024-06-27 23:14:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776143865] [2024-06-27 23:14:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:22,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-27 23:14:22,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776143865] [2024-06-27 23:14:22,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776143865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:22,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:22,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97835089] [2024-06-27 23:14:22,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:22,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:22,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:22,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:22,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:14:22,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 879 transitions, 15362 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:22,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:22,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:14:22,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:25,636 INFO L124 PetriNetUnfolderBase]: 5594/8950 cut-off events. [2024-06-27 23:14:25,637 INFO L125 PetriNetUnfolderBase]: For 1763056/1763061 co-relation queries the response was YES. [2024-06-27 23:14:25,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94414 conditions, 8950 events. 5594/8950 cut-off events. For 1763056/1763061 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 59426 event pairs, 1101 based on Foata normal form. 22/8964 useless extension candidates. Maximal degree in co-relation 94214. Up to 6395 conditions per place. [2024-06-27 23:14:25,794 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 459 selfloop transitions, 464 changer transitions 0/928 dead transitions. [2024-06-27 23:14:25,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 928 transitions, 17694 flow [2024-06-27 23:14:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2024-06-27 23:14:25,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093023255813953 [2024-06-27 23:14:25,796 INFO L175 Difference]: Start difference. First operand has 423 places, 879 transitions, 15362 flow. Second operand 10 states and 219 transitions. [2024-06-27 23:14:25,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 928 transitions, 17694 flow [2024-06-27 23:14:31,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 928 transitions, 16694 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-27 23:14:31,626 INFO L231 Difference]: Finished difference. Result has 425 places, 881 transitions, 15394 flow [2024-06-27 23:14:31,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14362, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=462, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15394, PETRI_PLACES=425, PETRI_TRANSITIONS=881} [2024-06-27 23:14:31,627 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 381 predicate places. [2024-06-27 23:14:31,627 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 881 transitions, 15394 flow [2024-06-27 23:14:31,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:31,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:31,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:31,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 23:14:31,628 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:31,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 878158419, now seen corresponding path program 10 times [2024-06-27 23:14:31,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238563720] [2024-06-27 23:14:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:33,114 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-27 23:14:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238563720] [2024-06-27 23:14:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238563720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386682608] [2024-06-27 23:14:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:33,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:33,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:14:33,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 881 transitions, 15394 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:33,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:33,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:14:33,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:35,913 INFO L124 PetriNetUnfolderBase]: 5611/8982 cut-off events. [2024-06-27 23:14:35,913 INFO L125 PetriNetUnfolderBase]: For 1719422/1719427 co-relation queries the response was YES. [2024-06-27 23:14:36,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95019 conditions, 8982 events. 5611/8982 cut-off events. For 1719422/1719427 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 59746 event pairs, 1089 based on Foata normal form. 6/8980 useless extension candidates. Maximal degree in co-relation 94818. Up to 6221 conditions per place. [2024-06-27 23:14:36,075 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 454 selfloop transitions, 471 changer transitions 0/930 dead transitions. [2024-06-27 23:14:36,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 930 transitions, 17718 flow [2024-06-27 23:14:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2024-06-27 23:14:36,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093023255813953 [2024-06-27 23:14:36,077 INFO L175 Difference]: Start difference. First operand has 425 places, 881 transitions, 15394 flow. Second operand 10 states and 219 transitions. [2024-06-27 23:14:36,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 930 transitions, 17718 flow [2024-06-27 23:14:42,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 930 transitions, 16730 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-27 23:14:42,841 INFO L231 Difference]: Finished difference. Result has 427 places, 883 transitions, 15453 flow [2024-06-27 23:14:42,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14406, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15453, PETRI_PLACES=427, PETRI_TRANSITIONS=883} [2024-06-27 23:14:42,842 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 383 predicate places. [2024-06-27 23:14:42,842 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 883 transitions, 15453 flow [2024-06-27 23:14:42,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:42,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:42,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:42,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 23:14:42,842 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:42,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 883884150, now seen corresponding path program 1 times [2024-06-27 23:14:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:42,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819235787] [2024-06-27 23:14:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:44,475 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-27 23:14:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819235787] [2024-06-27 23:14:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819235787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:44,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:44,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769202037] [2024-06-27 23:14:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:44,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:44,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:44,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:44,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:14:44,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 883 transitions, 15453 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:44,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:44,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:14:44,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:47,569 INFO L124 PetriNetUnfolderBase]: 5628/9004 cut-off events. [2024-06-27 23:14:47,569 INFO L125 PetriNetUnfolderBase]: For 1752116/1752123 co-relation queries the response was YES. [2024-06-27 23:14:47,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95557 conditions, 9004 events. 5628/9004 cut-off events. For 1752116/1752123 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 59820 event pairs, 1320 based on Foata normal form. 8/9008 useless extension candidates. Maximal degree in co-relation 95355. Up to 7654 conditions per place. [2024-06-27 23:14:47,731 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 695 selfloop transitions, 233 changer transitions 0/933 dead transitions. [2024-06-27 23:14:47,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 933 transitions, 17783 flow [2024-06-27 23:14:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:14:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:14:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2024-06-27 23:14:47,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608879492600423 [2024-06-27 23:14:47,732 INFO L175 Difference]: Start difference. First operand has 427 places, 883 transitions, 15453 flow. Second operand 11 states and 218 transitions. [2024-06-27 23:14:47,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 933 transitions, 17783 flow [2024-06-27 23:14:54,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 933 transitions, 16746 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-27 23:14:54,179 INFO L231 Difference]: Finished difference. Result has 431 places, 892 transitions, 15093 flow [2024-06-27 23:14:54,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14428, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15093, PETRI_PLACES=431, PETRI_TRANSITIONS=892} [2024-06-27 23:14:54,180 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 387 predicate places. [2024-06-27 23:14:54,180 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 892 transitions, 15093 flow [2024-06-27 23:14:54,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:14:54,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:54,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:54,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 23:14:54,180 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:54,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash 310241089, now seen corresponding path program 1 times [2024-06-27 23:14:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982657735] [2024-06-27 23:14:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:55,801 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-27 23:14:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:55,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982657735] [2024-06-27 23:14:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982657735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:14:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689433148] [2024-06-27 23:14:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:55,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:14:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:14:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:14:55,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 23:14:55,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 892 transitions, 15093 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:14:55,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:55,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 23:14:55,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:58,288 INFO L124 PetriNetUnfolderBase]: 4935/8153 cut-off events. [2024-06-27 23:14:58,288 INFO L125 PetriNetUnfolderBase]: For 1869523/1869717 co-relation queries the response was YES. [2024-06-27 23:14:58,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90099 conditions, 8153 events. 4935/8153 cut-off events. For 1869523/1869717 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 56769 event pairs, 1360 based on Foata normal form. 60/8020 useless extension candidates. Maximal degree in co-relation 89894. Up to 6830 conditions per place. [2024-06-27 23:14:58,446 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 675 selfloop transitions, 77 changer transitions 0/919 dead transitions. [2024-06-27 23:14:58,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 919 transitions, 16797 flow [2024-06-27 23:14:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-27 23:14:58,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46770025839793283 [2024-06-27 23:14:58,448 INFO L175 Difference]: Start difference. First operand has 431 places, 892 transitions, 15093 flow. Second operand 9 states and 181 transitions. [2024-06-27 23:14:58,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 919 transitions, 16797 flow [2024-06-27 23:15:04,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 919 transitions, 16242 flow, removed 48 selfloop flow, removed 8 redundant places. [2024-06-27 23:15:04,791 INFO L231 Difference]: Finished difference. Result has 432 places, 895 transitions, 14788 flow [2024-06-27 23:15:04,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14538, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14788, PETRI_PLACES=432, PETRI_TRANSITIONS=895} [2024-06-27 23:15:04,791 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 388 predicate places. [2024-06-27 23:15:04,791 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 895 transitions, 14788 flow [2024-06-27 23:15:04,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:15:04,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:04,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:04,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 23:15:04,792 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:04,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1507398085, now seen corresponding path program 1 times [2024-06-27 23:15:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:04,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540682591] [2024-06-27 23:15:04,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:06,405 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-27 23:15:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540682591] [2024-06-27 23:15:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540682591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:06,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:06,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981608767] [2024-06-27 23:15:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:06,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:06,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:06,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:15:06,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 895 transitions, 14788 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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-27 23:15:06,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:06,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:15:06,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:09,706 INFO L124 PetriNetUnfolderBase]: 5800/9275 cut-off events. [2024-06-27 23:15:09,706 INFO L125 PetriNetUnfolderBase]: For 1868171/1868173 co-relation queries the response was YES. [2024-06-27 23:15:09,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98387 conditions, 9275 events. 5800/9275 cut-off events. For 1868171/1868173 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 61876 event pairs, 1019 based on Foata normal form. 8/9279 useless extension candidates. Maximal degree in co-relation 98181. Up to 8088 conditions per place. [2024-06-27 23:15:09,878 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 833 selfloop transitions, 136 changer transitions 0/974 dead transitions. [2024-06-27 23:15:09,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 974 transitions, 18063 flow [2024-06-27 23:15:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:15:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:15:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2024-06-27 23:15:09,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693446088794926 [2024-06-27 23:15:09,879 INFO L175 Difference]: Start difference. First operand has 432 places, 895 transitions, 14788 flow. Second operand 11 states and 222 transitions. [2024-06-27 23:15:09,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 974 transitions, 18063 flow [2024-06-27 23:15:17,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 974 transitions, 17839 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-06-27 23:15:17,290 INFO L231 Difference]: Finished difference. Result has 438 places, 926 transitions, 15678 flow [2024-06-27 23:15:17,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=14564, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15678, PETRI_PLACES=438, PETRI_TRANSITIONS=926} [2024-06-27 23:15:17,291 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 394 predicate places. [2024-06-27 23:15:17,291 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 926 transitions, 15678 flow [2024-06-27 23:15:17,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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-27 23:15:17,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:17,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:17,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 23:15:17,291 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:17,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1692107097, now seen corresponding path program 11 times [2024-06-27 23:15:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813998362] [2024-06-27 23:15:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:18,936 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-27 23:15:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813998362] [2024-06-27 23:15:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813998362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155733651] [2024-06-27 23:15:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:18,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:19,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:15:19,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 926 transitions, 15678 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:15:19,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:19,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:15:19,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:23,083 INFO L124 PetriNetUnfolderBase]: 5839/9342 cut-off events. [2024-06-27 23:15:23,083 INFO L125 PetriNetUnfolderBase]: For 1931978/1931980 co-relation queries the response was YES. [2024-06-27 23:15:23,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100730 conditions, 9342 events. 5839/9342 cut-off events. For 1931978/1931980 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 62382 event pairs, 1073 based on Foata normal form. 10/9348 useless extension candidates. Maximal degree in co-relation 100522. Up to 8344 conditions per place. [2024-06-27 23:15:23,233 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 850 selfloop transitions, 117 changer transitions 0/972 dead transitions. [2024-06-27 23:15:23,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 972 transitions, 18455 flow [2024-06-27 23:15:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-27 23:15:23,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720930232558139 [2024-06-27 23:15:23,235 INFO L175 Difference]: Start difference. First operand has 438 places, 926 transitions, 15678 flow. Second operand 10 states and 203 transitions. [2024-06-27 23:15:23,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 972 transitions, 18455 flow [2024-06-27 23:15:31,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 972 transitions, 18121 flow, removed 127 selfloop flow, removed 5 redundant places. [2024-06-27 23:15:31,323 INFO L231 Difference]: Finished difference. Result has 443 places, 931 transitions, 15843 flow [2024-06-27 23:15:31,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15380, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15843, PETRI_PLACES=443, PETRI_TRANSITIONS=931} [2024-06-27 23:15:31,324 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 399 predicate places. [2024-06-27 23:15:31,324 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 931 transitions, 15843 flow [2024-06-27 23:15:31,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:15:31,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:31,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:31,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 23:15:31,325 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:31,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash -832490051, now seen corresponding path program 12 times [2024-06-27 23:15:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105957724] [2024-06-27 23:15:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:31,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:33,137 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-27 23:15:33,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:33,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105957724] [2024-06-27 23:15:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105957724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:33,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:33,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900765947] [2024-06-27 23:15:33,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:33,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:33,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:15:33,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 931 transitions, 15843 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:15:33,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:33,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:15:33,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:36,957 INFO L124 PetriNetUnfolderBase]: 5821/9322 cut-off events. [2024-06-27 23:15:36,958 INFO L125 PetriNetUnfolderBase]: For 1906105/1906107 co-relation queries the response was YES. [2024-06-27 23:15:37,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99211 conditions, 9322 events. 5821/9322 cut-off events. For 1906105/1906107 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 62361 event pairs, 1104 based on Foata normal form. 10/9328 useless extension candidates. Maximal degree in co-relation 99001. Up to 8476 conditions per place. [2024-06-27 23:15:37,123 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 861 selfloop transitions, 101 changer transitions 0/967 dead transitions. [2024-06-27 23:15:37,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 967 transitions, 17929 flow [2024-06-27 23:15:37,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-27 23:15:37,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627906976744186 [2024-06-27 23:15:37,125 INFO L175 Difference]: Start difference. First operand has 443 places, 931 transitions, 15843 flow. Second operand 10 states and 199 transitions. [2024-06-27 23:15:37,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 967 transitions, 17929 flow [2024-06-27 23:15:44,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 967 transitions, 17387 flow, removed 153 selfloop flow, removed 8 redundant places. [2024-06-27 23:15:44,095 INFO L231 Difference]: Finished difference. Result has 445 places, 931 transitions, 15521 flow [2024-06-27 23:15:44,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15301, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15521, PETRI_PLACES=445, PETRI_TRANSITIONS=931} [2024-06-27 23:15:44,096 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 401 predicate places. [2024-06-27 23:15:44,096 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 931 transitions, 15521 flow [2024-06-27 23:15:44,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:15:44,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:44,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:44,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 23:15:44,097 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:44,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1553431077, now seen corresponding path program 13 times [2024-06-27 23:15:44,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:44,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276077880] [2024-06-27 23:15:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:45,763 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-27 23:15:45,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:45,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276077880] [2024-06-27 23:15:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276077880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:45,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:45,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:45,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605893391] [2024-06-27 23:15:45,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:45,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:45,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:45,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:45,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:15:45,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 931 transitions, 15521 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:15:45,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:45,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:15:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:49,773 INFO L124 PetriNetUnfolderBase]: 5945/9515 cut-off events. [2024-06-27 23:15:49,773 INFO L125 PetriNetUnfolderBase]: For 1993348/1993353 co-relation queries the response was YES. [2024-06-27 23:15:49,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100489 conditions, 9515 events. 5945/9515 cut-off events. For 1993348/1993353 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 63853 event pairs, 1018 based on Foata normal form. 22/9533 useless extension candidates. Maximal degree in co-relation 100278. Up to 6890 conditions per place. [2024-06-27 23:15:49,951 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 519 selfloop transitions, 463 changer transitions 0/987 dead transitions. [2024-06-27 23:15:49,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 987 transitions, 18116 flow [2024-06-27 23:15:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions. [2024-06-27 23:15:49,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2024-06-27 23:15:49,952 INFO L175 Difference]: Start difference. First operand has 445 places, 931 transitions, 15521 flow. Second operand 10 states and 220 transitions. [2024-06-27 23:15:49,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 987 transitions, 18116 flow [2024-06-27 23:15:56,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 987 transitions, 17901 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 23:15:56,785 INFO L231 Difference]: Finished difference. Result has 447 places, 935 transitions, 16382 flow [2024-06-27 23:15:56,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15306, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=459, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16382, PETRI_PLACES=447, PETRI_TRANSITIONS=935} [2024-06-27 23:15:56,786 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 403 predicate places. [2024-06-27 23:15:56,786 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 935 transitions, 16382 flow [2024-06-27 23:15:56,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:15:56,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:56,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:56,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 23:15:56,786 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:56,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1553578947, now seen corresponding path program 14 times [2024-06-27 23:15:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:56,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359368600] [2024-06-27 23:15:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:58,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-27 23:15:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359368600] [2024-06-27 23:15:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359368600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:58,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482706396] [2024-06-27 23:15:58,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:58,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:58,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:58,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:15:58,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 935 transitions, 16382 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:15:58,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:58,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:15:58,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:02,390 INFO L124 PetriNetUnfolderBase]: 6133/9819 cut-off events. [2024-06-27 23:16:02,390 INFO L125 PetriNetUnfolderBase]: For 2083342/2083347 co-relation queries the response was YES. [2024-06-27 23:16:02,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107667 conditions, 9819 events. 6133/9819 cut-off events. For 2083342/2083347 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 66215 event pairs, 1046 based on Foata normal form. 6/9821 useless extension candidates. Maximal degree in co-relation 107455. Up to 6879 conditions per place. [2024-06-27 23:16:02,576 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 519 selfloop transitions, 473 changer transitions 0/997 dead transitions. [2024-06-27 23:16:02,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 997 transitions, 19508 flow [2024-06-27 23:16:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions. [2024-06-27 23:16:02,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162790697674419 [2024-06-27 23:16:02,578 INFO L175 Difference]: Start difference. First operand has 447 places, 935 transitions, 16382 flow. Second operand 10 states and 222 transitions. [2024-06-27 23:16:02,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 997 transitions, 19508 flow [2024-06-27 23:16:10,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 997 transitions, 18335 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-27 23:16:10,548 INFO L231 Difference]: Finished difference. Result has 449 places, 943 transitions, 16458 flow [2024-06-27 23:16:10,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15209, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16458, PETRI_PLACES=449, PETRI_TRANSITIONS=943} [2024-06-27 23:16:10,549 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 405 predicate places. [2024-06-27 23:16:10,549 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 943 transitions, 16458 flow [2024-06-27 23:16:10,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:16:10,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:10,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:10,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 23:16:10,549 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:10,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1548068697, now seen corresponding path program 15 times [2024-06-27 23:16:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:10,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731273139] [2024-06-27 23:16:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:12,413 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-27 23:16:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731273139] [2024-06-27 23:16:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731273139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:12,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694843469] [2024-06-27 23:16:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:12,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:12,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:12,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:12,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:16:12,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 943 transitions, 16458 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:16:12,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:12,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:16:12,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:16,650 INFO L124 PetriNetUnfolderBase]: 6097/9770 cut-off events. [2024-06-27 23:16:16,650 INFO L125 PetriNetUnfolderBase]: For 2095456/2095461 co-relation queries the response was YES. [2024-06-27 23:16:16,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105878 conditions, 9770 events. 6097/9770 cut-off events. For 2095456/2095461 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 65980 event pairs, 1058 based on Foata normal form. 22/9788 useless extension candidates. Maximal degree in co-relation 105664. Up to 7138 conditions per place. [2024-06-27 23:16:16,808 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 521 selfloop transitions, 468 changer transitions 0/994 dead transitions. [2024-06-27 23:16:16,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 994 transitions, 18937 flow [2024-06-27 23:16:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-06-27 23:16:16,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069767441860465 [2024-06-27 23:16:16,810 INFO L175 Difference]: Start difference. First operand has 449 places, 943 transitions, 16458 flow. Second operand 10 states and 218 transitions. [2024-06-27 23:16:16,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 994 transitions, 18937 flow [2024-06-27 23:16:26,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 994 transitions, 18106 flow, removed 83 selfloop flow, removed 7 redundant places. [2024-06-27 23:16:26,355 INFO L231 Difference]: Finished difference. Result has 452 places, 943 transitions, 16579 flow [2024-06-27 23:16:26,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=15627, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=468, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16579, PETRI_PLACES=452, PETRI_TRANSITIONS=943} [2024-06-27 23:16:26,356 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 408 predicate places. [2024-06-27 23:16:26,356 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 943 transitions, 16579 flow [2024-06-27 23:16:26,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:16:26,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:26,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:26,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 23:16:26,356 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:26,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1547853216, now seen corresponding path program 2 times [2024-06-27 23:16:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:26,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083421958] [2024-06-27 23:16:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:26,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:28,341 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-27 23:16:28,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:28,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083421958] [2024-06-27 23:16:28,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083421958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:28,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:28,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:28,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256694750] [2024-06-27 23:16:28,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:28,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:28,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:28,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:28,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:28,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 23:16:28,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 943 transitions, 16579 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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-27 23:16:28,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:28,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 23:16:28,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:32,629 INFO L124 PetriNetUnfolderBase]: 6125/9843 cut-off events. [2024-06-27 23:16:32,629 INFO L125 PetriNetUnfolderBase]: For 2024461/2024468 co-relation queries the response was YES. [2024-06-27 23:16:32,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107227 conditions, 9843 events. 6125/9843 cut-off events. For 2024461/2024468 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 66927 event pairs, 1358 based on Foata normal form. 8/9847 useless extension candidates. Maximal degree in co-relation 107011. Up to 8439 conditions per place. [2024-06-27 23:16:32,815 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 761 selfloop transitions, 232 changer transitions 0/998 dead transitions. [2024-06-27 23:16:32,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 998 transitions, 19118 flow [2024-06-27 23:16:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-27 23:16:32,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48372093023255813 [2024-06-27 23:16:32,817 INFO L175 Difference]: Start difference. First operand has 452 places, 943 transitions, 16579 flow. Second operand 10 states and 208 transitions. [2024-06-27 23:16:32,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 998 transitions, 19118 flow [2024-06-27 23:16:40,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 998 transitions, 18121 flow, removed 7 selfloop flow, removed 10 redundant places.