./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:01:54,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:01:54,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:01:54,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:01:54,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:01:54,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:01:54,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:01:54,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:01:54,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:01:54,787 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:01:54,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:01:54,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:01:54,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:01:54,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:01:54,789 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:01:54,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:01:54,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:01:54,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:01:54,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:01:54,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:01:54,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:01:54,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:01:54,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:01:54,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:01:54,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:01:54,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:01:54,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:01:54,792 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:01:54,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:01:54,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:01:54,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:01:54,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:01:54,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:01:54,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:01:54,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:01:54,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:01:54,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:01:54,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:01:54,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:01:54,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:01:54,795 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:01:54,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:01:54,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:01:54,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 12:01:54,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:01:54,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:01:54,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:01:54,995 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:01:54,996 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:01:54,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 12:01:55,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:01:55,218 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:01:55,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 12:01:56,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:01:56,446 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:01:56,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 12:01:56,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18593933a/0306b698de714ca7a6678792e0e1e680/FLAGbcce0f632 [2024-05-12 12:01:56,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18593933a/0306b698de714ca7a6678792e0e1e680 [2024-05-12 12:01:56,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:01:56,480 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:01:56,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:01:56,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:01:56,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:01:56,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:01:55" (1/2) ... [2024-05-12 12:01:56,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616ce204 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:01:56, skipping insertion in model container [2024-05-12 12:01:56,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:01:55" (1/2) ... [2024-05-12 12:01:56,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1db52837 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:01:56, skipping insertion in model container [2024-05-12 12:01:56,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:01:56" (2/2) ... [2024-05-12 12:01:56,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616ce204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:56, skipping insertion in model container [2024-05-12 12:01:56,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:01:56" (2/2) ... [2024-05-12 12:01:56,488 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:01:56,564 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:01:56,565 INFO L97 edCorrectnessWitness]: Location invariant before [L809-L809] ((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:01:56,566 INFO L97 edCorrectnessWitness]: Location invariant before [L808-L808] ((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:01:56,566 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:01:56,567 INFO L106 edCorrectnessWitness]: ghost_update [L806-L806] multithreaded = 1; [2024-05-12 12:01:56,605 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:01:56,755 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-05-12 12:01:56,930 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:01:56,951 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:01:56,979 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:01:57,146 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:01:57,190 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:01:57,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57 WrapperNode [2024-05-12 12:01:57,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:01:57,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:01:57,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:01:57,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:01:57,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,279 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-05-12 12:01:57,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:01:57,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:01:57,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:01:57,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:01:57,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,337 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 12:01:57,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:01:57,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:01:57,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:01:57,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:01:57,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (1/1) ... [2024-05-12 12:01:57,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:01:57,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:01:57,408 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-05-12 12:01:57,416 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-05-12 12:01:57,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:01:57,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:01:57,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:01:57,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:01:57,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:01:57,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:01:57,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:01:57,455 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:01:57,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:01:57,455 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:01:57,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:01:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:01:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:01:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:01:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:01:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:01:57,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:01:57,458 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:01:57,598 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:01:57,600 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:01:58,309 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:01:58,309 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:01:58,451 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:01:58,452 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:01:58,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:01:58 BoogieIcfgContainer [2024-05-12 12:01:58,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:01:58,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:01:58,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:01:58,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:01:58,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:01:55" (1/4) ... [2024-05-12 12:01:58,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4aa150 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:01:58, skipping insertion in model container [2024-05-12 12:01:58,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:01:56" (2/4) ... [2024-05-12 12:01:58,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4aa150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:01:58, skipping insertion in model container [2024-05-12 12:01:58,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:01:57" (3/4) ... [2024-05-12 12:01:58,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4aa150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:01:58, skipping insertion in model container [2024-05-12 12:01:58,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:01:58" (4/4) ... [2024-05-12 12:01:58,462 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-05-12 12:01:58,475 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:01:58,475 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:01:58,475 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:01:58,539 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:01:58,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:01:58,613 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-05-12 12:01:58,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:01:58,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-05-12 12:01:58,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:01:58,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-05-12 12:01:58,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:01:58,678 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;@b8ae0b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:01:58,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 12:01:58,687 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:01:58,687 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:01:58,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:01:58,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:58,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:01:58,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:01:58,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1080264593, now seen corresponding path program 1 times [2024-05-12 12:01:58,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335341811] [2024-05-12 12:01:58,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335341811] [2024-05-12 12:02:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335341811] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:02:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679327884] [2024-05-12 12:02:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:02,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:02:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:02,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:02:02,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:02:02,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:02:02,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:02,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:02,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:02:02,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:02,592 INFO L124 PetriNetUnfolderBase]: 475/806 cut-off events. [2024-05-12 12:02:02,593 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 12:02:02,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 806 events. 475/806 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3871 event pairs, 182 based on Foata normal form. 43/796 useless extension candidates. Maximal degree in co-relation 1610. Up to 787 conditions per place. [2024-05-12 12:02:02,599 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-05-12 12:02:02,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 169 flow [2024-05-12 12:02:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:02:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:02:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-05-12 12:02:02,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-05-12 12:02:02,610 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 70 transitions. [2024-05-12 12:02:02,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 169 flow [2024-05-12 12:02:02,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:02:02,614 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 98 flow [2024-05-12 12:02:02,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-05-12 12:02:02,618 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-05-12 12:02:02,618 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 98 flow [2024-05-12 12:02:02,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:02,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:02,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:02:02,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:02:02,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:02,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1080265258, now seen corresponding path program 1 times [2024-05-12 12:02:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796744199] [2024-05-12 12:02:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:02,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796744199] [2024-05-12 12:02:02,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796744199] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:02,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:02,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:02:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433282504] [2024-05-12 12:02:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:02,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:02:02,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:02,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:02:02,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:02:02,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-05-12 12:02:02,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:02,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:02,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-05-12 12:02:02,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:02,763 INFO L124 PetriNetUnfolderBase]: 152/351 cut-off events. [2024-05-12 12:02:02,763 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 12:02:02,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 351 events. 152/351 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1776 event pairs, 52 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 682. Up to 227 conditions per place. [2024-05-12 12:02:02,766 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 25 selfloop transitions, 3 changer transitions 2/45 dead transitions. [2024-05-12 12:02:02,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 173 flow [2024-05-12 12:02:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:02:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:02:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-05-12 12:02:02,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-05-12 12:02:02,767 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 98 flow. Second operand 3 states and 78 transitions. [2024-05-12 12:02:02,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 173 flow [2024-05-12 12:02:02,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:02:02,769 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 90 flow [2024-05-12 12:02:02,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-05-12 12:02:02,770 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-05-12 12:02:02,770 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 90 flow [2024-05-12 12:02:02,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:02,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:02,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:02,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:02:02,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:02,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1247789681, now seen corresponding path program 1 times [2024-05-12 12:02:02,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:02,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712783592] [2024-05-12 12:02:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:02,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:05,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-05-12 12:02:05,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:05,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712783592] [2024-05-12 12:02:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712783592] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:05,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:05,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:02:05,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176986976] [2024-05-12 12:02:05,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:05,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:02:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:05,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:02:05,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:02:05,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:02:05,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:05,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:05,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:02:05,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:05,455 INFO L124 PetriNetUnfolderBase]: 342/731 cut-off events. [2024-05-12 12:02:05,455 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-05-12 12:02:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 731 events. 342/731 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3824 event pairs, 218 based on Foata normal form. 2/697 useless extension candidates. Maximal degree in co-relation 1468. Up to 562 conditions per place. [2024-05-12 12:02:05,461 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-05-12 12:02:05,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 220 flow [2024-05-12 12:02:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:02:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:02:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-05-12 12:02:05,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-05-12 12:02:05,465 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 90 flow. Second operand 4 states and 82 transitions. [2024-05-12 12:02:05,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 220 flow [2024-05-12 12:02:05,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:02:05,468 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 133 flow [2024-05-12 12:02:05,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-05-12 12:02:05,469 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-05-12 12:02:05,470 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 133 flow [2024-05-12 12:02:05,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:05,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:05,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:05,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:02:05,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:05,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash -26773666, now seen corresponding path program 1 times [2024-05-12 12:02:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:05,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783640568] [2024-05-12 12:02:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783640568] [2024-05-12 12:02:08,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783640568] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:08,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:08,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:02:08,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052250149] [2024-05-12 12:02:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:08,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:02:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:02:08,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:02:09,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:02:09,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:09,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:09,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:02:09,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:09,426 INFO L124 PetriNetUnfolderBase]: 422/849 cut-off events. [2024-05-12 12:02:09,426 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-05-12 12:02:09,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 849 events. 422/849 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4592 event pairs, 148 based on Foata normal form. 5/815 useless extension candidates. Maximal degree in co-relation 1882. Up to 557 conditions per place. [2024-05-12 12:02:09,432 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 51 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2024-05-12 12:02:09,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 357 flow [2024-05-12 12:02:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:02:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:02:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-05-12 12:02:09,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-05-12 12:02:09,436 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 133 flow. Second operand 5 states and 111 transitions. [2024-05-12 12:02:09,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 357 flow [2024-05-12 12:02:09,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 350 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 12:02:09,440 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 216 flow [2024-05-12 12:02:09,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-05-12 12:02:09,442 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-05-12 12:02:09,442 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 216 flow [2024-05-12 12:02:09,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:09,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:09,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:09,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:02:09,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:09,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash -248164604, now seen corresponding path program 1 times [2024-05-12 12:02:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:09,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176955575] [2024-05-12 12:02:09,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:12,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-05-12 12:02:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176955575] [2024-05-12 12:02:12,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176955575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:12,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:12,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:02:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009206083] [2024-05-12 12:02:12,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:12,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:02:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:12,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:02:12,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:02:12,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:02:12,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-05-12 12:02:12,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:12,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:02:12,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:12,572 INFO L124 PetriNetUnfolderBase]: 432/783 cut-off events. [2024-05-12 12:02:12,573 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2024-05-12 12:02:12,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 783 events. 432/783 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3938 event pairs, 92 based on Foata normal form. 3/773 useless extension candidates. Maximal degree in co-relation 2294. Up to 597 conditions per place. [2024-05-12 12:02:12,579 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 62 selfloop transitions, 21 changer transitions 0/91 dead transitions. [2024-05-12 12:02:12,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 552 flow [2024-05-12 12:02:12,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:02:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:02:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-05-12 12:02:12,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-05-12 12:02:12,584 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 216 flow. Second operand 6 states and 128 transitions. [2024-05-12 12:02:12,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 552 flow [2024-05-12 12:02:12,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 548 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 12:02:12,595 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 382 flow [2024-05-12 12:02:12,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2024-05-12 12:02:12,597 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-05-12 12:02:12,597 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 382 flow [2024-05-12 12:02:12,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-05-12 12:02:12,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:12,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:12,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:02:12,598 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:12,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 896832711, now seen corresponding path program 1 times [2024-05-12 12:02:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496489127] [2024-05-12 12:02:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:15,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496489127] [2024-05-12 12:02:15,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496489127] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:15,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:15,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:02:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401781919] [2024-05-12 12:02:15,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:15,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:02:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:15,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:02:15,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:02:15,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:02:15,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:15,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:15,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:02:15,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:15,745 INFO L124 PetriNetUnfolderBase]: 442/801 cut-off events. [2024-05-12 12:02:15,745 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2024-05-12 12:02:15,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 801 events. 442/801 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4084 event pairs, 56 based on Foata normal form. 6/794 useless extension candidates. Maximal degree in co-relation 2784. Up to 565 conditions per place. [2024-05-12 12:02:15,751 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 65 selfloop transitions, 23 changer transitions 0/96 dead transitions. [2024-05-12 12:02:15,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 674 flow [2024-05-12 12:02:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-05-12 12:02:15,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2024-05-12 12:02:15,753 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 382 flow. Second operand 7 states and 143 transitions. [2024-05-12 12:02:15,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 674 flow [2024-05-12 12:02:15,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 664 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-05-12 12:02:15,759 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 435 flow [2024-05-12 12:02:15,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=435, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-05-12 12:02:15,762 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-05-12 12:02:15,762 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 435 flow [2024-05-12 12:02:15,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:15,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:15,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:15,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:02:15,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:15,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash -290161238, now seen corresponding path program 1 times [2024-05-12 12:02:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650216215] [2024-05-12 12:02:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:20,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650216215] [2024-05-12 12:02:20,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650216215] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:20,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:20,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:02:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836564934] [2024-05-12 12:02:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:20,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:02:20,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:02:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:02:20,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:02:20,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:20,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:20,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:02:20,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:21,206 INFO L124 PetriNetUnfolderBase]: 515/1025 cut-off events. [2024-05-12 12:02:21,207 INFO L125 PetriNetUnfolderBase]: For 2206/2206 co-relation queries the response was YES. [2024-05-12 12:02:21,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 1025 events. 515/1025 cut-off events. For 2206/2206 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5637 event pairs, 137 based on Foata normal form. 3/987 useless extension candidates. Maximal degree in co-relation 3469. Up to 815 conditions per place. [2024-05-12 12:02:21,215 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 60 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2024-05-12 12:02:21,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 619 flow [2024-05-12 12:02:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:02:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:02:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-05-12 12:02:21,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 12:02:21,217 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 435 flow. Second operand 5 states and 88 transitions. [2024-05-12 12:02:21,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 619 flow [2024-05-12 12:02:21,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 564 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:02:21,224 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 424 flow [2024-05-12 12:02:21,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-05-12 12:02:21,225 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-05-12 12:02:21,225 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 424 flow [2024-05-12 12:02:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:21,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:21,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:21,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:02:21,226 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:21,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash 310726630, now seen corresponding path program 1 times [2024-05-12 12:02:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711700332] [2024-05-12 12:02:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711700332] [2024-05-12 12:02:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711700332] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:02:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395418552] [2024-05-12 12:02:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:25,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:02:25,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:25,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:02:25,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:02:25,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:02:25,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:25,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:25,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:02:25,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:26,194 INFO L124 PetriNetUnfolderBase]: 542/1052 cut-off events. [2024-05-12 12:02:26,194 INFO L125 PetriNetUnfolderBase]: For 2248/2248 co-relation queries the response was YES. [2024-05-12 12:02:26,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 1052 events. 542/1052 cut-off events. For 2248/2248 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5632 event pairs, 123 based on Foata normal form. 6/1015 useless extension candidates. Maximal degree in co-relation 3544. Up to 683 conditions per place. [2024-05-12 12:02:26,203 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 67 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2024-05-12 12:02:26,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 710 flow [2024-05-12 12:02:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:02:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:02:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-05-12 12:02:26,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-05-12 12:02:26,205 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 424 flow. Second operand 6 states and 113 transitions. [2024-05-12 12:02:26,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 710 flow [2024-05-12 12:02:26,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 690 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 12:02:26,211 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 480 flow [2024-05-12 12:02:26,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-05-12 12:02:26,213 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2024-05-12 12:02:26,213 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 480 flow [2024-05-12 12:02:26,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:26,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:26,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:26,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:02:26,214 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:26,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:26,214 INFO L85 PathProgramCache]: Analyzing trace with hash -597290462, now seen corresponding path program 2 times [2024-05-12 12:02:26,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:26,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515656061] [2024-05-12 12:02:26,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:30,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:30,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515656061] [2024-05-12 12:02:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515656061] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:02:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841597110] [2024-05-12 12:02:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:30,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:02:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:02:30,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:02:30,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:02:30,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 480 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:30,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:30,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:02:30,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:30,535 INFO L124 PetriNetUnfolderBase]: 531/1056 cut-off events. [2024-05-12 12:02:30,535 INFO L125 PetriNetUnfolderBase]: For 2543/2543 co-relation queries the response was YES. [2024-05-12 12:02:30,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 1056 events. 531/1056 cut-off events. For 2543/2543 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5857 event pairs, 165 based on Foata normal form. 3/1016 useless extension candidates. Maximal degree in co-relation 3623. Up to 834 conditions per place. [2024-05-12 12:02:30,543 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 65 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2024-05-12 12:02:30,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 675 flow [2024-05-12 12:02:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:02:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:02:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-05-12 12:02:30,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 12:02:30,544 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 480 flow. Second operand 6 states and 102 transitions. [2024-05-12 12:02:30,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 675 flow [2024-05-12 12:02:30,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 652 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 12:02:30,549 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 485 flow [2024-05-12 12:02:30,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-05-12 12:02:30,550 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-05-12 12:02:30,550 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 485 flow [2024-05-12 12:02:30,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:30,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:30,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:30,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:02:30,551 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:30,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1353108621, now seen corresponding path program 1 times [2024-05-12 12:02:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71237973] [2024-05-12 12:02:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:34,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-05-12 12:02:34,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:34,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71237973] [2024-05-12 12:02:34,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71237973] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:34,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:34,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:34,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085329626] [2024-05-12 12:02:34,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:34,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:34,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:34,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:34,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:34,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:02:34,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 485 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-05-12 12:02:34,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:34,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:02:34,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:35,489 INFO L124 PetriNetUnfolderBase]: 642/1214 cut-off events. [2024-05-12 12:02:35,489 INFO L125 PetriNetUnfolderBase]: For 3241/3241 co-relation queries the response was YES. [2024-05-12 12:02:35,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4253 conditions, 1214 events. 642/1214 cut-off events. For 3241/3241 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6452 event pairs, 194 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 4218. Up to 1009 conditions per place. [2024-05-12 12:02:35,498 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 72 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2024-05-12 12:02:35,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 729 flow [2024-05-12 12:02:35,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-05-12 12:02:35,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-05-12 12:02:35,500 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 485 flow. Second operand 7 states and 111 transitions. [2024-05-12 12:02:35,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 729 flow [2024-05-12 12:02:35,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 677 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:02:35,506 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 508 flow [2024-05-12 12:02:35,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2024-05-12 12:02:35,506 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2024-05-12 12:02:35,507 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 508 flow [2024-05-12 12:02:35,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-05-12 12:02:35,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:35,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:35,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:02:35,507 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:35,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:35,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1050190504, now seen corresponding path program 1 times [2024-05-12 12:02:35,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:35,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961061954] [2024-05-12 12:02:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:41,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-05-12 12:02:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961061954] [2024-05-12 12:02:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961061954] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:41,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:41,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:02:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455044714] [2024-05-12 12:02:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:41,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:02:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:41,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:02:41,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:02:41,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:02:41,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 508 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:41,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:41,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:02:41,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:42,557 INFO L124 PetriNetUnfolderBase]: 540/1064 cut-off events. [2024-05-12 12:02:42,557 INFO L125 PetriNetUnfolderBase]: For 2684/2684 co-relation queries the response was YES. [2024-05-12 12:02:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3837 conditions, 1064 events. 540/1064 cut-off events. For 2684/2684 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5874 event pairs, 137 based on Foata normal form. 2/1024 useless extension candidates. Maximal degree in co-relation 3801. Up to 829 conditions per place. [2024-05-12 12:02:42,563 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 74 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2024-05-12 12:02:42,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 746 flow [2024-05-12 12:02:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-05-12 12:02:42,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-05-12 12:02:42,564 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 508 flow. Second operand 7 states and 118 transitions. [2024-05-12 12:02:42,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 746 flow [2024-05-12 12:02:42,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 709 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 12:02:42,569 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 503 flow [2024-05-12 12:02:42,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=503, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-05-12 12:02:42,570 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2024-05-12 12:02:42,570 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 503 flow [2024-05-12 12:02:42,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:42,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:42,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:42,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:02:42,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:42,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1719440607, now seen corresponding path program 1 times [2024-05-12 12:02:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:42,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285781945] [2024-05-12 12:02:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285781945] [2024-05-12 12:02:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285781945] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:46,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:46,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117925766] [2024-05-12 12:02:46,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:46,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:47,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:02:47,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 503 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 12:02:47,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:47,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:02:47,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:47,482 INFO L124 PetriNetUnfolderBase]: 586/1113 cut-off events. [2024-05-12 12:02:47,483 INFO L125 PetriNetUnfolderBase]: For 3057/3057 co-relation queries the response was YES. [2024-05-12 12:02:47,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4077 conditions, 1113 events. 586/1113 cut-off events. For 3057/3057 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6048 event pairs, 114 based on Foata normal form. 1/1075 useless extension candidates. Maximal degree in co-relation 4040. Up to 665 conditions per place. [2024-05-12 12:02:47,492 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 83 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-05-12 12:02:47,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 112 transitions, 886 flow [2024-05-12 12:02:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-05-12 12:02:47,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-05-12 12:02:47,494 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 503 flow. Second operand 7 states and 132 transitions. [2024-05-12 12:02:47,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 112 transitions, 886 flow [2024-05-12 12:02:47,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 112 transitions, 840 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:02:47,500 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 579 flow [2024-05-12 12:02:47,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=579, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-05-12 12:02:47,500 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-05-12 12:02:47,501 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 579 flow [2024-05-12 12:02:47,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 12:02:47,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:47,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:47,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:02:47,502 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:47,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2114449369, now seen corresponding path program 2 times [2024-05-12 12:02:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93411179] [2024-05-12 12:02:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93411179] [2024-05-12 12:02:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93411179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:51,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453306257] [2024-05-12 12:02:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:51,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:51,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:51,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:51,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:02:51,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 579 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 12:02:51,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:51,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:02:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:52,243 INFO L124 PetriNetUnfolderBase]: 584/1109 cut-off events. [2024-05-12 12:02:52,244 INFO L125 PetriNetUnfolderBase]: For 3400/3400 co-relation queries the response was YES. [2024-05-12 12:02:52,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4282 conditions, 1109 events. 584/1109 cut-off events. For 3400/3400 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6019 event pairs, 119 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 4245. Up to 857 conditions per place. [2024-05-12 12:02:52,250 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 84 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2024-05-12 12:02:52,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 108 transitions, 879 flow [2024-05-12 12:02:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-05-12 12:02:52,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-05-12 12:02:52,251 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 579 flow. Second operand 7 states and 124 transitions. [2024-05-12 12:02:52,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 108 transitions, 879 flow [2024-05-12 12:02:52,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 854 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 12:02:52,258 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 635 flow [2024-05-12 12:02:52,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=635, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2024-05-12 12:02:52,259 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2024-05-12 12:02:52,259 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 635 flow [2024-05-12 12:02:52,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 12:02:52,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:52,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:52,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:02:52,260 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:52,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1629575570, now seen corresponding path program 1 times [2024-05-12 12:02:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128473360] [2024-05-12 12:02:52,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128473360] [2024-05-12 12:02:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128473360] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101731503] [2024-05-12 12:02:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:56,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:56,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:56,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:02:56,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 12:02:56,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:56,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:02:56,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:56,843 INFO L124 PetriNetUnfolderBase]: 587/1044 cut-off events. [2024-05-12 12:02:56,843 INFO L125 PetriNetUnfolderBase]: For 3493/3493 co-relation queries the response was YES. [2024-05-12 12:02:56,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4367 conditions, 1044 events. 587/1044 cut-off events. For 3493/3493 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5396 event pairs, 76 based on Foata normal form. 2/1028 useless extension candidates. Maximal degree in co-relation 4327. Up to 633 conditions per place. [2024-05-12 12:02:56,854 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 77 selfloop transitions, 33 changer transitions 0/117 dead transitions. [2024-05-12 12:02:56,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 117 transitions, 1007 flow [2024-05-12 12:02:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:02:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:02:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-05-12 12:02:56,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2024-05-12 12:02:56,856 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 635 flow. Second operand 6 states and 119 transitions. [2024-05-12 12:02:56,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 117 transitions, 1007 flow [2024-05-12 12:02:56,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 117 transitions, 993 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 12:02:56,869 INFO L231 Difference]: Finished difference. Result has 87 places, 89 transitions, 777 flow [2024-05-12 12:02:56,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=777, PETRI_PLACES=87, PETRI_TRANSITIONS=89} [2024-05-12 12:02:56,870 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-05-12 12:02:56,870 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 777 flow [2024-05-12 12:02:56,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-05-12 12:02:56,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:56,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:56,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:02:56,871 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:02:56,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1629871527, now seen corresponding path program 1 times [2024-05-12 12:02:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640795875] [2024-05-12 12:02:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:01,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:01,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640795875] [2024-05-12 12:03:01,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640795875] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:01,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:01,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:01,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165375749] [2024-05-12 12:03:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:01,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:01,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:01,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:01,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 777 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:01,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:01,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:01,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:01,756 INFO L124 PetriNetUnfolderBase]: 590/1152 cut-off events. [2024-05-12 12:03:01,756 INFO L125 PetriNetUnfolderBase]: For 4908/4908 co-relation queries the response was YES. [2024-05-12 12:03:01,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4955 conditions, 1152 events. 590/1152 cut-off events. For 4908/4908 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6501 event pairs, 151 based on Foata normal form. 1/1109 useless extension candidates. Maximal degree in co-relation 4912. Up to 895 conditions per place. [2024-05-12 12:03:01,762 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 90 selfloop transitions, 17 changer transitions 0/114 dead transitions. [2024-05-12 12:03:01,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 1082 flow [2024-05-12 12:03:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:03:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:03:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-05-12 12:03:01,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-05-12 12:03:01,763 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 777 flow. Second operand 7 states and 120 transitions. [2024-05-12 12:03:01,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 1082 flow [2024-05-12 12:03:01,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 114 transitions, 1050 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-05-12 12:03:01,774 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 818 flow [2024-05-12 12:03:01,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=818, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2024-05-12 12:03:01,775 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2024-05-12 12:03:01,775 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 818 flow [2024-05-12 12:03:01,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:01,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:01,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:01,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:03:01,776 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:01,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1198611876, now seen corresponding path program 1 times [2024-05-12 12:03:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649350411] [2024-05-12 12:03:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:06,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:06,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649350411] [2024-05-12 12:03:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649350411] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:06,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235036959] [2024-05-12 12:03:06,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:06,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:06,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:06,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 818 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:06,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:06,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:06,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:07,093 INFO L124 PetriNetUnfolderBase]: 606/1075 cut-off events. [2024-05-12 12:03:07,093 INFO L125 PetriNetUnfolderBase]: For 5095/5095 co-relation queries the response was YES. [2024-05-12 12:03:07,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4998 conditions, 1075 events. 606/1075 cut-off events. For 5095/5095 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5596 event pairs, 55 based on Foata normal form. 2/1060 useless extension candidates. Maximal degree in co-relation 4953. Up to 702 conditions per place. [2024-05-12 12:03:07,099 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 90 selfloop transitions, 33 changer transitions 0/130 dead transitions. [2024-05-12 12:03:07,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 130 transitions, 1220 flow [2024-05-12 12:03:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-05-12 12:03:07,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-05-12 12:03:07,101 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 818 flow. Second operand 9 states and 156 transitions. [2024-05-12 12:03:07,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 130 transitions, 1220 flow [2024-05-12 12:03:07,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 1184 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 12:03:07,117 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 894 flow [2024-05-12 12:03:07,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=894, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-05-12 12:03:07,118 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-05-12 12:03:07,118 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 894 flow [2024-05-12 12:03:07,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:07,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:07,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:07,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:03:07,119 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:07,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1126216632, now seen corresponding path program 1 times [2024-05-12 12:03:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709704648] [2024-05-12 12:03:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709704648] [2024-05-12 12:03:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709704648] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:11,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185191932] [2024-05-12 12:03:11,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:11,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:11,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:11,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:11,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 894 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:11,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:11,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:11,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:12,221 INFO L124 PetriNetUnfolderBase]: 631/1138 cut-off events. [2024-05-12 12:03:12,221 INFO L125 PetriNetUnfolderBase]: For 5890/5890 co-relation queries the response was YES. [2024-05-12 12:03:12,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5399 conditions, 1138 events. 631/1138 cut-off events. For 5890/5890 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6086 event pairs, 90 based on Foata normal form. 2/1116 useless extension candidates. Maximal degree in co-relation 5352. Up to 519 conditions per place. [2024-05-12 12:03:12,245 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 92 selfloop transitions, 40 changer transitions 0/139 dead transitions. [2024-05-12 12:03:12,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 139 transitions, 1368 flow [2024-05-12 12:03:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-05-12 12:03:12,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-05-12 12:03:12,248 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 894 flow. Second operand 8 states and 152 transitions. [2024-05-12 12:03:12,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 139 transitions, 1368 flow [2024-05-12 12:03:12,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 139 transitions, 1312 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 12:03:12,275 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 994 flow [2024-05-12 12:03:12,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2024-05-12 12:03:12,276 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2024-05-12 12:03:12,276 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 994 flow [2024-05-12 12:03:12,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:12,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:12,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:12,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:03:12,277 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:12,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1126216756, now seen corresponding path program 2 times [2024-05-12 12:03:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:12,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619282894] [2024-05-12 12:03:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:12,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:16,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619282894] [2024-05-12 12:03:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619282894] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:16,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:16,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550480744] [2024-05-12 12:03:16,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:16,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:17,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:17,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 994 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:17,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:17,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:17,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:17,656 INFO L124 PetriNetUnfolderBase]: 647/1142 cut-off events. [2024-05-12 12:03:17,657 INFO L125 PetriNetUnfolderBase]: For 6517/6517 co-relation queries the response was YES. [2024-05-12 12:03:17,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5619 conditions, 1142 events. 647/1142 cut-off events. For 6517/6517 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6035 event pairs, 88 based on Foata normal form. 2/1127 useless extension candidates. Maximal degree in co-relation 5570. Up to 865 conditions per place. [2024-05-12 12:03:17,664 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 94 selfloop transitions, 34 changer transitions 0/135 dead transitions. [2024-05-12 12:03:17,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 1355 flow [2024-05-12 12:03:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-05-12 12:03:17,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-05-12 12:03:17,668 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 994 flow. Second operand 9 states and 156 transitions. [2024-05-12 12:03:17,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 1355 flow [2024-05-12 12:03:17,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 1298 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-05-12 12:03:17,718 INFO L231 Difference]: Finished difference. Result has 108 places, 101 transitions, 1019 flow [2024-05-12 12:03:17,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1019, PETRI_PLACES=108, PETRI_TRANSITIONS=101} [2024-05-12 12:03:17,719 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2024-05-12 12:03:17,719 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 1019 flow [2024-05-12 12:03:17,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:17,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:17,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:17,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:03:17,720 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:17,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1123415472, now seen corresponding path program 2 times [2024-05-12 12:03:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:17,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239563330] [2024-05-12 12:03:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:17,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239563330] [2024-05-12 12:03:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239563330] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:22,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:22,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049582402] [2024-05-12 12:03:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:22,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:22,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:22,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:22,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:22,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 1019 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:22,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:22,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:22,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:22,966 INFO L124 PetriNetUnfolderBase]: 669/1256 cut-off events. [2024-05-12 12:03:22,966 INFO L125 PetriNetUnfolderBase]: For 6622/6622 co-relation queries the response was YES. [2024-05-12 12:03:22,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5936 conditions, 1256 events. 669/1256 cut-off events. For 6622/6622 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7032 event pairs, 119 based on Foata normal form. 2/1215 useless extension candidates. Maximal degree in co-relation 5885. Up to 868 conditions per place. [2024-05-12 12:03:22,973 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 107 selfloop transitions, 21 changer transitions 0/135 dead transitions. [2024-05-12 12:03:22,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 135 transitions, 1395 flow [2024-05-12 12:03:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 12:03:22,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-05-12 12:03:22,975 INFO L175 Difference]: Start difference. First operand has 108 places, 101 transitions, 1019 flow. Second operand 8 states and 145 transitions. [2024-05-12 12:03:22,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 135 transitions, 1395 flow [2024-05-12 12:03:22,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 1318 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:03:22,991 INFO L231 Difference]: Finished difference. Result has 108 places, 103 transitions, 1015 flow [2024-05-12 12:03:22,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1015, PETRI_PLACES=108, PETRI_TRANSITIONS=103} [2024-05-12 12:03:22,991 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2024-05-12 12:03:22,992 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 103 transitions, 1015 flow [2024-05-12 12:03:22,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:22,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:22,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:22,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:03:22,992 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:22,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash 678986910, now seen corresponding path program 3 times [2024-05-12 12:03:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262942017] [2024-05-12 12:03:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:27,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262942017] [2024-05-12 12:03:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262942017] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:27,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652403261] [2024-05-12 12:03:27,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:27,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:27,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:27,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 103 transitions, 1015 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:27,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:27,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:28,429 INFO L124 PetriNetUnfolderBase]: 670/1264 cut-off events. [2024-05-12 12:03:28,429 INFO L125 PetriNetUnfolderBase]: For 6744/6744 co-relation queries the response was YES. [2024-05-12 12:03:28,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5941 conditions, 1264 events. 670/1264 cut-off events. For 6744/6744 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7144 event pairs, 139 based on Foata normal form. 2/1220 useless extension candidates. Maximal degree in co-relation 5890. Up to 978 conditions per place. [2024-05-12 12:03:28,437 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 109 selfloop transitions, 18 changer transitions 0/134 dead transitions. [2024-05-12 12:03:28,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 134 transitions, 1366 flow [2024-05-12 12:03:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-05-12 12:03:28,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 12:03:28,449 INFO L175 Difference]: Start difference. First operand has 108 places, 103 transitions, 1015 flow. Second operand 8 states and 140 transitions. [2024-05-12 12:03:28,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 134 transitions, 1366 flow [2024-05-12 12:03:28,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 1312 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:28,471 INFO L231 Difference]: Finished difference. Result has 110 places, 104 transitions, 1012 flow [2024-05-12 12:03:28,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1012, PETRI_PLACES=110, PETRI_TRANSITIONS=104} [2024-05-12 12:03:28,472 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2024-05-12 12:03:28,472 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 104 transitions, 1012 flow [2024-05-12 12:03:28,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:28,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:28,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:28,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:03:28,473 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:28,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 678987034, now seen corresponding path program 3 times [2024-05-12 12:03:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667521806] [2024-05-12 12:03:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:33,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667521806] [2024-05-12 12:03:33,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667521806] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:33,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:33,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:03:33,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626064623] [2024-05-12 12:03:33,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:33,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:03:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:33,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:03:33,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:03:33,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:03:33,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 104 transitions, 1012 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:33,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:33,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:03:33,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:33,698 INFO L124 PetriNetUnfolderBase]: 581/1118 cut-off events. [2024-05-12 12:03:33,698 INFO L125 PetriNetUnfolderBase]: For 6656/6656 co-relation queries the response was YES. [2024-05-12 12:03:33,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5254 conditions, 1118 events. 581/1118 cut-off events. For 6656/6656 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6473 event pairs, 112 based on Foata normal form. 2/1078 useless extension candidates. Maximal degree in co-relation 5202. Up to 745 conditions per place. [2024-05-12 12:03:33,722 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 102 selfloop transitions, 24 changer transitions 0/134 dead transitions. [2024-05-12 12:03:33,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 134 transitions, 1376 flow [2024-05-12 12:03:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 12:03:33,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-05-12 12:03:33,737 INFO L175 Difference]: Start difference. First operand has 110 places, 104 transitions, 1012 flow. Second operand 8 states and 149 transitions. [2024-05-12 12:03:33,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 134 transitions, 1376 flow [2024-05-12 12:03:33,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 1338 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:33,756 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 1051 flow [2024-05-12 12:03:33,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1051, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2024-05-12 12:03:33,757 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 72 predicate places. [2024-05-12 12:03:33,757 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 1051 flow [2024-05-12 12:03:33,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:33,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:33,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:33,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:03:33,758 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:33,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:33,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1644962708, now seen corresponding path program 4 times [2024-05-12 12:03:33,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861475351] [2024-05-12 12:03:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861475351] [2024-05-12 12:03:38,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861475351] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500344472] [2024-05-12 12:03:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:38,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:38,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:38,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 1051 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:38,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:38,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:38,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:39,093 INFO L124 PetriNetUnfolderBase]: 714/1337 cut-off events. [2024-05-12 12:03:39,093 INFO L125 PetriNetUnfolderBase]: For 7602/7602 co-relation queries the response was YES. [2024-05-12 12:03:39,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6313 conditions, 1337 events. 714/1337 cut-off events. For 7602/7602 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7631 event pairs, 131 based on Foata normal form. 2/1294 useless extension candidates. Maximal degree in co-relation 6260. Up to 886 conditions per place. [2024-05-12 12:03:39,102 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 114 selfloop transitions, 27 changer transitions 0/148 dead transitions. [2024-05-12 12:03:39,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 148 transitions, 1517 flow [2024-05-12 12:03:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-05-12 12:03:39,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2024-05-12 12:03:39,104 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 1051 flow. Second operand 8 states and 155 transitions. [2024-05-12 12:03:39,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 148 transitions, 1517 flow [2024-05-12 12:03:39,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 148 transitions, 1460 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:39,129 INFO L231 Difference]: Finished difference. Result has 114 places, 108 transitions, 1081 flow [2024-05-12 12:03:39,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1081, PETRI_PLACES=114, PETRI_TRANSITIONS=108} [2024-05-12 12:03:39,130 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 74 predicate places. [2024-05-12 12:03:39,130 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 108 transitions, 1081 flow [2024-05-12 12:03:39,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:39,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:39,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:39,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:03:39,131 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:39,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash 683640258, now seen corresponding path program 1 times [2024-05-12 12:03:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:39,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496047562] [2024-05-12 12:03:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496047562] [2024-05-12 12:03:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496047562] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695450294] [2024-05-12 12:03:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:44,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:44,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:44,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:44,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:44,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:44,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 108 transitions, 1081 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:44,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:44,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:44,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:44,844 INFO L124 PetriNetUnfolderBase]: 746/1403 cut-off events. [2024-05-12 12:03:44,845 INFO L125 PetriNetUnfolderBase]: For 8903/8903 co-relation queries the response was YES. [2024-05-12 12:03:44,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6556 conditions, 1403 events. 746/1403 cut-off events. For 8903/8903 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8116 event pairs, 132 based on Foata normal form. 4/1358 useless extension candidates. Maximal degree in co-relation 6502. Up to 979 conditions per place. [2024-05-12 12:03:44,854 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 114 selfloop transitions, 21 changer transitions 0/142 dead transitions. [2024-05-12 12:03:44,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 142 transitions, 1461 flow [2024-05-12 12:03:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 12:03:44,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-05-12 12:03:44,856 INFO L175 Difference]: Start difference. First operand has 114 places, 108 transitions, 1081 flow. Second operand 8 states and 145 transitions. [2024-05-12 12:03:44,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 142 transitions, 1461 flow [2024-05-12 12:03:44,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 142 transitions, 1388 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:44,876 INFO L231 Difference]: Finished difference. Result has 116 places, 110 transitions, 1073 flow [2024-05-12 12:03:44,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1073, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2024-05-12 12:03:44,877 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 76 predicate places. [2024-05-12 12:03:44,877 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 1073 flow [2024-05-12 12:03:44,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:44,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:44,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:44,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:03:44,877 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:44,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1644785078, now seen corresponding path program 5 times [2024-05-12 12:03:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:44,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552305866] [2024-05-12 12:03:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:49,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552305866] [2024-05-12 12:03:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552305866] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:49,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978110041] [2024-05-12 12:03:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:49,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:49,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:49,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:49,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 110 transitions, 1073 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:49,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:49,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:49,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:50,319 INFO L124 PetriNetUnfolderBase]: 790/1475 cut-off events. [2024-05-12 12:03:50,319 INFO L125 PetriNetUnfolderBase]: For 8855/8855 co-relation queries the response was YES. [2024-05-12 12:03:50,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6902 conditions, 1475 events. 790/1475 cut-off events. For 8855/8855 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8592 event pairs, 130 based on Foata normal form. 2/1426 useless extension candidates. Maximal degree in co-relation 6847. Up to 1047 conditions per place. [2024-05-12 12:03:50,328 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 116 selfloop transitions, 23 changer transitions 0/146 dead transitions. [2024-05-12 12:03:50,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 146 transitions, 1502 flow [2024-05-12 12:03:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-05-12 12:03:50,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-05-12 12:03:50,329 INFO L175 Difference]: Start difference. First operand has 116 places, 110 transitions, 1073 flow. Second operand 8 states and 143 transitions. [2024-05-12 12:03:50,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 146 transitions, 1502 flow [2024-05-12 12:03:50,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 146 transitions, 1449 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:50,350 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 1128 flow [2024-05-12 12:03:50,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1128, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2024-05-12 12:03:50,351 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2024-05-12 12:03:50,351 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 1128 flow [2024-05-12 12:03:50,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:50,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:50,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:50,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:03:50,352 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:50,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1008124302, now seen corresponding path program 6 times [2024-05-12 12:03:50,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:50,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911707038] [2024-05-12 12:03:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:55,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911707038] [2024-05-12 12:03:55,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911707038] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:55,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:55,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:55,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553469156] [2024-05-12 12:03:55,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:55,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:55,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:55,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:03:55,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 1128 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:55,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:55,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:03:55,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:56,039 INFO L124 PetriNetUnfolderBase]: 786/1485 cut-off events. [2024-05-12 12:03:56,040 INFO L125 PetriNetUnfolderBase]: For 8722/8722 co-relation queries the response was YES. [2024-05-12 12:03:56,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6848 conditions, 1485 events. 786/1485 cut-off events. For 8722/8722 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8769 event pairs, 138 based on Foata normal form. 2/1432 useless extension candidates. Maximal degree in co-relation 6792. Up to 1041 conditions per place. [2024-05-12 12:03:56,049 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 118 selfloop transitions, 25 changer transitions 0/150 dead transitions. [2024-05-12 12:03:56,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 150 transitions, 1524 flow [2024-05-12 12:03:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-05-12 12:03:56,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-05-12 12:03:56,050 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 1128 flow. Second operand 8 states and 149 transitions. [2024-05-12 12:03:56,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 150 transitions, 1524 flow [2024-05-12 12:03:56,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 150 transitions, 1467 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-05-12 12:03:56,075 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 1126 flow [2024-05-12 12:03:56,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1126, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-05-12 12:03:56,075 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 82 predicate places. [2024-05-12 12:03:56,075 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 1126 flow [2024-05-12 12:03:56,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:56,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:56,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:03:56,076 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:03:56,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 170225770, now seen corresponding path program 2 times [2024-05-12 12:03:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932302009] [2024-05-12 12:03:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:00,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932302009] [2024-05-12 12:04:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932302009] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:00,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486224078] [2024-05-12 12:04:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:00,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:00,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:00,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 1126 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:00,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:00,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:00,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:01,430 INFO L124 PetriNetUnfolderBase]: 802/1544 cut-off events. [2024-05-12 12:04:01,430 INFO L125 PetriNetUnfolderBase]: For 9670/9670 co-relation queries the response was YES. [2024-05-12 12:04:01,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6961 conditions, 1544 events. 802/1544 cut-off events. For 9670/9670 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9318 event pairs, 224 based on Foata normal form. 2/1491 useless extension candidates. Maximal degree in co-relation 6904. Up to 1252 conditions per place. [2024-05-12 12:04:01,441 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 121 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2024-05-12 12:04:01,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 1478 flow [2024-05-12 12:04:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:04:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:04:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-05-12 12:04:01,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2024-05-12 12:04:01,443 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 1126 flow. Second operand 8 states and 133 transitions. [2024-05-12 12:04:01,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 1478 flow [2024-05-12 12:04:01,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 141 transitions, 1427 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 12:04:01,468 INFO L231 Difference]: Finished difference. Result has 125 places, 115 transitions, 1117 flow [2024-05-12 12:04:01,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1117, PETRI_PLACES=125, PETRI_TRANSITIONS=115} [2024-05-12 12:04:01,469 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 85 predicate places. [2024-05-12 12:04:01,469 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 115 transitions, 1117 flow [2024-05-12 12:04:01,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:01,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:01,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:01,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:04:01,470 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:01,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash -613457534, now seen corresponding path program 3 times [2024-05-12 12:04:01,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535520889] [2024-05-12 12:04:01,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:01,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:06,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535520889] [2024-05-12 12:04:06,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535520889] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:06,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:06,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:06,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702846465] [2024-05-12 12:04:06,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:06,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:06,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:06,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:06,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:06,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 115 transitions, 1117 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:06,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:06,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:06,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:06,908 INFO L124 PetriNetUnfolderBase]: 821/1593 cut-off events. [2024-05-12 12:04:06,908 INFO L125 PetriNetUnfolderBase]: For 9925/9925 co-relation queries the response was YES. [2024-05-12 12:04:06,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7042 conditions, 1593 events. 821/1593 cut-off events. For 9925/9925 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9747 event pairs, 227 based on Foata normal form. 2/1536 useless extension candidates. Maximal degree in co-relation 6984. Up to 1267 conditions per place. [2024-05-12 12:04:06,917 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 120 selfloop transitions, 18 changer transitions 0/145 dead transitions. [2024-05-12 12:04:06,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 1517 flow [2024-05-12 12:04:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:04:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:04:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-05-12 12:04:06,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2024-05-12 12:04:06,918 INFO L175 Difference]: Start difference. First operand has 125 places, 115 transitions, 1117 flow. Second operand 8 states and 133 transitions. [2024-05-12 12:04:06,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 1517 flow [2024-05-12 12:04:06,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 145 transitions, 1477 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:04:06,940 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 1202 flow [2024-05-12 12:04:06,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1202, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2024-05-12 12:04:06,941 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-05-12 12:04:06,941 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 1202 flow [2024-05-12 12:04:06,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:06,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:06,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:06,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:04:06,941 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:06,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash -93721402, now seen corresponding path program 7 times [2024-05-12 12:04:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234552671] [2024-05-12 12:04:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:11,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-05-12 12:04:11,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:11,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234552671] [2024-05-12 12:04:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234552671] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:11,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:04:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928986699] [2024-05-12 12:04:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:11,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:04:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:11,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:04:11,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:04:11,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:11,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 1202 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:11,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:11,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:11,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:11,924 INFO L124 PetriNetUnfolderBase]: 841/1452 cut-off events. [2024-05-12 12:04:11,924 INFO L125 PetriNetUnfolderBase]: For 9497/9497 co-relation queries the response was YES. [2024-05-12 12:04:11,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7130 conditions, 1452 events. 841/1452 cut-off events. For 9497/9497 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8075 event pairs, 96 based on Foata normal form. 2/1437 useless extension candidates. Maximal degree in co-relation 7069. Up to 1112 conditions per place. [2024-05-12 12:04:11,934 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 110 selfloop transitions, 47 changer transitions 0/164 dead transitions. [2024-05-12 12:04:11,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 164 transitions, 1720 flow [2024-05-12 12:04:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:04:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:04:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-05-12 12:04:11,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-05-12 12:04:11,935 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 1202 flow. Second operand 8 states and 154 transitions. [2024-05-12 12:04:11,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 164 transitions, 1720 flow [2024-05-12 12:04:11,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 164 transitions, 1675 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 12:04:11,968 INFO L231 Difference]: Finished difference. Result has 136 places, 129 transitions, 1422 flow [2024-05-12 12:04:11,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1422, PETRI_PLACES=136, PETRI_TRANSITIONS=129} [2024-05-12 12:04:11,969 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-05-12 12:04:11,969 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 129 transitions, 1422 flow [2024-05-12 12:04:11,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:11,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:11,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:11,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:04:11,970 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:11,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1013263776, now seen corresponding path program 4 times [2024-05-12 12:04:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070474410] [2024-05-12 12:04:11,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:16,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-05-12 12:04:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:16,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070474410] [2024-05-12 12:04:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070474410] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:16,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738026462] [2024-05-12 12:04:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:16,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:17,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:17,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 129 transitions, 1422 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:17,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:17,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:17,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:17,606 INFO L124 PetriNetUnfolderBase]: 846/1641 cut-off events. [2024-05-12 12:04:17,607 INFO L125 PetriNetUnfolderBase]: For 10690/10690 co-relation queries the response was YES. [2024-05-12 12:04:17,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 1641 events. 846/1641 cut-off events. For 10690/10690 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10196 event pairs, 207 based on Foata normal form. 2/1582 useless extension candidates. Maximal degree in co-relation 7583. Up to 1301 conditions per place. [2024-05-12 12:04:17,620 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 132 selfloop transitions, 20 changer transitions 0/159 dead transitions. [2024-05-12 12:04:17,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 159 transitions, 1822 flow [2024-05-12 12:04:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:04:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:04:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 12:04:17,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-05-12 12:04:17,622 INFO L175 Difference]: Start difference. First operand has 136 places, 129 transitions, 1422 flow. Second operand 8 states and 135 transitions. [2024-05-12 12:04:17,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 159 transitions, 1822 flow [2024-05-12 12:04:17,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 159 transitions, 1767 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 12:04:17,657 INFO L231 Difference]: Finished difference. Result has 142 places, 132 transitions, 1452 flow [2024-05-12 12:04:17,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1452, PETRI_PLACES=142, PETRI_TRANSITIONS=132} [2024-05-12 12:04:17,659 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 102 predicate places. [2024-05-12 12:04:17,660 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 132 transitions, 1452 flow [2024-05-12 12:04:17,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:17,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:17,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:17,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:04:17,660 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:17,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1544592044, now seen corresponding path program 1 times [2024-05-12 12:04:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383638313] [2024-05-12 12:04:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383638313] [2024-05-12 12:04:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383638313] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:17,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:17,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:04:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587192116] [2024-05-12 12:04:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:17,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:04:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:04:17,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:04:17,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:04:17,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 132 transitions, 1452 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:17,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:17,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:04:17,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:18,049 INFO L124 PetriNetUnfolderBase]: 430/945 cut-off events. [2024-05-12 12:04:18,049 INFO L125 PetriNetUnfolderBase]: For 4950/5024 co-relation queries the response was YES. [2024-05-12 12:04:18,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3859 conditions, 945 events. 430/945 cut-off events. For 4950/5024 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5509 event pairs, 98 based on Foata normal form. 91/979 useless extension candidates. Maximal degree in co-relation 3806. Up to 285 conditions per place. [2024-05-12 12:04:18,055 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 60 selfloop transitions, 27 changer transitions 0/112 dead transitions. [2024-05-12 12:04:18,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 112 transitions, 1228 flow [2024-05-12 12:04:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:04:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:04:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-05-12 12:04:18,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-05-12 12:04:18,057 INFO L175 Difference]: Start difference. First operand has 142 places, 132 transitions, 1452 flow. Second operand 4 states and 93 transitions. [2024-05-12 12:04:18,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 112 transitions, 1228 flow [2024-05-12 12:04:18,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 923 flow, removed 22 selfloop flow, removed 32 redundant places. [2024-05-12 12:04:18,074 INFO L231 Difference]: Finished difference. Result has 113 places, 95 transitions, 779 flow [2024-05-12 12:04:18,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=779, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2024-05-12 12:04:18,075 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 73 predicate places. [2024-05-12 12:04:18,075 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 95 transitions, 779 flow [2024-05-12 12:04:18,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:18,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:18,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:18,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:04:18,076 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:18,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1514109827, now seen corresponding path program 1 times [2024-05-12 12:04:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771982218] [2024-05-12 12:04:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771982218] [2024-05-12 12:04:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771982218] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978711071] [2024-05-12 12:04:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:23,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:23,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 95 transitions, 779 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:23,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:23,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:23,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:23,905 INFO L124 PetriNetUnfolderBase]: 832/1692 cut-off events. [2024-05-12 12:04:23,906 INFO L125 PetriNetUnfolderBase]: For 13454/13454 co-relation queries the response was YES. [2024-05-12 12:04:23,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6661 conditions, 1692 events. 832/1692 cut-off events. For 13454/13454 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10491 event pairs, 200 based on Foata normal form. 8/1599 useless extension candidates. Maximal degree in co-relation 6618. Up to 698 conditions per place. [2024-05-12 12:04:23,914 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 103 selfloop transitions, 58 changer transitions 0/169 dead transitions. [2024-05-12 12:04:23,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 169 transitions, 1572 flow [2024-05-12 12:04:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:04:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:04:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-05-12 12:04:23,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-05-12 12:04:23,916 INFO L175 Difference]: Start difference. First operand has 113 places, 95 transitions, 779 flow. Second operand 10 states and 183 transitions. [2024-05-12 12:04:23,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 169 transitions, 1572 flow [2024-05-12 12:04:23,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 169 transitions, 1525 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 12:04:23,942 INFO L231 Difference]: Finished difference. Result has 124 places, 116 transitions, 1105 flow [2024-05-12 12:04:23,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1105, PETRI_PLACES=124, PETRI_TRANSITIONS=116} [2024-05-12 12:04:23,942 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2024-05-12 12:04:23,943 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 116 transitions, 1105 flow [2024-05-12 12:04:23,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:23,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:23,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:23,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:04:23,943 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:23,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1178135903, now seen corresponding path program 2 times [2024-05-12 12:04:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:23,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992047063] [2024-05-12 12:04:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:28,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:28,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992047063] [2024-05-12 12:04:28,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992047063] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615605822] [2024-05-12 12:04:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:28,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:28,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:29,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:29,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 1105 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:29,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:29,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:29,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:29,703 INFO L124 PetriNetUnfolderBase]: 1015/2152 cut-off events. [2024-05-12 12:04:29,703 INFO L125 PetriNetUnfolderBase]: For 19271/19271 co-relation queries the response was YES. [2024-05-12 12:04:29,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 2152 events. 1015/2152 cut-off events. For 19271/19271 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14530 event pairs, 266 based on Foata normal form. 8/2029 useless extension candidates. Maximal degree in co-relation 8705. Up to 686 conditions per place. [2024-05-12 12:04:29,716 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 103 selfloop transitions, 48 changer transitions 0/159 dead transitions. [2024-05-12 12:04:29,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 159 transitions, 1632 flow [2024-05-12 12:04:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 12:04:29,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-05-12 12:04:29,717 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 1105 flow. Second operand 9 states and 161 transitions. [2024-05-12 12:04:29,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 159 transitions, 1632 flow [2024-05-12 12:04:29,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 159 transitions, 1581 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 12:04:29,754 INFO L231 Difference]: Finished difference. Result has 129 places, 116 transitions, 1154 flow [2024-05-12 12:04:29,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1154, PETRI_PLACES=129, PETRI_TRANSITIONS=116} [2024-05-12 12:04:29,755 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-05-12 12:04:29,755 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 116 transitions, 1154 flow [2024-05-12 12:04:29,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:29,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:29,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:29,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:04:29,756 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:29,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash -552980191, now seen corresponding path program 3 times [2024-05-12 12:04:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:29,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167791265] [2024-05-12 12:04:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167791265] [2024-05-12 12:04:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167791265] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48381933] [2024-05-12 12:04:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:34,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:34,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:34,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 116 transitions, 1154 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:34,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:34,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:34,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:35,282 INFO L124 PetriNetUnfolderBase]: 1252/2782 cut-off events. [2024-05-12 12:04:35,282 INFO L125 PetriNetUnfolderBase]: For 29193/29193 co-relation queries the response was YES. [2024-05-12 12:04:35,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10829 conditions, 2782 events. 1252/2782 cut-off events. For 29193/29193 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20979 event pairs, 450 based on Foata normal form. 16/2617 useless extension candidates. Maximal degree in co-relation 10781. Up to 1377 conditions per place. [2024-05-12 12:04:35,298 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 92 selfloop transitions, 56 changer transitions 0/156 dead transitions. [2024-05-12 12:04:35,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 156 transitions, 1663 flow [2024-05-12 12:04:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 12:04:35,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-05-12 12:04:35,300 INFO L175 Difference]: Start difference. First operand has 129 places, 116 transitions, 1154 flow. Second operand 9 states and 163 transitions. [2024-05-12 12:04:35,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 156 transitions, 1663 flow [2024-05-12 12:04:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 156 transitions, 1564 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:04:35,342 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 1172 flow [2024-05-12 12:04:35,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1172, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2024-05-12 12:04:35,343 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 90 predicate places. [2024-05-12 12:04:35,343 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 1172 flow [2024-05-12 12:04:35,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:35,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:35,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:35,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:04:35,344 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:35,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -552976471, now seen corresponding path program 4 times [2024-05-12 12:04:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750030059] [2024-05-12 12:04:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750030059] [2024-05-12 12:04:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750030059] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:40,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:40,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:04:40,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826117920] [2024-05-12 12:04:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:40,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:04:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:04:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:04:40,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:04:40,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 1172 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:40,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:40,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:04:40,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:40,770 INFO L124 PetriNetUnfolderBase]: 934/2229 cut-off events. [2024-05-12 12:04:40,770 INFO L125 PetriNetUnfolderBase]: For 17842/17857 co-relation queries the response was YES. [2024-05-12 12:04:40,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8152 conditions, 2229 events. 934/2229 cut-off events. For 17842/17857 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16873 event pairs, 459 based on Foata normal form. 23/2066 useless extension candidates. Maximal degree in co-relation 8104. Up to 1294 conditions per place. [2024-05-12 12:04:40,784 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 85 selfloop transitions, 46 changer transitions 0/141 dead transitions. [2024-05-12 12:04:40,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 141 transitions, 1524 flow [2024-05-12 12:04:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-05-12 12:04:40,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-05-12 12:04:40,785 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 1172 flow. Second operand 9 states and 155 transitions. [2024-05-12 12:04:40,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 141 transitions, 1524 flow [2024-05-12 12:04:40,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 141 transitions, 1413 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:40,816 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 1159 flow [2024-05-12 12:04:40,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1159, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2024-05-12 12:04:40,817 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-05-12 12:04:40,817 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 1159 flow [2024-05-12 12:04:40,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:40,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:40,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:40,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:04:40,817 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:40,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash -466140511, now seen corresponding path program 5 times [2024-05-12 12:04:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441883857] [2024-05-12 12:04:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441883857] [2024-05-12 12:04:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441883857] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716630854] [2024-05-12 12:04:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:45,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:45,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:45,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 1159 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:45,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:45,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:45,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:46,137 INFO L124 PetriNetUnfolderBase]: 1213/2794 cut-off events. [2024-05-12 12:04:46,137 INFO L125 PetriNetUnfolderBase]: For 14988/14988 co-relation queries the response was YES. [2024-05-12 12:04:46,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9886 conditions, 2794 events. 1213/2794 cut-off events. For 14988/14988 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 21490 event pairs, 618 based on Foata normal form. 10/2608 useless extension candidates. Maximal degree in co-relation 9837. Up to 1857 conditions per place. [2024-05-12 12:04:46,153 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 114 selfloop transitions, 23 changer transitions 0/145 dead transitions. [2024-05-12 12:04:46,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 1542 flow [2024-05-12 12:04:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-05-12 12:04:46,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-05-12 12:04:46,154 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 1159 flow. Second operand 9 states and 150 transitions. [2024-05-12 12:04:46,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 1542 flow [2024-05-12 12:04:46,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 145 transitions, 1454 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:46,195 INFO L231 Difference]: Finished difference. Result has 134 places, 116 transitions, 1123 flow [2024-05-12 12:04:46,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1123, PETRI_PLACES=134, PETRI_TRANSITIONS=116} [2024-05-12 12:04:46,196 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2024-05-12 12:04:46,196 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 116 transitions, 1123 flow [2024-05-12 12:04:46,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:46,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:46,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:46,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:04:46,197 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:46,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1494071501, now seen corresponding path program 6 times [2024-05-12 12:04:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705579601] [2024-05-12 12:04:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:50,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:50,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705579601] [2024-05-12 12:04:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705579601] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:50,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:50,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:04:50,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939745693] [2024-05-12 12:04:50,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:50,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:04:50,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:04:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:04:50,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:04:50,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 116 transitions, 1123 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:50,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:50,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:04:50,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:51,311 INFO L124 PetriNetUnfolderBase]: 1159/2857 cut-off events. [2024-05-12 12:04:51,312 INFO L125 PetriNetUnfolderBase]: For 15494/15512 co-relation queries the response was YES. [2024-05-12 12:04:51,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9707 conditions, 2857 events. 1159/2857 cut-off events. For 15494/15512 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 23724 event pairs, 680 based on Foata normal form. 13/2628 useless extension candidates. Maximal degree in co-relation 9657. Up to 1856 conditions per place. [2024-05-12 12:04:51,328 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 101 selfloop transitions, 29 changer transitions 0/140 dead transitions. [2024-05-12 12:04:51,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 140 transitions, 1471 flow [2024-05-12 12:04:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 12:04:51,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 12:04:51,329 INFO L175 Difference]: Start difference. First operand has 134 places, 116 transitions, 1123 flow. Second operand 9 states and 154 transitions. [2024-05-12 12:04:51,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 140 transitions, 1471 flow [2024-05-12 12:04:51,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 140 transitions, 1429 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:51,366 INFO L231 Difference]: Finished difference. Result has 136 places, 116 transitions, 1145 flow [2024-05-12 12:04:51,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1145, PETRI_PLACES=136, PETRI_TRANSITIONS=116} [2024-05-12 12:04:51,367 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-05-12 12:04:51,367 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 116 transitions, 1145 flow [2024-05-12 12:04:51,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:51,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:51,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:51,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:04:51,368 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:51,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1494075221, now seen corresponding path program 7 times [2024-05-12 12:04:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244822358] [2024-05-12 12:04:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:56,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-05-12 12:04:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244822358] [2024-05-12 12:04:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244822358] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:56,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120189303] [2024-05-12 12:04:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:56,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:56,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:04:56,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 116 transitions, 1145 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:56,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:56,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:04:56,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:57,107 INFO L124 PetriNetUnfolderBase]: 1417/3297 cut-off events. [2024-05-12 12:04:57,107 INFO L125 PetriNetUnfolderBase]: For 15830/15830 co-relation queries the response was YES. [2024-05-12 12:04:57,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11269 conditions, 3297 events. 1417/3297 cut-off events. For 15830/15830 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 26797 event pairs, 696 based on Foata normal form. 8/3096 useless extension candidates. Maximal degree in co-relation 11218. Up to 1723 conditions per place. [2024-05-12 12:04:57,128 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 109 selfloop transitions, 35 changer transitions 0/152 dead transitions. [2024-05-12 12:04:57,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 152 transitions, 1576 flow [2024-05-12 12:04:57,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-05-12 12:04:57,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-05-12 12:04:57,129 INFO L175 Difference]: Start difference. First operand has 136 places, 116 transitions, 1145 flow. Second operand 9 states and 159 transitions. [2024-05-12 12:04:57,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 152 transitions, 1576 flow [2024-05-12 12:04:57,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 152 transitions, 1522 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:57,176 INFO L231 Difference]: Finished difference. Result has 138 places, 116 transitions, 1164 flow [2024-05-12 12:04:57,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1164, PETRI_PLACES=138, PETRI_TRANSITIONS=116} [2024-05-12 12:04:57,176 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-05-12 12:04:57,177 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 116 transitions, 1164 flow [2024-05-12 12:04:57,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:57,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:57,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:57,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:04:57,177 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:04:57,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 545760637, now seen corresponding path program 8 times [2024-05-12 12:04:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665262941] [2024-05-12 12:04:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:02,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:02,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665262941] [2024-05-12 12:05:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665262941] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:02,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:02,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727085257] [2024-05-12 12:05:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:02,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:02,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:05:02,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 116 transitions, 1164 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:02,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:02,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:05:02,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:03,235 INFO L124 PetriNetUnfolderBase]: 1634/3774 cut-off events. [2024-05-12 12:05:03,236 INFO L125 PetriNetUnfolderBase]: For 22732/22732 co-relation queries the response was YES. [2024-05-12 12:05:03,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13105 conditions, 3774 events. 1634/3774 cut-off events. For 22732/22732 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 31662 event pairs, 739 based on Foata normal form. 8/3540 useless extension candidates. Maximal degree in co-relation 13053. Up to 2316 conditions per place. [2024-05-12 12:05:03,262 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 113 selfloop transitions, 38 changer transitions 0/159 dead transitions. [2024-05-12 12:05:03,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 159 transitions, 1697 flow [2024-05-12 12:05:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 12:05:03,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2024-05-12 12:05:03,264 INFO L175 Difference]: Start difference. First operand has 138 places, 116 transitions, 1164 flow. Second operand 9 states and 165 transitions. [2024-05-12 12:05:03,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 159 transitions, 1697 flow [2024-05-12 12:05:03,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 159 transitions, 1628 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:03,322 INFO L231 Difference]: Finished difference. Result has 140 places, 116 transitions, 1174 flow [2024-05-12 12:05:03,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1174, PETRI_PLACES=140, PETRI_TRANSITIONS=116} [2024-05-12 12:05:03,322 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 100 predicate places. [2024-05-12 12:05:03,323 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 116 transitions, 1174 flow [2024-05-12 12:05:03,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:03,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:03,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:03,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:05:03,323 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:03,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1187225687, now seen corresponding path program 9 times [2024-05-12 12:05:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630417428] [2024-05-12 12:05:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:07,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-05-12 12:05:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630417428] [2024-05-12 12:05:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630417428] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:07,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126521095] [2024-05-12 12:05:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:07,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:07,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:05:07,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 116 transitions, 1174 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:07,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:07,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:05:07,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:08,177 INFO L124 PetriNetUnfolderBase]: 1490/3824 cut-off events. [2024-05-12 12:05:08,177 INFO L125 PetriNetUnfolderBase]: For 22809/22824 co-relation queries the response was YES. [2024-05-12 12:05:08,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12754 conditions, 3824 events. 1490/3824 cut-off events. For 22809/22824 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 34684 event pairs, 888 based on Foata normal form. 12/3518 useless extension candidates. Maximal degree in co-relation 12701. Up to 2608 conditions per place. [2024-05-12 12:05:08,203 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 85 selfloop transitions, 50 changer transitions 0/145 dead transitions. [2024-05-12 12:05:08,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 145 transitions, 1548 flow [2024-05-12 12:05:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 12:05:08,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-05-12 12:05:08,204 INFO L175 Difference]: Start difference. First operand has 140 places, 116 transitions, 1174 flow. Second operand 9 states and 163 transitions. [2024-05-12 12:05:08,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 145 transitions, 1548 flow [2024-05-12 12:05:08,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 145 transitions, 1473 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:08,278 INFO L231 Difference]: Finished difference. Result has 142 places, 118 transitions, 1227 flow [2024-05-12 12:05:08,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1227, PETRI_PLACES=142, PETRI_TRANSITIONS=118} [2024-05-12 12:05:08,280 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 102 predicate places. [2024-05-12 12:05:08,280 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 118 transitions, 1227 flow [2024-05-12 12:05:08,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:08,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:08,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:08,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:05:08,281 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:08,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash 545914459, now seen corresponding path program 1 times [2024-05-12 12:05:08,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:08,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286144169] [2024-05-12 12:05:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286144169] [2024-05-12 12:05:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286144169] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:05:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861819879] [2024-05-12 12:05:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:12,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:05:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:12,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:05:12,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:05:12,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:05:12,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 118 transitions, 1227 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:12,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:12,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:05:12,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:13,354 INFO L124 PetriNetUnfolderBase]: 1398/3528 cut-off events. [2024-05-12 12:05:13,354 INFO L125 PetriNetUnfolderBase]: For 16218/16236 co-relation queries the response was YES. [2024-05-12 12:05:13,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 3528 events. 1398/3528 cut-off events. For 16218/16236 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 31269 event pairs, 891 based on Foata normal form. 3/3232 useless extension candidates. Maximal degree in co-relation 12066. Up to 2582 conditions per place. [2024-05-12 12:05:13,377 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 108 selfloop transitions, 22 changer transitions 0/140 dead transitions. [2024-05-12 12:05:13,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 140 transitions, 1565 flow [2024-05-12 12:05:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:05:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:05:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-05-12 12:05:13,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-05-12 12:05:13,378 INFO L175 Difference]: Start difference. First operand has 142 places, 118 transitions, 1227 flow. Second operand 8 states and 139 transitions. [2024-05-12 12:05:13,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 140 transitions, 1565 flow [2024-05-12 12:05:13,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 1459 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:13,441 INFO L231 Difference]: Finished difference. Result has 143 places, 119 transitions, 1179 flow [2024-05-12 12:05:13,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1179, PETRI_PLACES=143, PETRI_TRANSITIONS=119} [2024-05-12 12:05:13,442 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2024-05-12 12:05:13,442 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 119 transitions, 1179 flow [2024-05-12 12:05:13,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:13,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:13,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:13,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:05:13,443 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:13,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash 551478649, now seen corresponding path program 2 times [2024-05-12 12:05:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369884151] [2024-05-12 12:05:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:18,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:18,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369884151] [2024-05-12 12:05:18,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369884151] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:18,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056986965] [2024-05-12 12:05:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:18,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:18,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:18,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:18,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:05:18,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 119 transitions, 1179 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:18,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:18,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:05:18,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:19,398 INFO L124 PetriNetUnfolderBase]: 1623/3885 cut-off events. [2024-05-12 12:05:19,399 INFO L125 PetriNetUnfolderBase]: For 16632/16632 co-relation queries the response was YES. [2024-05-12 12:05:19,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13194 conditions, 3885 events. 1623/3885 cut-off events. For 16632/16632 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 33368 event pairs, 932 based on Foata normal form. 2/3607 useless extension candidates. Maximal degree in co-relation 13139. Up to 2926 conditions per place. [2024-05-12 12:05:19,428 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 114 selfloop transitions, 20 changer transitions 0/142 dead transitions. [2024-05-12 12:05:19,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 142 transitions, 1533 flow [2024-05-12 12:05:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:05:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:05:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-05-12 12:05:19,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548611111111111 [2024-05-12 12:05:19,430 INFO L175 Difference]: Start difference. First operand has 143 places, 119 transitions, 1179 flow. Second operand 8 states and 131 transitions. [2024-05-12 12:05:19,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 142 transitions, 1533 flow [2024-05-12 12:05:19,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 1485 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 12:05:19,508 INFO L231 Difference]: Finished difference. Result has 145 places, 120 transitions, 1187 flow [2024-05-12 12:05:19,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1187, PETRI_PLACES=145, PETRI_TRANSITIONS=120} [2024-05-12 12:05:19,509 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 105 predicate places. [2024-05-12 12:05:19,509 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 120 transitions, 1187 flow [2024-05-12 12:05:19,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:19,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:19,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:19,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:05:19,510 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:19,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1187081537, now seen corresponding path program 10 times [2024-05-12 12:05:19,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:19,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737823142] [2024-05-12 12:05:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:19,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737823142] [2024-05-12 12:05:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737823142] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:24,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:24,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322661256] [2024-05-12 12:05:24,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:24,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:24,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:24,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:24,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:24,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:05:24,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 120 transitions, 1187 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:24,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:24,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:05:24,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:25,119 INFO L124 PetriNetUnfolderBase]: 1515/3866 cut-off events. [2024-05-12 12:05:25,119 INFO L125 PetriNetUnfolderBase]: For 22610/22627 co-relation queries the response was YES. [2024-05-12 12:05:25,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12837 conditions, 3866 events. 1515/3866 cut-off events. For 22610/22627 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 35089 event pairs, 975 based on Foata normal form. 11/3552 useless extension candidates. Maximal degree in co-relation 12781. Up to 2596 conditions per place. [2024-05-12 12:05:25,145 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 112 selfloop transitions, 25 changer transitions 0/147 dead transitions. [2024-05-12 12:05:25,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 147 transitions, 1563 flow [2024-05-12 12:05:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-05-12 12:05:25,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-05-12 12:05:25,149 INFO L175 Difference]: Start difference. First operand has 145 places, 120 transitions, 1187 flow. Second operand 9 states and 156 transitions. [2024-05-12 12:05:25,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 147 transitions, 1563 flow [2024-05-12 12:05:25,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 1517 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:05:25,228 INFO L231 Difference]: Finished difference. Result has 148 places, 120 transitions, 1197 flow [2024-05-12 12:05:25,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1197, PETRI_PLACES=148, PETRI_TRANSITIONS=120} [2024-05-12 12:05:25,228 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 108 predicate places. [2024-05-12 12:05:25,229 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 120 transitions, 1197 flow [2024-05-12 12:05:25,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:25,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:25,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:25,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:05:25,229 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:25,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1181503955, now seen corresponding path program 3 times [2024-05-12 12:05:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:25,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648856251] [2024-05-12 12:05:25,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:25,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648856251] [2024-05-12 12:05:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648856251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649075632] [2024-05-12 12:05:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:30,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:30,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:05:30,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 120 transitions, 1197 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:30,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:30,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:05:30,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:31,103 INFO L124 PetriNetUnfolderBase]: 1756/4239 cut-off events. [2024-05-12 12:05:31,104 INFO L125 PetriNetUnfolderBase]: For 18420/18420 co-relation queries the response was YES. [2024-05-12 12:05:31,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14200 conditions, 4239 events. 1756/4239 cut-off events. For 18420/18420 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 37258 event pairs, 981 based on Foata normal form. 2/3938 useless extension candidates. Maximal degree in co-relation 14143. Up to 3064 conditions per place. [2024-05-12 12:05:31,133 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 115 selfloop transitions, 23 changer transitions 0/146 dead transitions. [2024-05-12 12:05:31,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 146 transitions, 1575 flow [2024-05-12 12:05:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:05:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:05:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 12:05:31,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-05-12 12:05:31,135 INFO L175 Difference]: Start difference. First operand has 148 places, 120 transitions, 1197 flow. Second operand 8 states and 134 transitions. [2024-05-12 12:05:31,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 146 transitions, 1575 flow [2024-05-12 12:05:31,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 146 transitions, 1529 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:31,214 INFO L231 Difference]: Finished difference. Result has 149 places, 121 transitions, 1216 flow [2024-05-12 12:05:31,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1216, PETRI_PLACES=149, PETRI_TRANSITIONS=121} [2024-05-12 12:05:31,214 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 109 predicate places. [2024-05-12 12:05:31,215 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 121 transitions, 1216 flow [2024-05-12 12:05:31,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:31,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:31,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:31,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:05:31,215 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:31,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash -282202993, now seen corresponding path program 11 times [2024-05-12 12:05:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:31,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989450501] [2024-05-12 12:05:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:31,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:36,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989450501] [2024-05-12 12:05:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989450501] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:36,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:36,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467146006] [2024-05-12 12:05:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:36,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:36,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:36,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:36,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:05:36,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 121 transitions, 1216 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:36,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:36,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:05:36,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:37,199 INFO L124 PetriNetUnfolderBase]: 1872/4569 cut-off events. [2024-05-12 12:05:37,200 INFO L125 PetriNetUnfolderBase]: For 25730/25730 co-relation queries the response was YES. [2024-05-12 12:05:37,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15207 conditions, 4569 events. 1872/4569 cut-off events. For 25730/25730 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 41087 event pairs, 1093 based on Foata normal form. 10/4249 useless extension candidates. Maximal degree in co-relation 15149. Up to 3182 conditions per place. [2024-05-12 12:05:37,234 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 119 selfloop transitions, 23 changer transitions 0/150 dead transitions. [2024-05-12 12:05:37,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 150 transitions, 1613 flow [2024-05-12 12:05:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-05-12 12:05:37,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2024-05-12 12:05:37,235 INFO L175 Difference]: Start difference. First operand has 149 places, 121 transitions, 1216 flow. Second operand 9 states and 148 transitions. [2024-05-12 12:05:37,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 150 transitions, 1613 flow [2024-05-12 12:05:37,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 150 transitions, 1560 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:05:37,322 INFO L231 Difference]: Finished difference. Result has 152 places, 121 transitions, 1215 flow [2024-05-12 12:05:37,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1215, PETRI_PLACES=152, PETRI_TRANSITIONS=121} [2024-05-12 12:05:37,323 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 112 predicate places. [2024-05-12 12:05:37,323 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 121 transitions, 1215 flow [2024-05-12 12:05:37,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:37,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:37,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:37,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:05:37,326 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:37,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1640709373, now seen corresponding path program 4 times [2024-05-12 12:05:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:37,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445540764] [2024-05-12 12:05:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:42,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445540764] [2024-05-12 12:05:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445540764] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:42,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255647352] [2024-05-12 12:05:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:42,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:42,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:05:42,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 121 transitions, 1215 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:42,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:42,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:05:42,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:43,210 INFO L124 PetriNetUnfolderBase]: 1889/4608 cut-off events. [2024-05-12 12:05:43,210 INFO L125 PetriNetUnfolderBase]: For 20357/20357 co-relation queries the response was YES. [2024-05-12 12:05:43,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15290 conditions, 4608 events. 1889/4608 cut-off events. For 20357/20357 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 41582 event pairs, 1077 based on Foata normal form. 2/4275 useless extension candidates. Maximal degree in co-relation 15231. Up to 3377 conditions per place. [2024-05-12 12:05:43,240 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 106 selfloop transitions, 31 changer transitions 0/145 dead transitions. [2024-05-12 12:05:43,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 145 transitions, 1583 flow [2024-05-12 12:05:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:05:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:05:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-05-12 12:05:43,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2024-05-12 12:05:43,243 INFO L175 Difference]: Start difference. First operand has 152 places, 121 transitions, 1215 flow. Second operand 7 states and 125 transitions. [2024-05-12 12:05:43,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 145 transitions, 1583 flow [2024-05-12 12:05:43,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 1541 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:05:43,323 INFO L231 Difference]: Finished difference. Result has 152 places, 122 transitions, 1259 flow [2024-05-12 12:05:43,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1259, PETRI_PLACES=152, PETRI_TRANSITIONS=122} [2024-05-12 12:05:43,324 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 112 predicate places. [2024-05-12 12:05:43,324 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 122 transitions, 1259 flow [2024-05-12 12:05:43,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:43,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:43,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:43,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:05:43,325 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:43,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1640701933, now seen corresponding path program 5 times [2024-05-12 12:05:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720627051] [2024-05-12 12:05:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:48,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720627051] [2024-05-12 12:05:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720627051] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:48,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:48,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906021889] [2024-05-12 12:05:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:48,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:48,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:05:48,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 122 transitions, 1259 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:48,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:48,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:05:48,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:49,393 INFO L124 PetriNetUnfolderBase]: 1906/4643 cut-off events. [2024-05-12 12:05:49,394 INFO L125 PetriNetUnfolderBase]: For 21511/21511 co-relation queries the response was YES. [2024-05-12 12:05:49,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15616 conditions, 4643 events. 1906/4643 cut-off events. For 21511/21511 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 42007 event pairs, 1060 based on Foata normal form. 2/4312 useless extension candidates. Maximal degree in co-relation 15556. Up to 3244 conditions per place. [2024-05-12 12:05:49,426 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 109 selfloop transitions, 29 changer transitions 0/146 dead transitions. [2024-05-12 12:05:49,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 146 transitions, 1635 flow [2024-05-12 12:05:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:05:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:05:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-05-12 12:05:49,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-05-12 12:05:49,428 INFO L175 Difference]: Start difference. First operand has 152 places, 122 transitions, 1259 flow. Second operand 7 states and 123 transitions. [2024-05-12 12:05:49,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 146 transitions, 1635 flow [2024-05-12 12:05:49,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 146 transitions, 1559 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 12:05:49,536 INFO L231 Difference]: Finished difference. Result has 154 places, 123 transitions, 1266 flow [2024-05-12 12:05:49,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1266, PETRI_PLACES=154, PETRI_TRANSITIONS=123} [2024-05-12 12:05:49,537 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2024-05-12 12:05:49,537 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 123 transitions, 1266 flow [2024-05-12 12:05:49,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:49,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:49,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:49,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:05:49,538 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:49,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1640917135, now seen corresponding path program 12 times [2024-05-12 12:05:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957511213] [2024-05-12 12:05:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957511213] [2024-05-12 12:05:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957511213] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551297989] [2024-05-12 12:05:54,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:54,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:54,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:54,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:54,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:54,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:05:54,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 123 transitions, 1266 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:54,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:54,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:05:54,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:55,446 INFO L124 PetriNetUnfolderBase]: 1917/4542 cut-off events. [2024-05-12 12:05:55,447 INFO L125 PetriNetUnfolderBase]: For 20790/20790 co-relation queries the response was YES. [2024-05-12 12:05:55,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15397 conditions, 4542 events. 1917/4542 cut-off events. For 20790/20790 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 40270 event pairs, 910 based on Foata normal form. 6/4243 useless extension candidates. Maximal degree in co-relation 15336. Up to 3300 conditions per place. [2024-05-12 12:05:55,476 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 113 selfloop transitions, 35 changer transitions 0/156 dead transitions. [2024-05-12 12:05:55,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 1689 flow [2024-05-12 12:05:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:05:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:05:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-05-12 12:05:55,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-05-12 12:05:55,478 INFO L175 Difference]: Start difference. First operand has 154 places, 123 transitions, 1266 flow. Second operand 8 states and 148 transitions. [2024-05-12 12:05:55,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 1689 flow [2024-05-12 12:05:55,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 156 transitions, 1624 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:05:55,575 INFO L231 Difference]: Finished difference. Result has 157 places, 125 transitions, 1308 flow [2024-05-12 12:05:55,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1308, PETRI_PLACES=157, PETRI_TRANSITIONS=125} [2024-05-12 12:05:55,576 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 117 predicate places. [2024-05-12 12:05:55,576 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 125 transitions, 1308 flow [2024-05-12 12:05:55,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:55,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:55,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:55,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:05:55,577 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:05:55,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1346405293, now seen corresponding path program 6 times [2024-05-12 12:05:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:55,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635962821] [2024-05-12 12:05:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:00,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:00,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635962821] [2024-05-12 12:06:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635962821] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788856010] [2024-05-12 12:06:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:00,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:00,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:00,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:00,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:00,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 125 transitions, 1308 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:00,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:00,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:00,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:01,328 INFO L124 PetriNetUnfolderBase]: 1918/4678 cut-off events. [2024-05-12 12:06:01,328 INFO L125 PetriNetUnfolderBase]: For 17859/17859 co-relation queries the response was YES. [2024-05-12 12:06:01,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15922 conditions, 4678 events. 1918/4678 cut-off events. For 17859/17859 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 42363 event pairs, 1153 based on Foata normal form. 2/4358 useless extension candidates. Maximal degree in co-relation 15860. Up to 3557 conditions per place. [2024-05-12 12:06:01,362 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 128 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2024-05-12 12:06:01,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 147 transitions, 1676 flow [2024-05-12 12:06:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:06:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:06:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-05-12 12:06:01,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-05-12 12:06:01,363 INFO L175 Difference]: Start difference. First operand has 157 places, 125 transitions, 1308 flow. Second operand 7 states and 117 transitions. [2024-05-12 12:06:01,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 147 transitions, 1676 flow [2024-05-12 12:06:01,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 147 transitions, 1594 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-05-12 12:06:01,451 INFO L231 Difference]: Finished difference. Result has 157 places, 126 transitions, 1266 flow [2024-05-12 12:06:01,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1266, PETRI_PLACES=157, PETRI_TRANSITIONS=126} [2024-05-12 12:06:01,452 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 117 predicate places. [2024-05-12 12:06:01,452 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 126 transitions, 1266 flow [2024-05-12 12:06:01,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:01,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:01,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:01,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:06:01,453 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:01,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1855957897, now seen corresponding path program 1 times [2024-05-12 12:06:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234931520] [2024-05-12 12:06:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:07,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234931520] [2024-05-12 12:06:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234931520] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:06:07,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002608299] [2024-05-12 12:06:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:07,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:06:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:06:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:06:07,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:07,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 126 transitions, 1266 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-05-12 12:06:07,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:07,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:07,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:08,384 INFO L124 PetriNetUnfolderBase]: 1955/4742 cut-off events. [2024-05-12 12:06:08,385 INFO L125 PetriNetUnfolderBase]: For 20511/20511 co-relation queries the response was YES. [2024-05-12 12:06:08,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15794 conditions, 4742 events. 1955/4742 cut-off events. For 20511/20511 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 43007 event pairs, 1134 based on Foata normal form. 6/4407 useless extension candidates. Maximal degree in co-relation 15732. Up to 3480 conditions per place. [2024-05-12 12:06:08,422 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 127 selfloop transitions, 21 changer transitions 0/156 dead transitions. [2024-05-12 12:06:08,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 156 transitions, 1674 flow [2024-05-12 12:06:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:06:08,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 12:06:08,423 INFO L175 Difference]: Start difference. First operand has 157 places, 126 transitions, 1266 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:06:08,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 156 transitions, 1674 flow [2024-05-12 12:06:08,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1644 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 12:06:08,512 INFO L231 Difference]: Finished difference. Result has 161 places, 126 transitions, 1281 flow [2024-05-12 12:06:08,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1281, PETRI_PLACES=161, PETRI_TRANSITIONS=126} [2024-05-12 12:06:08,513 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 121 predicate places. [2024-05-12 12:06:08,513 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 126 transitions, 1281 flow [2024-05-12 12:06:08,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-05-12 12:06:08,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:08,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:08,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:06:08,514 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:08,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1855363251, now seen corresponding path program 2 times [2024-05-12 12:06:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:08,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204301555] [2024-05-12 12:06:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204301555] [2024-05-12 12:06:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204301555] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:14,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:14,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100257690] [2024-05-12 12:06:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:14,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:14,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:14,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 126 transitions, 1281 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:14,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:14,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:14,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:15,216 INFO L124 PetriNetUnfolderBase]: 1972/4797 cut-off events. [2024-05-12 12:06:15,217 INFO L125 PetriNetUnfolderBase]: For 17880/17880 co-relation queries the response was YES. [2024-05-12 12:06:15,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15951 conditions, 4797 events. 1972/4797 cut-off events. For 17880/17880 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 43722 event pairs, 1183 based on Foata normal form. 2/4451 useless extension candidates. Maximal degree in co-relation 15888. Up to 3594 conditions per place. [2024-05-12 12:06:15,252 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 128 selfloop transitions, 23 changer transitions 0/159 dead transitions. [2024-05-12 12:06:15,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 159 transitions, 1707 flow [2024-05-12 12:06:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-05-12 12:06:15,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 12:06:15,253 INFO L175 Difference]: Start difference. First operand has 161 places, 126 transitions, 1281 flow. Second operand 9 states and 153 transitions. [2024-05-12 12:06:15,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 159 transitions, 1707 flow [2024-05-12 12:06:15,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 1666 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:06:15,362 INFO L231 Difference]: Finished difference. Result has 163 places, 127 transitions, 1302 flow [2024-05-12 12:06:15,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1302, PETRI_PLACES=163, PETRI_TRANSITIONS=127} [2024-05-12 12:06:15,363 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 123 predicate places. [2024-05-12 12:06:15,363 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 127 transitions, 1302 flow [2024-05-12 12:06:15,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:15,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:15,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:15,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:06:15,363 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:15,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2027853141, now seen corresponding path program 3 times [2024-05-12 12:06:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773605686] [2024-05-12 12:06:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:20,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-05-12 12:06:20,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:20,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773605686] [2024-05-12 12:06:20,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773605686] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:20,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:20,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539766232] [2024-05-12 12:06:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:20,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:20,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:20,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:20,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:20,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:20,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 127 transitions, 1302 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:20,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:20,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:20,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:21,911 INFO L124 PetriNetUnfolderBase]: 2009/4903 cut-off events. [2024-05-12 12:06:21,911 INFO L125 PetriNetUnfolderBase]: For 22412/22412 co-relation queries the response was YES. [2024-05-12 12:06:21,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16441 conditions, 4903 events. 2009/4903 cut-off events. For 22412/22412 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 44993 event pairs, 1175 based on Foata normal form. 6/4555 useless extension candidates. Maximal degree in co-relation 16377. Up to 3611 conditions per place. [2024-05-12 12:06:21,946 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 129 selfloop transitions, 20 changer transitions 0/157 dead transitions. [2024-05-12 12:06:21,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 157 transitions, 1714 flow [2024-05-12 12:06:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-05-12 12:06:21,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2024-05-12 12:06:21,947 INFO L175 Difference]: Start difference. First operand has 163 places, 127 transitions, 1302 flow. Second operand 9 states and 148 transitions. [2024-05-12 12:06:21,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 157 transitions, 1714 flow [2024-05-12 12:06:22,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 157 transitions, 1662 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 12:06:22,067 INFO L231 Difference]: Finished difference. Result has 165 places, 127 transitions, 1293 flow [2024-05-12 12:06:22,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1293, PETRI_PLACES=165, PETRI_TRANSITIONS=127} [2024-05-12 12:06:22,067 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 125 predicate places. [2024-05-12 12:06:22,068 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 127 transitions, 1293 flow [2024-05-12 12:06:22,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:22,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:22,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:22,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:06:22,068 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:22,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2028083781, now seen corresponding path program 4 times [2024-05-12 12:06:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:22,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819184572] [2024-05-12 12:06:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:27,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-05-12 12:06:27,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:27,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819184572] [2024-05-12 12:06:27,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819184572] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:27,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:27,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:06:27,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044683601] [2024-05-12 12:06:27,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:27,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:06:27,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:06:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:06:27,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:27,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 127 transitions, 1293 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-05-12 12:06:27,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:27,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:27,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:28,559 INFO L124 PetriNetUnfolderBase]: 2046/4980 cut-off events. [2024-05-12 12:06:28,560 INFO L125 PetriNetUnfolderBase]: For 23107/23107 co-relation queries the response was YES. [2024-05-12 12:06:28,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16648 conditions, 4980 events. 2046/4980 cut-off events. For 23107/23107 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 45825 event pairs, 1170 based on Foata normal form. 6/4638 useless extension candidates. Maximal degree in co-relation 16583. Up to 3561 conditions per place. [2024-05-12 12:06:28,601 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 129 selfloop transitions, 23 changer transitions 0/160 dead transitions. [2024-05-12 12:06:28,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 160 transitions, 1725 flow [2024-05-12 12:06:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:06:28,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 12:06:28,603 INFO L175 Difference]: Start difference. First operand has 165 places, 127 transitions, 1293 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:06:28,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 160 transitions, 1725 flow [2024-05-12 12:06:28,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 1686 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:06:28,725 INFO L231 Difference]: Finished difference. Result has 167 places, 127 transitions, 1303 flow [2024-05-12 12:06:28,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1303, PETRI_PLACES=167, PETRI_TRANSITIONS=127} [2024-05-12 12:06:28,726 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 127 predicate places. [2024-05-12 12:06:28,726 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 127 transitions, 1303 flow [2024-05-12 12:06:28,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-05-12 12:06:28,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:28,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:28,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:06:28,727 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:28,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:28,727 INFO L85 PathProgramCache]: Analyzing trace with hash 677617711, now seen corresponding path program 5 times [2024-05-12 12:06:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918786200] [2024-05-12 12:06:28,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918786200] [2024-05-12 12:06:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918786200] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:33,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:33,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424577760] [2024-05-12 12:06:33,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:33,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:33,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:33,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:33,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 127 transitions, 1303 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:33,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:33,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:33,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:34,836 INFO L124 PetriNetUnfolderBase]: 2083/5090 cut-off events. [2024-05-12 12:06:34,837 INFO L125 PetriNetUnfolderBase]: For 24049/24049 co-relation queries the response was YES. [2024-05-12 12:06:34,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17021 conditions, 5090 events. 2083/5090 cut-off events. For 24049/24049 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 47236 event pairs, 1334 based on Foata normal form. 6/4734 useless extension candidates. Maximal degree in co-relation 16955. Up to 3787 conditions per place. [2024-05-12 12:06:34,868 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 127 selfloop transitions, 23 changer transitions 0/158 dead transitions. [2024-05-12 12:06:34,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 158 transitions, 1721 flow [2024-05-12 12:06:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:06:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:06:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 12:06:34,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-05-12 12:06:34,870 INFO L175 Difference]: Start difference. First operand has 167 places, 127 transitions, 1303 flow. Second operand 8 states and 142 transitions. [2024-05-12 12:06:34,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 158 transitions, 1721 flow [2024-05-12 12:06:34,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 158 transitions, 1676 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:06:34,978 INFO L231 Difference]: Finished difference. Result has 168 places, 127 transitions, 1307 flow [2024-05-12 12:06:34,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1307, PETRI_PLACES=168, PETRI_TRANSITIONS=127} [2024-05-12 12:06:34,979 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-05-12 12:06:34,979 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 127 transitions, 1307 flow [2024-05-12 12:06:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:34,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:34,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:34,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 12:06:34,980 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:34,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash 677848351, now seen corresponding path program 6 times [2024-05-12 12:06:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:34,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372385481] [2024-05-12 12:06:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:40,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:40,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372385481] [2024-05-12 12:06:40,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372385481] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:40,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:40,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:40,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14828257] [2024-05-12 12:06:40,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:40,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:40,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:40,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 127 transitions, 1307 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:40,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:40,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:40,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:41,560 INFO L124 PetriNetUnfolderBase]: 2120/5192 cut-off events. [2024-05-12 12:06:41,560 INFO L125 PetriNetUnfolderBase]: For 24559/24559 co-relation queries the response was YES. [2024-05-12 12:06:41,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17271 conditions, 5192 events. 2120/5192 cut-off events. For 24559/24559 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 48432 event pairs, 1325 based on Foata normal form. 6/4833 useless extension candidates. Maximal degree in co-relation 17204. Up to 3810 conditions per place. [2024-05-12 12:06:41,591 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 131 selfloop transitions, 19 changer transitions 0/158 dead transitions. [2024-05-12 12:06:41,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 158 transitions, 1729 flow [2024-05-12 12:06:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:06:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:06:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-05-12 12:06:41,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 12:06:41,592 INFO L175 Difference]: Start difference. First operand has 168 places, 127 transitions, 1307 flow. Second operand 8 states and 140 transitions. [2024-05-12 12:06:41,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 158 transitions, 1729 flow [2024-05-12 12:06:41,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 158 transitions, 1672 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:06:41,705 INFO L231 Difference]: Finished difference. Result has 168 places, 127 transitions, 1291 flow [2024-05-12 12:06:41,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1291, PETRI_PLACES=168, PETRI_TRANSITIONS=127} [2024-05-12 12:06:41,706 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-05-12 12:06:41,706 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 127 transitions, 1291 flow [2024-05-12 12:06:41,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:41,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:41,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 12:06:41,707 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:41,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1799711667, now seen corresponding path program 7 times [2024-05-12 12:06:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767988063] [2024-05-12 12:06:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767988063] [2024-05-12 12:06:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767988063] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:46,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:46,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220694814] [2024-05-12 12:06:46,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:46,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:46,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:46,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:46,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 127 transitions, 1291 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:46,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:46,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:46,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:48,154 INFO L124 PetriNetUnfolderBase]: 2137/5245 cut-off events. [2024-05-12 12:06:48,154 INFO L125 PetriNetUnfolderBase]: For 22999/22999 co-relation queries the response was YES. [2024-05-12 12:06:48,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17248 conditions, 5245 events. 2137/5245 cut-off events. For 22999/22999 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 49062 event pairs, 1343 based on Foata normal form. 6/4903 useless extension candidates. Maximal degree in co-relation 17182. Up to 3907 conditions per place. [2024-05-12 12:06:48,194 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 136 selfloop transitions, 13 changer transitions 0/157 dead transitions. [2024-05-12 12:06:48,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 157 transitions, 1707 flow [2024-05-12 12:06:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:06:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:06:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 12:06:48,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-05-12 12:06:48,196 INFO L175 Difference]: Start difference. First operand has 168 places, 127 transitions, 1291 flow. Second operand 8 states and 134 transitions. [2024-05-12 12:06:48,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 157 transitions, 1707 flow [2024-05-12 12:06:48,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 157 transitions, 1662 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 12:06:48,328 INFO L231 Difference]: Finished difference. Result has 169 places, 127 transitions, 1276 flow [2024-05-12 12:06:48,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1276, PETRI_PLACES=169, PETRI_TRANSITIONS=127} [2024-05-12 12:06:48,329 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 129 predicate places. [2024-05-12 12:06:48,329 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 127 transitions, 1276 flow [2024-05-12 12:06:48,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:48,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:48,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:48,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 12:06:48,330 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:48,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1537588766, now seen corresponding path program 1 times [2024-05-12 12:06:48,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:48,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078817529] [2024-05-12 12:06:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:54,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-05-12 12:06:54,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078817529] [2024-05-12 12:06:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078817529] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:54,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:54,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:06:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894965448] [2024-05-12 12:06:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:54,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:06:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:06:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:06:54,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:06:54,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 127 transitions, 1276 flow. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:54,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:54,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:06:54,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:55,775 INFO L124 PetriNetUnfolderBase]: 2169/5356 cut-off events. [2024-05-12 12:06:55,775 INFO L125 PetriNetUnfolderBase]: For 21418/21418 co-relation queries the response was YES. [2024-05-12 12:06:55,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17410 conditions, 5356 events. 2169/5356 cut-off events. For 21418/21418 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 50521 event pairs, 1306 based on Foata normal form. 4/4991 useless extension candidates. Maximal degree in co-relation 17344. Up to 3772 conditions per place. [2024-05-12 12:06:55,813 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 122 selfloop transitions, 38 changer transitions 0/168 dead transitions. [2024-05-12 12:06:55,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 168 transitions, 1740 flow [2024-05-12 12:06:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:06:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:06:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 12:06:55,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 12:06:55,814 INFO L175 Difference]: Start difference. First operand has 169 places, 127 transitions, 1276 flow. Second operand 10 states and 175 transitions. [2024-05-12 12:06:55,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 168 transitions, 1740 flow [2024-05-12 12:06:55,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 168 transitions, 1684 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 12:06:55,937 INFO L231 Difference]: Finished difference. Result has 174 places, 127 transitions, 1300 flow [2024-05-12 12:06:55,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1300, PETRI_PLACES=174, PETRI_TRANSITIONS=127} [2024-05-12 12:06:55,938 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 134 predicate places. [2024-05-12 12:06:55,938 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 127 transitions, 1300 flow [2024-05-12 12:06:55,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:55,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:55,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:55,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 12:06:55,939 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:06:55,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1157798466, now seen corresponding path program 2 times [2024-05-12 12:06:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345140561] [2024-05-12 12:06:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:01,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345140561] [2024-05-12 12:07:01,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345140561] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:01,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:01,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:07:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729658952] [2024-05-12 12:07:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:01,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:07:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:01,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:07:01,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:07:01,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:07:01,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 127 transitions, 1300 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:01,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:01,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:07:01,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:02,689 INFO L124 PetriNetUnfolderBase]: 1883/4914 cut-off events. [2024-05-12 12:07:02,690 INFO L125 PetriNetUnfolderBase]: For 21294/21312 co-relation queries the response was YES. [2024-05-12 12:07:02,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15890 conditions, 4914 events. 1883/4914 cut-off events. For 21294/21312 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 48024 event pairs, 1336 based on Foata normal form. 5/4511 useless extension candidates. Maximal degree in co-relation 15824. Up to 3543 conditions per place. [2024-05-12 12:07:02,729 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 126 selfloop transitions, 23 changer transitions 0/159 dead transitions. [2024-05-12 12:07:02,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 159 transitions, 1710 flow [2024-05-12 12:07:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:07:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:07:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 12:07:02,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 12:07:02,731 INFO L175 Difference]: Start difference. First operand has 174 places, 127 transitions, 1300 flow. Second operand 10 states and 171 transitions. [2024-05-12 12:07:02,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 159 transitions, 1710 flow [2024-05-12 12:07:02,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 159 transitions, 1619 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 12:07:02,859 INFO L231 Difference]: Finished difference. Result has 175 places, 127 transitions, 1258 flow [2024-05-12 12:07:02,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1258, PETRI_PLACES=175, PETRI_TRANSITIONS=127} [2024-05-12 12:07:02,860 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 135 predicate places. [2024-05-12 12:07:02,860 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 127 transitions, 1258 flow [2024-05-12 12:07:02,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:02,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:02,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:02,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 12:07:02,861 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:07:02,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2070266816, now seen corresponding path program 3 times [2024-05-12 12:07:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916956070] [2024-05-12 12:07:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:08,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-05-12 12:07:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916956070] [2024-05-12 12:07:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916956070] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:07:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426839960] [2024-05-12 12:07:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:08,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:07:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:08,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:07:08,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:07:08,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:07:08,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 127 transitions, 1258 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 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-05-12 12:07:08,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:08,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:07:08,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:09,635 INFO L124 PetriNetUnfolderBase]: 2185/5294 cut-off events. [2024-05-12 12:07:09,636 INFO L125 PetriNetUnfolderBase]: For 16055/16055 co-relation queries the response was YES. [2024-05-12 12:07:09,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16969 conditions, 5294 events. 2185/5294 cut-off events. For 16055/16055 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 49370 event pairs, 1166 based on Foata normal form. 4/4953 useless extension candidates. Maximal degree in co-relation 16903. Up to 3764 conditions per place. [2024-05-12 12:07:09,679 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 121 selfloop transitions, 35 changer transitions 0/164 dead transitions. [2024-05-12 12:07:09,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 164 transitions, 1603 flow [2024-05-12 12:07:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:07:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:07:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 12:07:09,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-05-12 12:07:09,680 INFO L175 Difference]: Start difference. First operand has 175 places, 127 transitions, 1258 flow. Second operand 9 states and 163 transitions. [2024-05-12 12:07:09,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 164 transitions, 1603 flow [2024-05-12 12:07:09,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 164 transitions, 1394 flow, removed 3 selfloop flow, removed 50 redundant places. [2024-05-12 12:07:09,762 INFO L231 Difference]: Finished difference. Result has 132 places, 126 transitions, 1019 flow [2024-05-12 12:07:09,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1019, PETRI_PLACES=132, PETRI_TRANSITIONS=126} [2024-05-12 12:07:09,763 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-05-12 12:07:09,763 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 126 transitions, 1019 flow [2024-05-12 12:07:09,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 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-05-12 12:07:09,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:09,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:09,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 12:07:09,764 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:07:09,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash -182668164, now seen corresponding path program 1 times [2024-05-12 12:07:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254624565] [2024-05-12 12:07:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:09,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254624565] [2024-05-12 12:07:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254624565] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:09,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:07:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721402056] [2024-05-12 12:07:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:09,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:07:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:09,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:07:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:07:09,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:07:09,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 126 transitions, 1019 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:09,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:09,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:07:09,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:10,347 INFO L124 PetriNetUnfolderBase]: 1459/3711 cut-off events. [2024-05-12 12:07:10,347 INFO L125 PetriNetUnfolderBase]: For 5103/5150 co-relation queries the response was YES. [2024-05-12 12:07:10,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 3711 events. 1459/3711 cut-off events. For 5103/5150 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32698 event pairs, 319 based on Foata normal form. 294/3839 useless extension candidates. Maximal degree in co-relation 11201. Up to 1105 conditions per place. [2024-05-12 12:07:10,362 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 57 selfloop transitions, 51 changer transitions 0/133 dead transitions. [2024-05-12 12:07:10,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 133 transitions, 1243 flow [2024-05-12 12:07:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:07:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:07:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-05-12 12:07:10,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-05-12 12:07:10,363 INFO L175 Difference]: Start difference. First operand has 132 places, 126 transitions, 1019 flow. Second operand 5 states and 104 transitions. [2024-05-12 12:07:10,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 133 transitions, 1243 flow [2024-05-12 12:07:10,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 133 transitions, 1134 flow, removed 10 selfloop flow, removed 15 redundant places. [2024-05-12 12:07:10,393 INFO L231 Difference]: Finished difference. Result has 123 places, 123 transitions, 1057 flow [2024-05-12 12:07:10,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=123, PETRI_TRANSITIONS=123} [2024-05-12 12:07:10,393 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2024-05-12 12:07:10,393 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 123 transitions, 1057 flow [2024-05-12 12:07:10,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:10,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:10,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:10,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 12:07:10,394 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:07:10,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:10,395 INFO L85 PathProgramCache]: Analyzing trace with hash 106433237, now seen corresponding path program 1 times [2024-05-12 12:07:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335512882] [2024-05-12 12:07:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:10,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335512882] [2024-05-12 12:07:10,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335512882] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:10,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:10,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:07:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009593956] [2024-05-12 12:07:10,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:10,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:07:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:10,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:07:10,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:07:10,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:07:10,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 123 transitions, 1057 flow. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:10,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:10,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:07:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:11,987 INFO L124 PetriNetUnfolderBase]: 2123/5709 cut-off events. [2024-05-12 12:07:11,987 INFO L125 PetriNetUnfolderBase]: For 10037/10077 co-relation queries the response was YES. [2024-05-12 12:07:12,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17874 conditions, 5709 events. 2123/5709 cut-off events. For 10037/10077 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 58006 event pairs, 1293 based on Foata normal form. 78/5385 useless extension candidates. Maximal degree in co-relation 17853. Up to 2573 conditions per place. [2024-05-12 12:07:12,012 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 57 selfloop transitions, 30 changer transitions 27/187 dead transitions. [2024-05-12 12:07:12,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 187 transitions, 1567 flow [2024-05-12 12:07:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:07:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:07:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-05-12 12:07:12,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5305555555555556 [2024-05-12 12:07:12,014 INFO L175 Difference]: Start difference. First operand has 123 places, 123 transitions, 1057 flow. Second operand 10 states and 191 transitions. [2024-05-12 12:07:12,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 187 transitions, 1567 flow [2024-05-12 12:07:12,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 187 transitions, 1475 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 12:07:12,067 INFO L231 Difference]: Finished difference. Result has 136 places, 144 transitions, 1236 flow [2024-05-12 12:07:12,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1236, PETRI_PLACES=136, PETRI_TRANSITIONS=144} [2024-05-12 12:07:12,068 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-05-12 12:07:12,068 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 144 transitions, 1236 flow [2024-05-12 12:07:12,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:12,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:12,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:12,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 12:07:12,069 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:07:12,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1591887797, now seen corresponding path program 2 times [2024-05-12 12:07:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974878312] [2024-05-12 12:07:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:12,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974878312] [2024-05-12 12:07:12,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974878312] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:12,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:12,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:07:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713807581] [2024-05-12 12:07:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:12,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:07:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:07:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:07:12,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:07:12,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 144 transitions, 1236 flow. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:12,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:12,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:07:12,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:13,576 INFO L124 PetriNetUnfolderBase]: 1924/5271 cut-off events. [2024-05-12 12:07:13,576 INFO L125 PetriNetUnfolderBase]: For 9283/9343 co-relation queries the response was YES. [2024-05-12 12:07:13,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17653 conditions, 5271 events. 1924/5271 cut-off events. For 9283/9343 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 53596 event pairs, 1079 based on Foata normal form. 59/4954 useless extension candidates. Maximal degree in co-relation 17626. Up to 2701 conditions per place. [2024-05-12 12:07:13,602 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 56 selfloop transitions, 37 changer transitions 33/195 dead transitions. [2024-05-12 12:07:13,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 195 transitions, 1733 flow [2024-05-12 12:07:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:07:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:07:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-05-12 12:07:13,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 12:07:13,604 INFO L175 Difference]: Start difference. First operand has 136 places, 144 transitions, 1236 flow. Second operand 10 states and 195 transitions. [2024-05-12 12:07:13,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 195 transitions, 1733 flow [2024-05-12 12:07:13,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 195 transitions, 1678 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-05-12 12:07:13,680 INFO L231 Difference]: Finished difference. Result has 141 places, 148 transitions, 1349 flow [2024-05-12 12:07:13,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1349, PETRI_PLACES=141, PETRI_TRANSITIONS=148} [2024-05-12 12:07:13,681 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2024-05-12 12:07:13,681 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 148 transitions, 1349 flow [2024-05-12 12:07:13,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:13,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:13,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:13,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 12:07:13,682 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:07:13,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1194444307, now seen corresponding path program 3 times [2024-05-12 12:07:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179441237] [2024-05-12 12:07:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:14,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179441237] [2024-05-12 12:07:14,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179441237] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:14,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:14,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-12 12:07:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691815348] [2024-05-12 12:07:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:14,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:07:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:14,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:07:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:07:14,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:07:14,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 148 transitions, 1349 flow. Second operand has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:14,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:14,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:07:14,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:15,455 INFO L124 PetriNetUnfolderBase]: 1871/5141 cut-off events. [2024-05-12 12:07:15,456 INFO L125 PetriNetUnfolderBase]: For 12175/12249 co-relation queries the response was YES. [2024-05-12 12:07:15,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18904 conditions, 5141 events. 1871/5141 cut-off events. For 12175/12249 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 53139 event pairs, 728 based on Foata normal form. 65/4811 useless extension candidates. Maximal degree in co-relation 18876. Up to 1551 conditions per place. [2024-05-12 12:07:15,529 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 52 selfloop transitions, 43 changer transitions 49/194 dead transitions. [2024-05-12 12:07:15,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 194 transitions, 1890 flow [2024-05-12 12:07:15,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:07:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:07:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 12:07:15,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-05-12 12:07:15,530 INFO L175 Difference]: Start difference. First operand has 141 places, 148 transitions, 1349 flow. Second operand 10 states and 186 transitions. [2024-05-12 12:07:15,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 194 transitions, 1890 flow [2024-05-12 12:07:15,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 194 transitions, 1849 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-05-12 12:07:15,594 INFO L231 Difference]: Finished difference. Result has 145 places, 132 transitions, 1320 flow [2024-05-12 12:07:15,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1320, PETRI_PLACES=145, PETRI_TRANSITIONS=132} [2024-05-12 12:07:15,595 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 105 predicate places. [2024-05-12 12:07:15,595 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 132 transitions, 1320 flow [2024-05-12 12:07:15,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:15,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:15,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:15,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 12:07:15,596 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:07:15,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1055829959, now seen corresponding path program 4 times [2024-05-12 12:07:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561166485] [2024-05-12 12:07:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:07:15,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 12:07:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:07:15,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 12:07:15,699 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 12:07:15,700 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-12 12:07:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-12 12:07:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 12:07:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-05-12 12:07:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 12:07:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 12:07:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-12 12:07:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 12:07:15,702 INFO L445 BasicCegarLoop]: Path program histogram: [12, 7, 7, 6, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:15,706 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 12:07:15,707 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 12:07:15,750 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 12:07:15,751 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 12:07:15,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 12:07:15 BasicIcfg [2024-05-12 12:07:15,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 12:07:15,752 INFO L158 Benchmark]: Toolchain (without parser) took 319272.35ms. Allocated memory was 188.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 112.2MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2024-05-12 12:07:15,752 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:07:15,752 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 158.9MB in the end (delta: 117.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:07:15,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.41ms. Allocated memory is still 188.7MB. Free memory was 112.0MB in the beginning and 119.2MB in the end (delta: -7.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-05-12 12:07:15,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.86ms. Allocated memory is still 188.7MB. Free memory was 119.2MB in the beginning and 103.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-05-12 12:07:15,753 INFO L158 Benchmark]: Boogie Preprocessor took 97.94ms. Allocated memory is still 188.7MB. Free memory was 103.1MB in the beginning and 96.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-05-12 12:07:15,753 INFO L158 Benchmark]: RCFGBuilder took 1074.21ms. Allocated memory is still 188.7MB. Free memory was 96.9MB in the beginning and 86.0MB in the end (delta: 10.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-05-12 12:07:15,753 INFO L158 Benchmark]: TraceAbstraction took 317295.82ms. Allocated memory was 188.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 86.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-05-12 12:07:15,754 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 158.9MB in the end (delta: 117.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.41ms. Allocated memory is still 188.7MB. Free memory was 112.0MB in the beginning and 119.2MB in the end (delta: -7.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.86ms. Allocated memory is still 188.7MB. Free memory was 119.2MB in the beginning and 103.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.94ms. Allocated memory is still 188.7MB. Free memory was 103.1MB in the beginning and 96.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1074.21ms. Allocated memory is still 188.7MB. Free memory was 96.9MB in the beginning and 86.0MB in the end (delta: 10.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * TraceAbstraction took 317295.82ms. Allocated memory was 188.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 86.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] 0 //@ ghost multithreaded = 1; [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 0 //@ assert (((((((((((((((!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd2) >= 0LL) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) __unbuffered_p1_EAX) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$flush_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$mem_tmp) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice2) >= 0LL)) && (((long long) x + (long long) y) >= 0LL)) && (((long long) x + (long long) y$flush_delayed) >= 0LL)) && (((long long) x + (long long) y$mem_tmp) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x + (long long) y$read_delayed) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff1) >= 0LL)) && (((long long) y + (long long) y$flush_delayed) >= 0LL)) && (((long long) y + (long long) y$mem_tmp) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y + (long long) y$read_delayed) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$mem_tmp) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) x) >= 0LL)) && (((long long) weak$$choice0 + (long long) y) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) weak$$choice2) >= 0LL)) && (((long long) weak$$choice2 + (long long) x) >= 0LL)) && (((long long) weak$$choice2 + (long long) y) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$read_delayed) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x - (long long) y$read_delayed) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y - (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$read_delayed) >= 0LL)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= __unbuffered_p1_EAX)) && (0 <= x)) && (0 <= y)) && (0 <= y$mem_tmp)) && (0 <= y$w_buff0)) && (0 <= y$w_buff1)) && (__unbuffered_p1_EAX <= 1)) && (y <= 1)) && (y$mem_tmp <= 1)) && (y$w_buff0 <= 1)) && (y$w_buff1 <= 1)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 //@ assert (((((((((((((((!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd2) >= 0LL) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) __unbuffered_p1_EAX) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$flush_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$mem_tmp) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice2) >= 0LL)) && (((long long) x + (long long) y) >= 0LL)) && (((long long) x + (long long) y$flush_delayed) >= 0LL)) && (((long long) x + (long long) y$mem_tmp) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x + (long long) y$read_delayed) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff1) >= 0LL)) && (((long long) y + (long long) y$flush_delayed) >= 0LL)) && (((long long) y + (long long) y$mem_tmp) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y + (long long) y$read_delayed) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$mem_tmp) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) x) >= 0LL)) && (((long long) weak$$choice0 + (long long) y) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) weak$$choice2) >= 0LL)) && (((long long) weak$$choice2 + (long long) x) >= 0LL)) && (((long long) weak$$choice2 + (long long) y) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$read_delayed) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x - (long long) y$read_delayed) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y - (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$read_delayed) >= 0LL)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= __unbuffered_p1_EAX)) && (0 <= x)) && (0 <= y)) && (0 <= y$mem_tmp)) && (0 <= y$w_buff0)) && (0 <= y$w_buff1)) && (__unbuffered_p1_EAX <= 1)) && (y <= 1)) && (y$mem_tmp <= 1)) && (y$w_buff0 <= 1)) && (y$w_buff1 <= 1)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 317.1s, OverallIterations: 63, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 52.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3857 SdHoareTripleChecker+Valid, 20.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3359 mSDsluCounter, 1794 SdHoareTripleChecker+Invalid, 17.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1561 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22374 IncrementalHoareTripleChecker+Invalid, 23184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 233 mSDtfsCounter, 22374 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 561 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1452occurred in iteration=29, InterpolantAutomatonStates: 481, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 260.8s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 37355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 62 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-12 12:07:15,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE