./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/thin002_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/thin002_power.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:38:28,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:38:28,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:38:28,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:38:28,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:38:28,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:38:28,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:38:28,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:38:28,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:38:28,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:38:28,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:38:28,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:38:28,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:38:28,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:38:28,760 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:38:28,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:38:28,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:38:28,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:38:28,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:38:28,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:38:28,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:38:28,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:38:28,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:38:28,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:38:28,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:38:28,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:38:28,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:38:28,763 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:38:28,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:38:28,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:38:28,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:38:28,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:38:28,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:38:28,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:38:28,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:38:28,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:38:28,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:38:28,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:38:28,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:38:28,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:38:28,767 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:38:28,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:38:28,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:38:28,768 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 00:38:28,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:38:29,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:38:29,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:38:29,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:38:29,015 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:38:29,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-28 00:38:30,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:38:30,433 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:38:30,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-28 00:38:30,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a0833e1/81ddc19dcb2b495c9fd1bbd5d22ca39a/FLAG7d7754559 [2024-06-28 00:38:30,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a0833e1/81ddc19dcb2b495c9fd1bbd5d22ca39a [2024-06-28 00:38:30,462 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:38:30,463 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:38:30,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/thin002_power.oepc.yml/witness.yml [2024-06-28 00:38:30,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:38:30,583 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:38:30,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:38:30,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:38:30,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:38:30,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:38:30" (1/2) ... [2024-06-28 00:38:30,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47863e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:38:30, skipping insertion in model container [2024-06-28 00:38:30,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:38:30" (1/2) ... [2024-06-28 00:38:30,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@87688f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:38:30, skipping insertion in model container [2024-06-28 00:38:30,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:38:30" (2/2) ... [2024-06-28 00:38:30,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47863e10 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:30, skipping insertion in model container [2024-06-28 00:38:30,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:38:30" (2/2) ... [2024-06-28 00:38:30,596 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:38:30,635 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:38:30,636 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-28 00:38:30,637 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-28 00:38:30,637 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-28 00:38:30,638 INFO L97 edCorrectnessWitness]: Location invariant before [L868-L868] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-28 00:38:30,639 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:38:30,640 INFO L106 edCorrectnessWitness]: ghost_update [L862-L862] multithreaded = 1; [2024-06-28 00:38:30,698 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:38:31,127 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:38:31,153 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:38:31,533 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:38:31,568 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:38:31,569 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31 WrapperNode [2024-06-28 00:38:31,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:38:31,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:38:31,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:38:31,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:38:31,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,648 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2024-06-28 00:38:31,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:38:31,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:38:31,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:38:31,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:38:31,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,720 INFO L175 MemorySlicer]: Split 25 memory accesses to 2 slices as follows [23, 2]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 5 writes are split as follows [5, 0]. [2024-06-28 00:38:31,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:38:31,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:38:31,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:38:31,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:38:31,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (1/1) ... [2024-06-28 00:38:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:38:31,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:38:31,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 00:38:31,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 00:38:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 00:38:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 00:38:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 00:38:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 00:38:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:38:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:38:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:38:31,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:38:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:38:31,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:38:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 00:38:31,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 00:38:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 00:38:31,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 00:38:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:38:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 00:38:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:38:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:38:31,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:38:31,871 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:38:32,030 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:38:32,032 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:38:32,857 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:38:32,857 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:38:33,321 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:38:33,322 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:38:33,322 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:38:33 BoogieIcfgContainer [2024-06-28 00:38:33,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:38:33,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:38:33,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:38:33,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:38:33,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:38:30" (1/4) ... [2024-06-28 00:38:33,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56327b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:38:33, skipping insertion in model container [2024-06-28 00:38:33,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:38:30" (2/4) ... [2024-06-28 00:38:33,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56327b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:38:33, skipping insertion in model container [2024-06-28 00:38:33,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:38:31" (3/4) ... [2024-06-28 00:38:33,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56327b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:38:33, skipping insertion in model container [2024-06-28 00:38:33,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:38:33" (4/4) ... [2024-06-28 00:38:33,335 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2024-06-28 00:38:33,353 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:38:33,354 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 00:38:33,354 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:38:33,468 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:38:33,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 54 transitions, 124 flow [2024-06-28 00:38:33,564 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2024-06-28 00:38:33,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:38:33,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:38:33,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 54 transitions, 124 flow [2024-06-28 00:38:33,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 100 flow [2024-06-28 00:38:33,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:38:33,596 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;@3049cec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:38:33,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-28 00:38:33,605 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:38:33,605 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 00:38:33,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:38:33,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:33,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:38:33,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:38:33,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash 656171716, now seen corresponding path program 1 times [2024-06-28 00:38:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:33,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939339325] [2024-06-28 00:38:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939339325] [2024-06-28 00:38:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939339325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:38:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506557462] [2024-06-28 00:38:36,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:36,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:38:36,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:38:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:38:36,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2024-06-28 00:38:36,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:38:36,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:36,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2024-06-28 00:38:36,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:38,596 INFO L124 PetriNetUnfolderBase]: 4406/6336 cut-off events. [2024-06-28 00:38:38,597 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-06-28 00:38:38,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12682 conditions, 6336 events. 4406/6336 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 34587 event pairs, 3188 based on Foata normal form. 1/6203 useless extension candidates. Maximal degree in co-relation 12669. Up to 6114 conditions per place. [2024-06-28 00:38:38,632 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 45 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2024-06-28 00:38:38,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 243 flow [2024-06-28 00:38:38,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:38:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:38:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-06-28 00:38:38,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-06-28 00:38:38,643 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 100 flow. Second operand 3 states and 99 transitions. [2024-06-28 00:38:38,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 243 flow [2024-06-28 00:38:38,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 00:38:38,647 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 135 flow [2024-06-28 00:38:38,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-06-28 00:38:38,651 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-06-28 00:38:38,651 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 135 flow [2024-06-28 00:38:38,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:38:38,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:38,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:38,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:38:38,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:38:38,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -778355763, now seen corresponding path program 1 times [2024-06-28 00:38:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094359883] [2024-06-28 00:38:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094359883] [2024-06-28 00:38:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094359883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:43,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:38:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749006026] [2024-06-28 00:38:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:43,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:38:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:38:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:38:43,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2024-06-28 00:38:43,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:38:43,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:43,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2024-06-28 00:38:43,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:45,075 INFO L124 PetriNetUnfolderBase]: 4396/6307 cut-off events. [2024-06-28 00:38:45,076 INFO L125 PetriNetUnfolderBase]: For 1199/1209 co-relation queries the response was YES. [2024-06-28 00:38:45,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14561 conditions, 6307 events. 4396/6307 cut-off events. For 1199/1209 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33965 event pairs, 2767 based on Foata normal form. 10/6313 useless extension candidates. Maximal degree in co-relation 14549. Up to 6073 conditions per place. [2024-06-28 00:38:45,111 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 58 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2024-06-28 00:38:45,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 347 flow [2024-06-28 00:38:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:38:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:38:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-28 00:38:45,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064814814814815 [2024-06-28 00:38:45,116 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 135 flow. Second operand 4 states and 131 transitions. [2024-06-28 00:38:45,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 347 flow [2024-06-28 00:38:45,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:38:45,121 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 183 flow [2024-06-28 00:38:45,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-06-28 00:38:45,122 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2024-06-28 00:38:45,122 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 183 flow [2024-06-28 00:38:45,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:38:45,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:45,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:45,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:38:45,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:38:45,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1640776411, now seen corresponding path program 1 times [2024-06-28 00:38:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:45,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209407005] [2024-06-28 00:38:45,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:49,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:49,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209407005] [2024-06-28 00:38:49,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209407005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:49,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:49,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:38:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052620564] [2024-06-28 00:38:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:49,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:38:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:38:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:38:49,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-06-28 00:38:49,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:38:49,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:49,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-06-28 00:38:49,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:38:51,832 INFO L124 PetriNetUnfolderBase]: 5573/7932 cut-off events. [2024-06-28 00:38:51,832 INFO L125 PetriNetUnfolderBase]: For 4121/4139 co-relation queries the response was YES. [2024-06-28 00:38:51,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20459 conditions, 7932 events. 5573/7932 cut-off events. For 4121/4139 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 42899 event pairs, 2919 based on Foata normal form. 16/7945 useless extension candidates. Maximal degree in co-relation 20445. Up to 7638 conditions per place. [2024-06-28 00:38:51,890 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 80 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2024-06-28 00:38:51,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 103 transitions, 523 flow [2024-06-28 00:38:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:38:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:38:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-06-28 00:38:51,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-28 00:38:51,896 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 183 flow. Second operand 5 states and 159 transitions. [2024-06-28 00:38:51,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 103 transitions, 523 flow [2024-06-28 00:38:51,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 492 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-28 00:38:51,905 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 279 flow [2024-06-28 00:38:51,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-06-28 00:38:51,906 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2024-06-28 00:38:51,907 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 279 flow [2024-06-28 00:38:51,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:38:51,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:38:51,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:38:51,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:38:51,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:38:51,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:38:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1181600252, now seen corresponding path program 1 times [2024-06-28 00:38:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:38:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846981967] [2024-06-28 00:38:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:38:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:38:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:38:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:38:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:38:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846981967] [2024-06-28 00:38:57,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846981967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:38:57,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:38:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:38:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150162400] [2024-06-28 00:38:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:38:57,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:38:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:38:57,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:38:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:38:57,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-06-28 00:38:57,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:38:57,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:38:57,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-06-28 00:38:57,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:00,043 INFO L124 PetriNetUnfolderBase]: 5557/7912 cut-off events. [2024-06-28 00:39:00,044 INFO L125 PetriNetUnfolderBase]: For 7471/7516 co-relation queries the response was YES. [2024-06-28 00:39:00,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22651 conditions, 7912 events. 5557/7912 cut-off events. For 7471/7516 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 42865 event pairs, 2329 based on Foata normal form. 32/7941 useless extension candidates. Maximal degree in co-relation 22634. Up to 7560 conditions per place. [2024-06-28 00:39:00,078 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 89 selfloop transitions, 16 changer transitions 0/115 dead transitions. [2024-06-28 00:39:00,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 621 flow [2024-06-28 00:39:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:39:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:39:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-06-28 00:39:00,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-06-28 00:39:00,081 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 279 flow. Second operand 6 states and 185 transitions. [2024-06-28 00:39:00,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 621 flow [2024-06-28 00:39:00,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 613 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 00:39:00,085 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 331 flow [2024-06-28 00:39:00,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-06-28 00:39:00,085 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2024-06-28 00:39:00,086 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 331 flow [2024-06-28 00:39:00,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:00,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:00,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:00,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:39:00,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:39:00,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1542593831, now seen corresponding path program 1 times [2024-06-28 00:39:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:00,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842058210] [2024-06-28 00:39:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:04,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:04,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842058210] [2024-06-28 00:39:04,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842058210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:04,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:04,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:39:04,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529011342] [2024-06-28 00:39:04,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:04,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:39:04,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:04,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:39:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:39:04,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:39:04,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:04,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:04,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:39:04,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:06,793 INFO L124 PetriNetUnfolderBase]: 6967/9830 cut-off events. [2024-06-28 00:39:06,793 INFO L125 PetriNetUnfolderBase]: For 14336/14388 co-relation queries the response was YES. [2024-06-28 00:39:06,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29876 conditions, 9830 events. 6967/9830 cut-off events. For 14336/14388 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 53062 event pairs, 3303 based on Foata normal form. 19/9838 useless extension candidates. Maximal degree in co-relation 29855. Up to 9435 conditions per place. [2024-06-28 00:39:06,874 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 83 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2024-06-28 00:39:06,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 719 flow [2024-06-28 00:39:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:39:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:39:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-06-28 00:39:06,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2024-06-28 00:39:06,877 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 331 flow. Second operand 5 states and 133 transitions. [2024-06-28 00:39:06,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 719 flow [2024-06-28 00:39:06,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 661 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 00:39:06,884 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 454 flow [2024-06-28 00:39:06,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-06-28 00:39:06,887 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2024-06-28 00:39:06,887 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 454 flow [2024-06-28 00:39:06,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:06,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:06,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:06,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:39:06,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:39:06,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1956570536, now seen corresponding path program 1 times [2024-06-28 00:39:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:06,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179954795] [2024-06-28 00:39:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:13,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179954795] [2024-06-28 00:39:13,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179954795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:13,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:13,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:39:13,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676776582] [2024-06-28 00:39:13,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:13,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:39:13,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:13,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:39:13,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:39:13,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-28 00:39:13,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 454 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:13,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:13,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-28 00:39:13,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:16,404 INFO L124 PetriNetUnfolderBase]: 6926/9836 cut-off events. [2024-06-28 00:39:16,404 INFO L125 PetriNetUnfolderBase]: For 21318/21555 co-relation queries the response was YES. [2024-06-28 00:39:16,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33410 conditions, 9836 events. 6926/9836 cut-off events. For 21318/21555 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 54461 event pairs, 2829 based on Foata normal form. 90/9884 useless extension candidates. Maximal degree in co-relation 33384. Up to 9235 conditions per place. [2024-06-28 00:39:16,464 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 133 selfloop transitions, 43 changer transitions 0/187 dead transitions. [2024-06-28 00:39:16,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 187 transitions, 1238 flow [2024-06-28 00:39:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:39:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:39:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 294 transitions. [2024-06-28 00:39:16,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-06-28 00:39:16,466 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 454 flow. Second operand 11 states and 294 transitions. [2024-06-28 00:39:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 187 transitions, 1238 flow [2024-06-28 00:39:16,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 187 transitions, 1230 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 00:39:16,476 INFO L231 Difference]: Finished difference. Result has 85 places, 106 transitions, 736 flow [2024-06-28 00:39:16,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=736, PETRI_PLACES=85, PETRI_TRANSITIONS=106} [2024-06-28 00:39:16,477 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2024-06-28 00:39:16,477 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 106 transitions, 736 flow [2024-06-28 00:39:16,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:16,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:16,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:16,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:39:16,478 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:39:16,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2079026332, now seen corresponding path program 2 times [2024-06-28 00:39:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:16,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759679145] [2024-06-28 00:39:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759679145] [2024-06-28 00:39:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759679145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:22,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:22,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:39:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648230735] [2024-06-28 00:39:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:22,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:39:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:39:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:39:22,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-28 00:39:22,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 106 transitions, 736 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:22,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:22,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-28 00:39:22,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:25,377 INFO L124 PetriNetUnfolderBase]: 7051/10058 cut-off events. [2024-06-28 00:39:25,377 INFO L125 PetriNetUnfolderBase]: For 36031/36435 co-relation queries the response was YES. [2024-06-28 00:39:25,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39257 conditions, 10058 events. 7051/10058 cut-off events. For 36031/36435 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 56072 event pairs, 2877 based on Foata normal form. 70/10064 useless extension candidates. Maximal degree in co-relation 39225. Up to 9459 conditions per place. [2024-06-28 00:39:25,434 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 100 selfloop transitions, 54 changer transitions 0/165 dead transitions. [2024-06-28 00:39:25,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 165 transitions, 1372 flow [2024-06-28 00:39:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:39:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:39:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-28 00:39:25,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-28 00:39:25,437 INFO L175 Difference]: Start difference. First operand has 85 places, 106 transitions, 736 flow. Second operand 6 states and 168 transitions. [2024-06-28 00:39:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 165 transitions, 1372 flow [2024-06-28 00:39:25,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 165 transitions, 1296 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 00:39:25,470 INFO L231 Difference]: Finished difference. Result has 87 places, 130 transitions, 1076 flow [2024-06-28 00:39:25,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1076, PETRI_PLACES=87, PETRI_TRANSITIONS=130} [2024-06-28 00:39:25,471 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2024-06-28 00:39:25,471 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 130 transitions, 1076 flow [2024-06-28 00:39:25,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:25,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:25,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:25,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:39:25,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:39:25,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1907641376, now seen corresponding path program 3 times [2024-06-28 00:39:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:25,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798076551] [2024-06-28 00:39:25,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:29,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-06-28 00:39:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798076551] [2024-06-28 00:39:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798076551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:39:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437486004] [2024-06-28 00:39:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:29,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:39:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:29,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:39:29,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:39:29,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-28 00:39:29,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 130 transitions, 1076 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:29,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:29,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-28 00:39:29,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:32,488 INFO L124 PetriNetUnfolderBase]: 7039/10072 cut-off events. [2024-06-28 00:39:32,488 INFO L125 PetriNetUnfolderBase]: For 48223/48675 co-relation queries the response was YES. [2024-06-28 00:39:32,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41762 conditions, 10072 events. 7039/10072 cut-off events. For 48223/48675 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 56363 event pairs, 2835 based on Foata normal form. 112/10095 useless extension candidates. Maximal degree in co-relation 41727. Up to 9252 conditions per place. [2024-06-28 00:39:32,551 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 87 selfloop transitions, 77 changer transitions 0/175 dead transitions. [2024-06-28 00:39:32,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 175 transitions, 1617 flow [2024-06-28 00:39:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:39:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:39:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-06-28 00:39:32,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-28 00:39:32,554 INFO L175 Difference]: Start difference. First operand has 87 places, 130 transitions, 1076 flow. Second operand 7 states and 176 transitions. [2024-06-28 00:39:32,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 175 transitions, 1617 flow [2024-06-28 00:39:32,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 175 transitions, 1518 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-28 00:39:32,609 INFO L231 Difference]: Finished difference. Result has 93 places, 146 transitions, 1347 flow [2024-06-28 00:39:32,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1347, PETRI_PLACES=93, PETRI_TRANSITIONS=146} [2024-06-28 00:39:32,611 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 36 predicate places. [2024-06-28 00:39:32,611 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 146 transitions, 1347 flow [2024-06-28 00:39:32,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:32,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:32,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:32,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:39:32,611 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:39:32,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2129834694, now seen corresponding path program 1 times [2024-06-28 00:39:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784290078] [2024-06-28 00:39:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:37,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:37,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784290078] [2024-06-28 00:39:37,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784290078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:37,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:37,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:39:37,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682841248] [2024-06-28 00:39:37,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:37,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:39:37,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:39:37,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:39:37,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:39:37,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 146 transitions, 1347 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-06-28 00:39:37,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:37,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:39:37,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:40,346 INFO L124 PetriNetUnfolderBase]: 7487/10598 cut-off events. [2024-06-28 00:39:40,346 INFO L125 PetriNetUnfolderBase]: For 65001/65369 co-relation queries the response was YES. [2024-06-28 00:39:40,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46768 conditions, 10598 events. 7487/10598 cut-off events. For 65001/65369 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 57813 event pairs, 3003 based on Foata normal form. 89/10664 useless extension candidates. Maximal degree in co-relation 46730. Up to 9973 conditions per place. [2024-06-28 00:39:40,406 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 151 selfloop transitions, 27 changer transitions 0/186 dead transitions. [2024-06-28 00:39:40,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 186 transitions, 1854 flow [2024-06-28 00:39:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:39:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:39:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-28 00:39:40,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 00:39:40,409 INFO L175 Difference]: Start difference. First operand has 93 places, 146 transitions, 1347 flow. Second operand 7 states and 171 transitions. [2024-06-28 00:39:40,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 186 transitions, 1854 flow [2024-06-28 00:39:40,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 186 transitions, 1823 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-28 00:39:40,458 INFO L231 Difference]: Finished difference. Result has 98 places, 149 transitions, 1414 flow [2024-06-28 00:39:40,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1414, PETRI_PLACES=98, PETRI_TRANSITIONS=149} [2024-06-28 00:39:40,459 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2024-06-28 00:39:40,459 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 149 transitions, 1414 flow [2024-06-28 00:39:40,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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-06-28 00:39:40,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:40,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:40,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:39:40,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:39:40,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash -527717108, now seen corresponding path program 1 times [2024-06-28 00:39:40,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:40,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351223952] [2024-06-28 00:39:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:40,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351223952] [2024-06-28 00:39:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351223952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:47,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:39:47,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261216796] [2024-06-28 00:39:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:47,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:39:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:39:47,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:39:47,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:39:47,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 149 transitions, 1414 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:47,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:47,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:39:47,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:39:51,733 INFO L124 PetriNetUnfolderBase]: 7635/10886 cut-off events. [2024-06-28 00:39:51,733 INFO L125 PetriNetUnfolderBase]: For 77996/78168 co-relation queries the response was YES. [2024-06-28 00:39:51,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49834 conditions, 10886 events. 7635/10886 cut-off events. For 77996/78168 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 60582 event pairs, 3640 based on Foata normal form. 68/10885 useless extension candidates. Maximal degree in co-relation 49794. Up to 10037 conditions per place. [2024-06-28 00:39:51,803 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 225 selfloop transitions, 61 changer transitions 0/294 dead transitions. [2024-06-28 00:39:51,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 294 transitions, 2780 flow [2024-06-28 00:39:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:39:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:39:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 311 transitions. [2024-06-28 00:39:51,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799382716049383 [2024-06-28 00:39:51,810 INFO L175 Difference]: Start difference. First operand has 98 places, 149 transitions, 1414 flow. Second operand 12 states and 311 transitions. [2024-06-28 00:39:51,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 294 transitions, 2780 flow [2024-06-28 00:39:51,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 294 transitions, 2693 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 00:39:51,904 INFO L231 Difference]: Finished difference. Result has 113 places, 199 transitions, 2007 flow [2024-06-28 00:39:51,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2007, PETRI_PLACES=113, PETRI_TRANSITIONS=199} [2024-06-28 00:39:51,905 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 56 predicate places. [2024-06-28 00:39:51,906 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 199 transitions, 2007 flow [2024-06-28 00:39:51,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:51,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:39:51,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:39:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:39:51,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:39:51,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:39:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1487974412, now seen corresponding path program 2 times [2024-06-28 00:39:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:39:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522211831] [2024-06-28 00:39:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:39:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:39:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:39:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:39:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:39:56,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522211831] [2024-06-28 00:39:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522211831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:39:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:39:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:39:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892852856] [2024-06-28 00:39:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:39:56,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:39:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:39:56,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:39:56,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:39:57,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:39:57,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 199 transitions, 2007 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:39:57,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:39:57,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:39:57,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:40:00,948 INFO L124 PetriNetUnfolderBase]: 7737/10993 cut-off events. [2024-06-28 00:40:00,948 INFO L125 PetriNetUnfolderBase]: For 91686/92267 co-relation queries the response was YES. [2024-06-28 00:40:00,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54200 conditions, 10993 events. 7737/10993 cut-off events. For 91686/92267 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 60270 event pairs, 3022 based on Foata normal form. 175/11144 useless extension candidates. Maximal degree in co-relation 54152. Up to 10044 conditions per place. [2024-06-28 00:40:01,022 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 206 selfloop transitions, 88 changer transitions 0/302 dead transitions. [2024-06-28 00:40:01,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 302 transitions, 3200 flow [2024-06-28 00:40:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:40:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:40:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 272 transitions. [2024-06-28 00:40:01,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45791245791245794 [2024-06-28 00:40:01,026 INFO L175 Difference]: Start difference. First operand has 113 places, 199 transitions, 2007 flow. Second operand 11 states and 272 transitions. [2024-06-28 00:40:01,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 302 transitions, 3200 flow [2024-06-28 00:40:01,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 302 transitions, 3154 flow, removed 22 selfloop flow, removed 1 redundant places. [2024-06-28 00:40:01,112 INFO L231 Difference]: Finished difference. Result has 126 places, 234 transitions, 2564 flow [2024-06-28 00:40:01,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2564, PETRI_PLACES=126, PETRI_TRANSITIONS=234} [2024-06-28 00:40:01,112 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places. [2024-06-28 00:40:01,112 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 234 transitions, 2564 flow [2024-06-28 00:40:01,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:01,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:40:01,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:40:01,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:40:01,120 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:40:01,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:40:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 992661772, now seen corresponding path program 3 times [2024-06-28 00:40:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:40:01,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386623985] [2024-06-28 00:40:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:40:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:40:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:40:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:40:06,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:40:06,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386623985] [2024-06-28 00:40:06,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386623985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:40:06,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:40:06,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:40:06,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384409939] [2024-06-28 00:40:06,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:40:06,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:40:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:40:06,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:40:06,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:40:06,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:40:06,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 234 transitions, 2564 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:06,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:40:06,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:40:06,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:40:09,581 INFO L124 PetriNetUnfolderBase]: 7703/10943 cut-off events. [2024-06-28 00:40:09,596 INFO L125 PetriNetUnfolderBase]: For 118011/118453 co-relation queries the response was YES. [2024-06-28 00:40:09,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58685 conditions, 10943 events. 7703/10943 cut-off events. For 118011/118453 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 59856 event pairs, 3042 based on Foata normal form. 140/11055 useless extension candidates. Maximal degree in co-relation 58631. Up to 10014 conditions per place. [2024-06-28 00:40:09,675 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 187 selfloop transitions, 82 changer transitions 0/277 dead transitions. [2024-06-28 00:40:09,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 277 transitions, 3265 flow [2024-06-28 00:40:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:40:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:40:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-28 00:40:09,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46064814814814814 [2024-06-28 00:40:09,677 INFO L175 Difference]: Start difference. First operand has 126 places, 234 transitions, 2564 flow. Second operand 8 states and 199 transitions. [2024-06-28 00:40:09,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 277 transitions, 3265 flow [2024-06-28 00:40:09,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 277 transitions, 3165 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-28 00:40:09,782 INFO L231 Difference]: Finished difference. Result has 131 places, 234 transitions, 2646 flow [2024-06-28 00:40:09,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2646, PETRI_PLACES=131, PETRI_TRANSITIONS=234} [2024-06-28 00:40:09,783 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places. [2024-06-28 00:40:09,783 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 234 transitions, 2646 flow [2024-06-28 00:40:09,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:09,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:40:09,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:40:09,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:40:09,784 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:40:09,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:40:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 817779231, now seen corresponding path program 1 times [2024-06-28 00:40:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:40:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367094918] [2024-06-28 00:40:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:40:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:40:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:40:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:40:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:40:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367094918] [2024-06-28 00:40:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367094918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:40:16,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:40:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:40:16,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884296649] [2024-06-28 00:40:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:40:16,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:40:16,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:40:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:40:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:40:16,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-28 00:40:16,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 234 transitions, 2646 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:16,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:40:16,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-28 00:40:16,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:40:20,375 INFO L124 PetriNetUnfolderBase]: 7990/11387 cut-off events. [2024-06-28 00:40:20,375 INFO L125 PetriNetUnfolderBase]: For 160027/160429 co-relation queries the response was YES. [2024-06-28 00:40:20,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64786 conditions, 11387 events. 7990/11387 cut-off events. For 160027/160429 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 64669 event pairs, 2779 based on Foata normal form. 117/11099 useless extension candidates. Maximal degree in co-relation 64730. Up to 9559 conditions per place. [2024-06-28 00:40:20,471 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 199 selfloop transitions, 106 changer transitions 0/338 dead transitions. [2024-06-28 00:40:20,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 338 transitions, 3752 flow [2024-06-28 00:40:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:40:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:40:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 324 transitions. [2024-06-28 00:40:20,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 00:40:20,473 INFO L175 Difference]: Start difference. First operand has 131 places, 234 transitions, 2646 flow. Second operand 12 states and 324 transitions. [2024-06-28 00:40:20,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 338 transitions, 3752 flow [2024-06-28 00:40:20,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 338 transitions, 3584 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 00:40:20,689 INFO L231 Difference]: Finished difference. Result has 137 places, 239 transitions, 2801 flow [2024-06-28 00:40:20,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2482, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2801, PETRI_PLACES=137, PETRI_TRANSITIONS=239} [2024-06-28 00:40:20,689 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 80 predicate places. [2024-06-28 00:40:20,689 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 239 transitions, 2801 flow [2024-06-28 00:40:20,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:20,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:40:20,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:40:20,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:40:20,690 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:40:20,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:40:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1900500603, now seen corresponding path program 2 times [2024-06-28 00:40:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:40:20,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242415387] [2024-06-28 00:40:20,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:40:20,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:40:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:40:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:40:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:40:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242415387] [2024-06-28 00:40:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242415387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:40:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:40:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:40:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898206880] [2024-06-28 00:40:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:40:27,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:40:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:40:27,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:40:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:40:27,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-28 00:40:27,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 239 transitions, 2801 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:27,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:40:27,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-28 00:40:27,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:40:31,042 INFO L124 PetriNetUnfolderBase]: 8357/11934 cut-off events. [2024-06-28 00:40:31,042 INFO L125 PetriNetUnfolderBase]: For 185282/185733 co-relation queries the response was YES. [2024-06-28 00:40:31,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70836 conditions, 11934 events. 8357/11934 cut-off events. For 185282/185733 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 68147 event pairs, 3460 based on Foata normal form. 98/11644 useless extension candidates. Maximal degree in co-relation 70778. Up to 10696 conditions per place. [2024-06-28 00:40:31,127 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 221 selfloop transitions, 97 changer transitions 0/351 dead transitions. [2024-06-28 00:40:31,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 351 transitions, 4152 flow [2024-06-28 00:40:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:40:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:40:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 309 transitions. [2024-06-28 00:40:31,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2024-06-28 00:40:31,129 INFO L175 Difference]: Start difference. First operand has 137 places, 239 transitions, 2801 flow. Second operand 12 states and 309 transitions. [2024-06-28 00:40:31,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 351 transitions, 4152 flow [2024-06-28 00:40:31,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 351 transitions, 3975 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 00:40:31,386 INFO L231 Difference]: Finished difference. Result has 143 places, 273 transitions, 3365 flow [2024-06-28 00:40:31,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3365, PETRI_PLACES=143, PETRI_TRANSITIONS=273} [2024-06-28 00:40:31,387 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places. [2024-06-28 00:40:31,387 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 273 transitions, 3365 flow [2024-06-28 00:40:31,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:31,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:40:31,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:40:31,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:40:31,388 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:40:31,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:40:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1571506951, now seen corresponding path program 3 times [2024-06-28 00:40:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:40:31,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693950109] [2024-06-28 00:40:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:40:31,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:40:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:40:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:40:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:40:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693950109] [2024-06-28 00:40:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693950109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:40:37,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:40:37,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:40:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113084812] [2024-06-28 00:40:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:40:37,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:40:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:40:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:40:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:40:37,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-28 00:40:37,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 273 transitions, 3365 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:37,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:40:37,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-28 00:40:37,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:40:41,121 INFO L124 PetriNetUnfolderBase]: 8416/12020 cut-off events. [2024-06-28 00:40:41,121 INFO L125 PetriNetUnfolderBase]: For 197703/198161 co-relation queries the response was YES. [2024-06-28 00:40:41,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73145 conditions, 12020 events. 8416/12020 cut-off events. For 197703/198161 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 68785 event pairs, 3474 based on Foata normal form. 74/11709 useless extension candidates. Maximal degree in co-relation 73083. Up to 10776 conditions per place. [2024-06-28 00:40:41,217 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 240 selfloop transitions, 99 changer transitions 0/372 dead transitions. [2024-06-28 00:40:41,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 372 transitions, 4660 flow [2024-06-28 00:40:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:40:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:40:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 270 transitions. [2024-06-28 00:40:41,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 00:40:41,220 INFO L175 Difference]: Start difference. First operand has 143 places, 273 transitions, 3365 flow. Second operand 10 states and 270 transitions. [2024-06-28 00:40:41,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 372 transitions, 4660 flow [2024-06-28 00:40:41,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 372 transitions, 4488 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 00:40:41,538 INFO L231 Difference]: Finished difference. Result has 149 places, 298 transitions, 3904 flow [2024-06-28 00:40:41,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3904, PETRI_PLACES=149, PETRI_TRANSITIONS=298} [2024-06-28 00:40:41,539 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 92 predicate places. [2024-06-28 00:40:41,539 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 298 transitions, 3904 flow [2024-06-28 00:40:41,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:41,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:40:41,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:40:41,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:40:41,539 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:40:41,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:40:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash -360529427, now seen corresponding path program 4 times [2024-06-28 00:40:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:40:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712306809] [2024-06-28 00:40:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:40:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:40:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:40:46,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-06-28 00:40:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:40:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712306809] [2024-06-28 00:40:46,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712306809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:40:46,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:40:46,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:40:46,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586962987] [2024-06-28 00:40:46,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:40:46,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:40:46,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:40:46,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:40:46,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:40:46,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-06-28 00:40:46,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 298 transitions, 3904 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:46,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:40:46,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-06-28 00:40:46,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:40:50,222 INFO L124 PetriNetUnfolderBase]: 8705/12458 cut-off events. [2024-06-28 00:40:50,222 INFO L125 PetriNetUnfolderBase]: For 231583/232266 co-relation queries the response was YES. [2024-06-28 00:40:50,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77341 conditions, 12458 events. 8705/12458 cut-off events. For 231583/232266 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 71772 event pairs, 2847 based on Foata normal form. 182/12220 useless extension candidates. Maximal degree in co-relation 77275. Up to 10593 conditions per place. [2024-06-28 00:40:50,332 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 185 selfloop transitions, 134 changer transitions 0/352 dead transitions. [2024-06-28 00:40:50,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 352 transitions, 4831 flow [2024-06-28 00:40:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:40:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:40:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-28 00:40:50,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-28 00:40:50,334 INFO L175 Difference]: Start difference. First operand has 149 places, 298 transitions, 3904 flow. Second operand 8 states and 208 transitions. [2024-06-28 00:40:50,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 352 transitions, 4831 flow [2024-06-28 00:40:50,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 352 transitions, 4557 flow, removed 85 selfloop flow, removed 5 redundant places. [2024-06-28 00:40:50,638 INFO L231 Difference]: Finished difference. Result has 152 places, 305 transitions, 4056 flow [2024-06-28 00:40:50,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3632, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4056, PETRI_PLACES=152, PETRI_TRANSITIONS=305} [2024-06-28 00:40:50,639 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places. [2024-06-28 00:40:50,639 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 305 transitions, 4056 flow [2024-06-28 00:40:50,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:50,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:40:50,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:40:50,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:40:50,640 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:40:50,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:40:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -867710897, now seen corresponding path program 1 times [2024-06-28 00:40:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:40:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083341831] [2024-06-28 00:40:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:40:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:40:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:40:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:40:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:40:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083341831] [2024-06-28 00:40:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083341831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:40:54,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:40:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:40:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738198767] [2024-06-28 00:40:54,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:40:54,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:40:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:40:54,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:40:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:40:54,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:40:54,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 305 transitions, 4056 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:54,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:40:54,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:40:54,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:40:58,752 INFO L124 PetriNetUnfolderBase]: 10076/14210 cut-off events. [2024-06-28 00:40:58,753 INFO L125 PetriNetUnfolderBase]: For 244861/245423 co-relation queries the response was YES. [2024-06-28 00:40:58,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87040 conditions, 14210 events. 10076/14210 cut-off events. For 244861/245423 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 79931 event pairs, 3776 based on Foata normal form. 476/14628 useless extension candidates. Maximal degree in co-relation 86972. Up to 13213 conditions per place. [2024-06-28 00:40:58,878 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 294 selfloop transitions, 39 changer transitions 0/367 dead transitions. [2024-06-28 00:40:58,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 367 transitions, 5366 flow [2024-06-28 00:40:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:40:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:40:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-28 00:40:58,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45987654320987653 [2024-06-28 00:40:58,880 INFO L175 Difference]: Start difference. First operand has 152 places, 305 transitions, 4056 flow. Second operand 6 states and 149 transitions. [2024-06-28 00:40:58,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 367 transitions, 5366 flow [2024-06-28 00:40:59,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 367 transitions, 4993 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-28 00:40:59,203 INFO L231 Difference]: Finished difference. Result has 154 places, 340 transitions, 4404 flow [2024-06-28 00:40:59,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3733, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4404, PETRI_PLACES=154, PETRI_TRANSITIONS=340} [2024-06-28 00:40:59,203 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 97 predicate places. [2024-06-28 00:40:59,203 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 340 transitions, 4404 flow [2024-06-28 00:40:59,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:40:59,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:40:59,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:40:59,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:40:59,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:40:59,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:40:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash -418645331, now seen corresponding path program 1 times [2024-06-28 00:40:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:40:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783428749] [2024-06-28 00:40:59,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:40:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:40:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:41:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:41:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:41:06,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783428749] [2024-06-28 00:41:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783428749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:41:06,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:41:06,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:41:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783092815] [2024-06-28 00:41:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:41:06,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:41:06,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:41:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:41:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:41:06,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:41:06,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 340 transitions, 4404 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:06,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:41:06,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:41:06,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:41:11,053 INFO L124 PetriNetUnfolderBase]: 10773/15348 cut-off events. [2024-06-28 00:41:11,053 INFO L125 PetriNetUnfolderBase]: For 274647/275087 co-relation queries the response was YES. [2024-06-28 00:41:11,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95826 conditions, 15348 events. 10773/15348 cut-off events. For 274647/275087 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 89996 event pairs, 3175 based on Foata normal form. 163/15435 useless extension candidates. Maximal degree in co-relation 95754. Up to 12418 conditions per place. [2024-06-28 00:41:11,193 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 365 selfloop transitions, 98 changer transitions 0/474 dead transitions. [2024-06-28 00:41:11,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 474 transitions, 6091 flow [2024-06-28 00:41:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:41:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:41:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 347 transitions. [2024-06-28 00:41:11,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943019943019943 [2024-06-28 00:41:11,195 INFO L175 Difference]: Start difference. First operand has 154 places, 340 transitions, 4404 flow. Second operand 13 states and 347 transitions. [2024-06-28 00:41:11,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 474 transitions, 6091 flow [2024-06-28 00:41:11,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 474 transitions, 6057 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-06-28 00:41:11,638 INFO L231 Difference]: Finished difference. Result has 168 places, 348 transitions, 4718 flow [2024-06-28 00:41:11,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4371, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4718, PETRI_PLACES=168, PETRI_TRANSITIONS=348} [2024-06-28 00:41:11,638 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 111 predicate places. [2024-06-28 00:41:11,638 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 348 transitions, 4718 flow [2024-06-28 00:41:11,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:11,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:41:11,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:41:11,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:41:11,639 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:41:11,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:41:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 510268999, now seen corresponding path program 2 times [2024-06-28 00:41:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:41:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133743542] [2024-06-28 00:41:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:41:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:41:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:41:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:41:18,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:41:18,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133743542] [2024-06-28 00:41:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133743542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:41:18,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:41:18,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:41:18,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911606865] [2024-06-28 00:41:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:41:18,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:41:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:41:18,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:41:18,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:41:18,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:41:18,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 348 transitions, 4718 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:18,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:41:18,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:41:18,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:41:24,100 INFO L124 PetriNetUnfolderBase]: 11616/16593 cut-off events. [2024-06-28 00:41:24,101 INFO L125 PetriNetUnfolderBase]: For 316772/317198 co-relation queries the response was YES. [2024-06-28 00:41:24,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105783 conditions, 16593 events. 11616/16593 cut-off events. For 316772/317198 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 98994 event pairs, 4315 based on Foata normal form. 121/16638 useless extension candidates. Maximal degree in co-relation 105706. Up to 14767 conditions per place. [2024-06-28 00:41:24,250 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 385 selfloop transitions, 66 changer transitions 0/462 dead transitions. [2024-06-28 00:41:24,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 462 transitions, 6240 flow [2024-06-28 00:41:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:41:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:41:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 322 transitions. [2024-06-28 00:41:24,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-06-28 00:41:24,252 INFO L175 Difference]: Start difference. First operand has 168 places, 348 transitions, 4718 flow. Second operand 12 states and 322 transitions. [2024-06-28 00:41:24,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 462 transitions, 6240 flow [2024-06-28 00:41:24,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 462 transitions, 6101 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-28 00:41:24,827 INFO L231 Difference]: Finished difference. Result has 175 places, 360 transitions, 4900 flow [2024-06-28 00:41:24,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4590, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4900, PETRI_PLACES=175, PETRI_TRANSITIONS=360} [2024-06-28 00:41:24,828 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 118 predicate places. [2024-06-28 00:41:24,828 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 360 transitions, 4900 flow [2024-06-28 00:41:24,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:24,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:41:24,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:41:24,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:41:24,828 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:41:24,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:41:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1213873297, now seen corresponding path program 3 times [2024-06-28 00:41:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:41:24,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436026244] [2024-06-28 00:41:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:41:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:41:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:41:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:41:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:41:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436026244] [2024-06-28 00:41:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436026244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:41:31,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:41:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:41:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026955805] [2024-06-28 00:41:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:41:31,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:41:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:41:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:41:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:41:31,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:41:31,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 360 transitions, 4900 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:31,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:41:31,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:41:31,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:41:36,522 INFO L124 PetriNetUnfolderBase]: 11562/16525 cut-off events. [2024-06-28 00:41:36,523 INFO L125 PetriNetUnfolderBase]: For 326713/327137 co-relation queries the response was YES. [2024-06-28 00:41:36,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106479 conditions, 16525 events. 11562/16525 cut-off events. For 326713/327137 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 98544 event pairs, 4515 based on Foata normal form. 95/16536 useless extension candidates. Maximal degree in co-relation 106398. Up to 15518 conditions per place. [2024-06-28 00:41:36,724 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 386 selfloop transitions, 48 changer transitions 0/445 dead transitions. [2024-06-28 00:41:36,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 445 transitions, 6117 flow [2024-06-28 00:41:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:41:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:41:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions. [2024-06-28 00:41:36,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205761316872428 [2024-06-28 00:41:36,727 INFO L175 Difference]: Start difference. First operand has 175 places, 360 transitions, 4900 flow. Second operand 9 states and 253 transitions. [2024-06-28 00:41:36,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 445 transitions, 6117 flow [2024-06-28 00:41:37,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 445 transitions, 6052 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 00:41:37,622 INFO L231 Difference]: Finished difference. Result has 181 places, 368 transitions, 5074 flow [2024-06-28 00:41:37,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4835, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5074, PETRI_PLACES=181, PETRI_TRANSITIONS=368} [2024-06-28 00:41:37,623 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 124 predicate places. [2024-06-28 00:41:37,624 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 368 transitions, 5074 flow [2024-06-28 00:41:37,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:37,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:41:37,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:41:37,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:41:37,624 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:41:37,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:41:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1385381131, now seen corresponding path program 4 times [2024-06-28 00:41:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:41:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831604935] [2024-06-28 00:41:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:41:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:41:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:41:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:41:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:41:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831604935] [2024-06-28 00:41:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831604935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:41:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:41:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:41:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064918352] [2024-06-28 00:41:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:41:45,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:41:45,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:41:45,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:41:45,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:41:45,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:41:45,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 368 transitions, 5074 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:45,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:41:45,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:41:45,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:41:51,337 INFO L124 PetriNetUnfolderBase]: 11884/17001 cut-off events. [2024-06-28 00:41:51,337 INFO L125 PetriNetUnfolderBase]: For 358450/358877 co-relation queries the response was YES. [2024-06-28 00:41:51,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111336 conditions, 17001 events. 11884/17001 cut-off events. For 358450/358877 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 101775 event pairs, 4371 based on Foata normal form. 111/17044 useless extension candidates. Maximal degree in co-relation 111251. Up to 15185 conditions per place. [2024-06-28 00:41:51,511 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 389 selfloop transitions, 85 changer transitions 0/485 dead transitions. [2024-06-28 00:41:51,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 485 transitions, 6750 flow [2024-06-28 00:41:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:41:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:41:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 296 transitions. [2024-06-28 00:41:51,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2024-06-28 00:41:51,514 INFO L175 Difference]: Start difference. First operand has 181 places, 368 transitions, 5074 flow. Second operand 11 states and 296 transitions. [2024-06-28 00:41:51,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 485 transitions, 6750 flow [2024-06-28 00:41:52,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 485 transitions, 6662 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-28 00:41:52,171 INFO L231 Difference]: Finished difference. Result has 192 places, 393 transitions, 5588 flow [2024-06-28 00:41:52,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4986, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5588, PETRI_PLACES=192, PETRI_TRANSITIONS=393} [2024-06-28 00:41:52,172 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 135 predicate places. [2024-06-28 00:41:52,172 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 393 transitions, 5588 flow [2024-06-28 00:41:52,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:52,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:41:52,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:41:52,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:41:52,173 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:41:52,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:41:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1385233261, now seen corresponding path program 5 times [2024-06-28 00:41:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:41:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917490976] [2024-06-28 00:41:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:41:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:41:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:41:59,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-06-28 00:41:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:41:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917490976] [2024-06-28 00:41:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917490976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:41:59,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:41:59,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:41:59,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917389532] [2024-06-28 00:41:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:41:59,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:41:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:41:59,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:41:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:41:59,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:41:59,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 393 transitions, 5588 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:41:59,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:41:59,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:41:59,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:42:04,834 INFO L124 PetriNetUnfolderBase]: 11899/17042 cut-off events. [2024-06-28 00:42:04,834 INFO L125 PetriNetUnfolderBase]: For 393222/393756 co-relation queries the response was YES. [2024-06-28 00:42:04,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113358 conditions, 17042 events. 11899/17042 cut-off events. For 393222/393756 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 102394 event pairs, 4525 based on Foata normal form. 223/17189 useless extension candidates. Maximal degree in co-relation 113266. Up to 15100 conditions per place. [2024-06-28 00:42:05,043 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 362 selfloop transitions, 120 changer transitions 0/493 dead transitions. [2024-06-28 00:42:05,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 493 transitions, 6901 flow [2024-06-28 00:42:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:42:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:42:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 337 transitions. [2024-06-28 00:42:05,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48005698005698005 [2024-06-28 00:42:05,057 INFO L175 Difference]: Start difference. First operand has 192 places, 393 transitions, 5588 flow. Second operand 13 states and 337 transitions. [2024-06-28 00:42:05,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 493 transitions, 6901 flow [2024-06-28 00:42:05,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 493 transitions, 6751 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-28 00:42:05,954 INFO L231 Difference]: Finished difference. Result has 201 places, 396 transitions, 5753 flow [2024-06-28 00:42:05,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5440, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5753, PETRI_PLACES=201, PETRI_TRANSITIONS=396} [2024-06-28 00:42:05,954 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 144 predicate places. [2024-06-28 00:42:05,954 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 396 transitions, 5753 flow [2024-06-28 00:42:05,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:42:05,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:42:05,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:42:05,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:42:05,955 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:42:05,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:42:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 275405415, now seen corresponding path program 6 times [2024-06-28 00:42:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:42:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363216661] [2024-06-28 00:42:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:42:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:42:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:42:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:42:12,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:42:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363216661] [2024-06-28 00:42:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363216661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:42:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:42:12,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:42:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269932145] [2024-06-28 00:42:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:42:12,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:42:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:42:12,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:42:12,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:42:12,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:42:12,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 396 transitions, 5753 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:42:12,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:42:12,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:42:12,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:42:17,558 INFO L124 PetriNetUnfolderBase]: 12719/18204 cut-off events. [2024-06-28 00:42:17,559 INFO L125 PetriNetUnfolderBase]: For 430657/431111 co-relation queries the response was YES. [2024-06-28 00:42:17,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120928 conditions, 18204 events. 12719/18204 cut-off events. For 430657/431111 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 109373 event pairs, 4217 based on Foata normal form. 224/18350 useless extension candidates. Maximal degree in co-relation 120834. Up to 16209 conditions per place. [2024-06-28 00:42:17,730 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 335 selfloop transitions, 113 changer transitions 0/459 dead transitions. [2024-06-28 00:42:17,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 459 transitions, 6964 flow [2024-06-28 00:42:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:42:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:42:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-06-28 00:42:17,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711934156378601 [2024-06-28 00:42:17,731 INFO L175 Difference]: Start difference. First operand has 201 places, 396 transitions, 5753 flow. Second operand 9 states and 229 transitions. [2024-06-28 00:42:17,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 459 transitions, 6964 flow [2024-06-28 00:42:18,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 459 transitions, 6696 flow, removed 20 selfloop flow, removed 11 redundant places. [2024-06-28 00:42:18,872 INFO L231 Difference]: Finished difference. Result has 199 places, 398 transitions, 5762 flow [2024-06-28 00:42:18,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5487, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5762, PETRI_PLACES=199, PETRI_TRANSITIONS=398} [2024-06-28 00:42:18,873 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 142 predicate places. [2024-06-28 00:42:18,873 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 398 transitions, 5762 flow [2024-06-28 00:42:18,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:42:18,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:42:18,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:42:18,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:42:18,874 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:42:18,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:42:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash 465143469, now seen corresponding path program 7 times [2024-06-28 00:42:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:42:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946419936] [2024-06-28 00:42:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:42:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:42:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:42:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:42:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:42:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946419936] [2024-06-28 00:42:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946419936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:42:24,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:42:24,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:42:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958887345] [2024-06-28 00:42:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:42:24,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:42:24,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:42:24,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:42:24,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:42:24,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:42:24,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 398 transitions, 5762 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:42:24,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:42:24,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:42:24,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:42:30,744 INFO L124 PetriNetUnfolderBase]: 13126/18830 cut-off events. [2024-06-28 00:42:30,744 INFO L125 PetriNetUnfolderBase]: For 444744/445189 co-relation queries the response was YES. [2024-06-28 00:42:30,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126175 conditions, 18830 events. 13126/18830 cut-off events. For 444744/445189 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 114112 event pairs, 4189 based on Foata normal form. 158/18910 useless extension candidates. Maximal degree in co-relation 126080. Up to 16381 conditions per place. [2024-06-28 00:42:30,921 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 378 selfloop transitions, 85 changer transitions 0/474 dead transitions. [2024-06-28 00:42:30,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 474 transitions, 7318 flow [2024-06-28 00:42:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:42:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:42:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-28 00:42:30,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2024-06-28 00:42:30,924 INFO L175 Difference]: Start difference. First operand has 199 places, 398 transitions, 5762 flow. Second operand 8 states and 209 transitions. [2024-06-28 00:42:30,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 474 transitions, 7318 flow [2024-06-28 00:42:31,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 474 transitions, 7076 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 00:42:31,795 INFO L231 Difference]: Finished difference. Result has 202 places, 419 transitions, 6109 flow [2024-06-28 00:42:31,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5540, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6109, PETRI_PLACES=202, PETRI_TRANSITIONS=419} [2024-06-28 00:42:31,796 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 145 predicate places. [2024-06-28 00:42:31,796 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 419 transitions, 6109 flow [2024-06-28 00:42:31,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:42:31,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:42:31,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:42:31,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:42:31,797 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:42:31,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:42:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 470653719, now seen corresponding path program 8 times [2024-06-28 00:42:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:42:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486226020] [2024-06-28 00:42:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:42:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:42:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:42:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:42:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:42:37,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486226020] [2024-06-28 00:42:37,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486226020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:42:37,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:42:37,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:42:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189449356] [2024-06-28 00:42:37,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:42:37,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:42:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:42:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:42:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:42:37,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-28 00:42:37,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 419 transitions, 6109 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:42:37,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:42:37,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-28 00:42:37,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand