./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe007_power.oepc-thin001_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/safe007_power.oepc-thin001_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe007_power.oepc-thin001_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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:39:59,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:39:59,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:39:59,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:39:59,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:39:59,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:39:59,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:39:59,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:39:59,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:39:59,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:39:59,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:39:59,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:39:59,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:39:59,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:39:59,497 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:39:59,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:39:59,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:39:59,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:39:59,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:39:59,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:39:59,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:39:59,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:39:59,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:39:59,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:39:59,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:39:59,499 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:39:59,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:39:59,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:39:59,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:39:59,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:39:59,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:39:59,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:39:59,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:39:59,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:39:59,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:39:59,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:39:59,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:39:59,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:39:59,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:39:59,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:39:59,504 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:39:59,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:39:59,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:39:59,504 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:39:59,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:39:59,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:39:59,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:39:59,778 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:39:59,778 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:39:59,779 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/safe007_power.oepc-thin001_power.oepc.yml/witness.yml [2024-06-27 22:39:59,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:39:59,885 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:39:59,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2024-06-27 22:40:01,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:40:01,322 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:40:01,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2024-06-27 22:40:01,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ccaeb95/e618630c63c0490fbe41e1d757cec978/FLAG541dbf120 [2024-06-27 22:40:01,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ccaeb95/e618630c63c0490fbe41e1d757cec978 [2024-06-27 22:40:01,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:40:01,360 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:40:01,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:40:01,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:40:01,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:40:01,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:39:59" (1/2) ... [2024-06-27 22:40:01,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1fc95e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:40:01, skipping insertion in model container [2024-06-27 22:40:01,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:39:59" (1/2) ... [2024-06-27 22:40:01,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@52c865c1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:40:01, skipping insertion in model container [2024-06-27 22:40:01,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:40:01" (2/2) ... [2024-06-27 22:40:01,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1fc95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:01, skipping insertion in model container [2024-06-27 22:40:01,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:40:01" (2/2) ... [2024-06-27 22:40:01,378 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:40:01,413 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:40:01,414 INFO L97 edCorrectnessWitness]: Location invariant before [L842-L842] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 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 )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1_used >= 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 )z$mem_tmp) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )y) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$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 )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 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 )x) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )z$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 )z - (long long )z$mem_tmp >= 0LL) [2024-06-27 22:40:01,414 INFO L97 edCorrectnessWitness]: Location invariant before [L843-L843] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 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 )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1_used >= 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 )z$mem_tmp) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )y) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$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 )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 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 )x) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )z$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 )z - (long long )z$mem_tmp >= 0LL) [2024-06-27 22:40:01,414 INFO L97 edCorrectnessWitness]: Location invariant before [L840-L840] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 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 )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1_used >= 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 )z$mem_tmp) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )y) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$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 )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$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 )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 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 )x) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )z$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 )z - (long long )z$mem_tmp >= 0LL) [2024-06-27 22:40:01,414 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:40:01,414 INFO L106 edCorrectnessWitness]: ghost_update [L838-L838] multithreaded = 1; [2024-06-27 22:40:01,483 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:40:01,639 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2024-06-27 22:40:01,814 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:40:01,828 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:40:01,874 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i[1014,1027] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:40:02,102 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:40:02,150 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:40:02,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02 WrapperNode [2024-06-27 22:40:02,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:40:02,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:40:02,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:40:02,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:40:02,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,241 INFO L138 Inliner]: procedures = 175, calls = 63, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2024-06-27 22:40:02,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:40:02,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:40:02,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:40:02,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:40:02,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,314 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-27 22:40:02,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:40:02,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:40:02,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:40:02,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:40:02,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (1/1) ... [2024-06-27 22:40:02,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:40:02,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:40:02,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:40:02,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 22:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 22:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 22:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 22:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:40:02,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:40:02,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:40:02,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:40:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:40:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 22:40:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:40:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:40:02,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:40:02,441 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:40:02,621 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:40:02,624 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:40:03,424 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:40:03,424 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:40:03,829 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:40:03,829 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:40:03,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:40:03 BoogieIcfgContainer [2024-06-27 22:40:03,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:40:03,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:40:03,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:40:03,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:40:03,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:39:59" (1/4) ... [2024-06-27 22:40:03,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2a2aa8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:40:03, skipping insertion in model container [2024-06-27 22:40:03,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:40:01" (2/4) ... [2024-06-27 22:40:03,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2a2aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:40:03, skipping insertion in model container [2024-06-27 22:40:03,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:40:02" (3/4) ... [2024-06-27 22:40:03,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2a2aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:40:03, skipping insertion in model container [2024-06-27 22:40:03,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:40:03" (4/4) ... [2024-06-27 22:40:03,841 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2024-06-27 22:40:03,858 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:40:03,859 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:40:03,859 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:40:03,942 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:40:03,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:40:04,029 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:40:04,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:40:04,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 22:40:04,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:40:04,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 41 transitions, 91 flow [2024-06-27 22:40:04,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:40:04,058 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;@4bee41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:40:04,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:40:04,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:40:04,066 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:40:04,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:40:04,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:04,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:40:04,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:04,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 612567056, now seen corresponding path program 1 times [2024-06-27 22:40:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169455606] [2024-06-27 22:40:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169455606] [2024-06-27 22:40:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169455606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:07,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:40:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847175000] [2024-06-27 22:40:07,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:07,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:40:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:07,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:40:07,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:40:07,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:40:07,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:07,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:07,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:40:07,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:08,429 INFO L124 PetriNetUnfolderBase]: 1898/3010 cut-off events. [2024-06-27 22:40:08,429 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-06-27 22:40:08,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5863 conditions, 3010 events. 1898/3010 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 17463 event pairs, 1194 based on Foata normal form. 0/2892 useless extension candidates. Maximal degree in co-relation 5851. Up to 2792 conditions per place. [2024-06-27 22:40:08,452 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 43 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-06-27 22:40:08,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 227 flow [2024-06-27 22:40:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:40:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:40:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 22:40:08,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-06-27 22:40:08,466 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 91 flow. Second operand 3 states and 93 transitions. [2024-06-27 22:40:08,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 227 flow [2024-06-27 22:40:08,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:40:08,475 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 125 flow [2024-06-27 22:40:08,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-27 22:40:08,480 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2024-06-27 22:40:08,481 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 125 flow [2024-06-27 22:40:08,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:08,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:08,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:08,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:40:08,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:08,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 266479439, now seen corresponding path program 1 times [2024-06-27 22:40:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899712796] [2024-06-27 22:40:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:12,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899712796] [2024-06-27 22:40:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899712796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:12,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:12,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:40:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847283526] [2024-06-27 22:40:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:12,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:40:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:40:12,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:40:12,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:40:12,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:12,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:12,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:40:12,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:13,954 INFO L124 PetriNetUnfolderBase]: 1892/2858 cut-off events. [2024-06-27 22:40:13,955 INFO L125 PetriNetUnfolderBase]: For 568/598 co-relation queries the response was YES. [2024-06-27 22:40:13,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6530 conditions, 2858 events. 1892/2858 cut-off events. For 568/598 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 15798 event pairs, 838 based on Foata normal form. 6/2856 useless extension candidates. Maximal degree in co-relation 6518. Up to 2750 conditions per place. [2024-06-27 22:40:13,973 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 60 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2024-06-27 22:40:13,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 355 flow [2024-06-27 22:40:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:40:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:40:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-27 22:40:13,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6702127659574468 [2024-06-27 22:40:13,977 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 125 flow. Second operand 4 states and 126 transitions. [2024-06-27 22:40:13,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 355 flow [2024-06-27 22:40:13,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:40:13,981 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 188 flow [2024-06-27 22:40:13,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-06-27 22:40:13,984 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-06-27 22:40:13,985 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 188 flow [2024-06-27 22:40:13,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:13,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:13,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:13,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:40:13,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:13,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash -329070104, now seen corresponding path program 1 times [2024-06-27 22:40:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599047110] [2024-06-27 22:40:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:13,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:19,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:19,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599047110] [2024-06-27 22:40:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599047110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:19,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:40:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560055548] [2024-06-27 22:40:19,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:19,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:40:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:40:19,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:40:19,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:40:19,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:19,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:19,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:40:19,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:20,807 INFO L124 PetriNetUnfolderBase]: 2602/3983 cut-off events. [2024-06-27 22:40:20,808 INFO L125 PetriNetUnfolderBase]: For 2320/2332 co-relation queries the response was YES. [2024-06-27 22:40:20,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9974 conditions, 3983 events. 2602/3983 cut-off events. For 2320/2332 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22322 event pairs, 828 based on Foata normal form. 3/3978 useless extension candidates. Maximal degree in co-relation 9959. Up to 3717 conditions per place. [2024-06-27 22:40:20,832 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 86 selfloop transitions, 12 changer transitions 0/107 dead transitions. [2024-06-27 22:40:20,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 107 transitions, 548 flow [2024-06-27 22:40:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:40:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:40:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-06-27 22:40:20,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6553191489361702 [2024-06-27 22:40:20,834 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 188 flow. Second operand 5 states and 154 transitions. [2024-06-27 22:40:20,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 107 transitions, 548 flow [2024-06-27 22:40:20,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 107 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:40:20,840 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 307 flow [2024-06-27 22:40:20,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-06-27 22:40:20,841 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2024-06-27 22:40:20,841 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 307 flow [2024-06-27 22:40:20,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:20,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:20,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:20,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:40:20,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:20,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1591271111, now seen corresponding path program 1 times [2024-06-27 22:40:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:20,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313828442] [2024-06-27 22:40:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:25,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:25,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313828442] [2024-06-27 22:40:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313828442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:25,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:25,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:40:25,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752228449] [2024-06-27 22:40:25,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:40:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:25,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:40:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:40:25,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-06-27 22:40:25,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:25,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:25,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-06-27 22:40:25,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:27,421 INFO L124 PetriNetUnfolderBase]: 2593/3968 cut-off events. [2024-06-27 22:40:27,421 INFO L125 PetriNetUnfolderBase]: For 3456/3468 co-relation queries the response was YES. [2024-06-27 22:40:27,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10919 conditions, 3968 events. 2593/3968 cut-off events. For 3456/3468 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22271 event pairs, 507 based on Foata normal form. 6/3966 useless extension candidates. Maximal degree in co-relation 10899. Up to 3640 conditions per place. [2024-06-27 22:40:27,455 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 97 selfloop transitions, 14 changer transitions 0/120 dead transitions. [2024-06-27 22:40:27,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 120 transitions, 669 flow [2024-06-27 22:40:27,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:40:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:40:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-27 22:40:27,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-06-27 22:40:27,459 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 307 flow. Second operand 6 states and 180 transitions. [2024-06-27 22:40:27,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 120 transitions, 669 flow [2024-06-27 22:40:27,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 667 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 22:40:27,468 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 348 flow [2024-06-27 22:40:27,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-27 22:40:27,470 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2024-06-27 22:40:27,470 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 348 flow [2024-06-27 22:40:27,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:27,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:27,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:27,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:40:27,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:27,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1165275784, now seen corresponding path program 1 times [2024-06-27 22:40:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260405194] [2024-06-27 22:40:27,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260405194] [2024-06-27 22:40:33,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260405194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:33,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:40:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763602531] [2024-06-27 22:40:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:33,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:40:33,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:40:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:40:33,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:40:33,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 348 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-27 22:40:33,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:33,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:40:33,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:35,536 INFO L124 PetriNetUnfolderBase]: 2624/4023 cut-off events. [2024-06-27 22:40:35,536 INFO L125 PetriNetUnfolderBase]: For 4909/4941 co-relation queries the response was YES. [2024-06-27 22:40:35,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11740 conditions, 4023 events. 2624/4023 cut-off events. For 4909/4941 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22749 event pairs, 681 based on Foata normal form. 26/4043 useless extension candidates. Maximal degree in co-relation 11716. Up to 3639 conditions per place. [2024-06-27 22:40:35,558 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 124 selfloop transitions, 27 changer transitions 0/159 dead transitions. [2024-06-27 22:40:35,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 159 transitions, 918 flow [2024-06-27 22:40:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:40:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:40:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 254 transitions. [2024-06-27 22:40:35,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6004728132387707 [2024-06-27 22:40:35,565 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 348 flow. Second operand 9 states and 254 transitions. [2024-06-27 22:40:35,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 159 transitions, 918 flow [2024-06-27 22:40:35,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 159 transitions, 887 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 22:40:35,573 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 425 flow [2024-06-27 22:40:35,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=425, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-06-27 22:40:35,576 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2024-06-27 22:40:35,576 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 425 flow [2024-06-27 22:40:35,577 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-27 22:40:35,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:35,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:35,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:40:35,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:35,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1165155814, now seen corresponding path program 2 times [2024-06-27 22:40:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324766709] [2024-06-27 22:40:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324766709] [2024-06-27 22:40:41,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324766709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:41,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:41,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:40:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532519303] [2024-06-27 22:40:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:41,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:40:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:40:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:40:41,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:40:41,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 425 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-27 22:40:41,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:41,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:40:41,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:42,637 INFO L124 PetriNetUnfolderBase]: 2752/4217 cut-off events. [2024-06-27 22:40:42,637 INFO L125 PetriNetUnfolderBase]: For 7671/7726 co-relation queries the response was YES. [2024-06-27 22:40:42,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 4217 events. 2752/4217 cut-off events. For 7671/7726 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 23896 event pairs, 706 based on Foata normal form. 30/4234 useless extension candidates. Maximal degree in co-relation 13400. Up to 3812 conditions per place. [2024-06-27 22:40:42,665 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 86 selfloop transitions, 30 changer transitions 0/124 dead transitions. [2024-06-27 22:40:42,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 124 transitions, 893 flow [2024-06-27 22:40:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:40:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:40:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-06-27 22:40:42,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-06-27 22:40:42,668 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 425 flow. Second operand 6 states and 162 transitions. [2024-06-27 22:40:42,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 124 transitions, 893 flow [2024-06-27 22:40:42,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 766 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-27 22:40:42,682 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 540 flow [2024-06-27 22:40:42,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2024-06-27 22:40:42,686 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2024-06-27 22:40:42,686 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 540 flow [2024-06-27 22:40:42,686 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-27 22:40:42,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:42,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:42,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:40:42,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:42,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 671005752, now seen corresponding path program 3 times [2024-06-27 22:40:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:42,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998827529] [2024-06-27 22:40:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998827529] [2024-06-27 22:40:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998827529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:40:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171914009] [2024-06-27 22:40:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:46,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:40:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:40:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:40:46,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:40:46,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 540 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-27 22:40:46,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:46,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:40:46,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:47,874 INFO L124 PetriNetUnfolderBase]: 2780/4246 cut-off events. [2024-06-27 22:40:47,874 INFO L125 PetriNetUnfolderBase]: For 7395/7454 co-relation queries the response was YES. [2024-06-27 22:40:47,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13414 conditions, 4246 events. 2780/4246 cut-off events. For 7395/7454 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23995 event pairs, 726 based on Foata normal form. 26/4256 useless extension candidates. Maximal degree in co-relation 13387. Up to 3802 conditions per place. [2024-06-27 22:40:47,903 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 73 selfloop transitions, 32 changer transitions 0/113 dead transitions. [2024-06-27 22:40:47,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 845 flow [2024-06-27 22:40:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:40:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:40:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-06-27 22:40:47,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141843971631206 [2024-06-27 22:40:47,905 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 540 flow. Second operand 6 states and 145 transitions. [2024-06-27 22:40:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 845 flow [2024-06-27 22:40:47,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 113 transitions, 811 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 22:40:47,919 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 625 flow [2024-06-27 22:40:47,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=625, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2024-06-27 22:40:47,920 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2024-06-27 22:40:47,920 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 625 flow [2024-06-27 22:40:47,920 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-27 22:40:47,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:47,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:47,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:40:47,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:47,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2109356242, now seen corresponding path program 1 times [2024-06-27 22:40:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:47,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750818885] [2024-06-27 22:40:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:52,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750818885] [2024-06-27 22:40:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750818885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:52,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:40:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969773069] [2024-06-27 22:40:52,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:52,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:40:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:52,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:40:52,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:40:52,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:40:52,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 625 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:52,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:52,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:40:52,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:54,287 INFO L124 PetriNetUnfolderBase]: 3568/5379 cut-off events. [2024-06-27 22:40:54,288 INFO L125 PetriNetUnfolderBase]: For 11181/11215 co-relation queries the response was YES. [2024-06-27 22:40:54,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16942 conditions, 5379 events. 3568/5379 cut-off events. For 11181/11215 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 29976 event pairs, 852 based on Foata normal form. 37/5412 useless extension candidates. Maximal degree in co-relation 16912. Up to 4798 conditions per place. [2024-06-27 22:40:54,314 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 100 selfloop transitions, 29 changer transitions 0/136 dead transitions. [2024-06-27 22:40:54,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 136 transitions, 1083 flow [2024-06-27 22:40:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:40:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:40:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-06-27 22:40:54,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2024-06-27 22:40:54,316 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 625 flow. Second operand 7 states and 164 transitions. [2024-06-27 22:40:54,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 136 transitions, 1083 flow [2024-06-27 22:40:54,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 136 transitions, 1038 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:40:54,329 INFO L231 Difference]: Finished difference. Result has 82 places, 95 transitions, 748 flow [2024-06-27 22:40:54,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=82, PETRI_TRANSITIONS=95} [2024-06-27 22:40:54,330 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2024-06-27 22:40:54,330 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 95 transitions, 748 flow [2024-06-27 22:40:54,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:54,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:54,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:54,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:40:54,331 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:54,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash -564490314, now seen corresponding path program 1 times [2024-06-27 22:40:54,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:54,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132405396] [2024-06-27 22:40:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:57,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132405396] [2024-06-27 22:40:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132405396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:57,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:40:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510834569] [2024-06-27 22:40:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:57,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:40:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:40:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:40:57,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:40:57,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 95 transitions, 748 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:57,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:57,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:40:57,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:58,501 INFO L124 PetriNetUnfolderBase]: 3364/5093 cut-off events. [2024-06-27 22:40:58,501 INFO L125 PetriNetUnfolderBase]: For 13077/13092 co-relation queries the response was YES. [2024-06-27 22:40:58,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16764 conditions, 5093 events. 3364/5093 cut-off events. For 13077/13092 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 28353 event pairs, 924 based on Foata normal form. 21/5064 useless extension candidates. Maximal degree in co-relation 16732. Up to 4476 conditions per place. [2024-06-27 22:40:58,530 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 79 selfloop transitions, 33 changer transitions 0/126 dead transitions. [2024-06-27 22:40:58,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 1082 flow [2024-06-27 22:40:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:40:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:40:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-06-27 22:40:58,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548936170212766 [2024-06-27 22:40:58,533 INFO L175 Difference]: Start difference. First operand has 82 places, 95 transitions, 748 flow. Second operand 5 states and 129 transitions. [2024-06-27 22:40:58,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 1082 flow [2024-06-27 22:40:58,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 126 transitions, 1024 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 22:40:58,551 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 816 flow [2024-06-27 22:40:58,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=816, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2024-06-27 22:40:58,553 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2024-06-27 22:40:58,553 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 816 flow [2024-06-27 22:40:58,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:58,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:58,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:58,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:40:58,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:58,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -381984361, now seen corresponding path program 1 times [2024-06-27 22:40:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:58,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485451607] [2024-06-27 22:40:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485451607] [2024-06-27 22:41:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485451607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:03,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:03,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:41:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546563200] [2024-06-27 22:41:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:03,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:41:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:41:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:41:04,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:41:04,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 816 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-27 22:41:04,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:04,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:41:04,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:06,187 INFO L124 PetriNetUnfolderBase]: 3932/6091 cut-off events. [2024-06-27 22:41:06,187 INFO L125 PetriNetUnfolderBase]: For 19236/19337 co-relation queries the response was YES. [2024-06-27 22:41:06,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21716 conditions, 6091 events. 3932/6091 cut-off events. For 19236/19337 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 36279 event pairs, 536 based on Foata normal form. 67/6135 useless extension candidates. Maximal degree in co-relation 21682. Up to 4662 conditions per place. [2024-06-27 22:41:06,214 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 153 selfloop transitions, 46 changer transitions 0/209 dead transitions. [2024-06-27 22:41:06,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 209 transitions, 1615 flow [2024-06-27 22:41:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:41:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:41:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 270 transitions. [2024-06-27 22:41:06,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-06-27 22:41:06,216 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 816 flow. Second operand 10 states and 270 transitions. [2024-06-27 22:41:06,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 209 transitions, 1615 flow [2024-06-27 22:41:06,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 209 transitions, 1605 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 22:41:06,263 INFO L231 Difference]: Finished difference. Result has 94 places, 112 transitions, 1067 flow [2024-06-27 22:41:06,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=94, PETRI_TRANSITIONS=112} [2024-06-27 22:41:06,264 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2024-06-27 22:41:06,264 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 112 transitions, 1067 flow [2024-06-27 22:41:06,264 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-27 22:41:06,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:06,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:06,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:41:06,265 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:06,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1153676473, now seen corresponding path program 2 times [2024-06-27 22:41:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952714614] [2024-06-27 22:41:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952714614] [2024-06-27 22:41:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952714614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:41:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022618392] [2024-06-27 22:41:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:11,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:41:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:41:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:41:11,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:41:11,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 112 transitions, 1067 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-27 22:41:11,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:11,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:41:11,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:14,179 INFO L124 PetriNetUnfolderBase]: 4085/6338 cut-off events. [2024-06-27 22:41:14,179 INFO L125 PetriNetUnfolderBase]: For 24647/24728 co-relation queries the response was YES. [2024-06-27 22:41:14,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23887 conditions, 6338 events. 4085/6338 cut-off events. For 24647/24728 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 38047 event pairs, 843 based on Foata normal form. 89/6406 useless extension candidates. Maximal degree in co-relation 23848. Up to 5256 conditions per place. [2024-06-27 22:41:14,213 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 146 selfloop transitions, 59 changer transitions 0/215 dead transitions. [2024-06-27 22:41:14,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 215 transitions, 1750 flow [2024-06-27 22:41:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 292 transitions. [2024-06-27 22:41:14,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5647969052224371 [2024-06-27 22:41:14,216 INFO L175 Difference]: Start difference. First operand has 94 places, 112 transitions, 1067 flow. Second operand 11 states and 292 transitions. [2024-06-27 22:41:14,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 215 transitions, 1750 flow [2024-06-27 22:41:14,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 215 transitions, 1714 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 22:41:14,273 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 1172 flow [2024-06-27 22:41:14,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1172, PETRI_PLACES=101, PETRI_TRANSITIONS=113} [2024-06-27 22:41:14,274 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2024-06-27 22:41:14,274 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 1172 flow [2024-06-27 22:41:14,274 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-27 22:41:14,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:14,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:14,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:41:14,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:14,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash -405477541, now seen corresponding path program 3 times [2024-06-27 22:41:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:14,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541161178] [2024-06-27 22:41:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541161178] [2024-06-27 22:41:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541161178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:23,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:41:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633096280] [2024-06-27 22:41:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:23,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:41:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:41:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:41:23,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:41:23,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 113 transitions, 1172 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-27 22:41:23,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:23,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:41:23,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:25,441 INFO L124 PetriNetUnfolderBase]: 4451/6868 cut-off events. [2024-06-27 22:41:25,442 INFO L125 PetriNetUnfolderBase]: For 31877/31933 co-relation queries the response was YES. [2024-06-27 22:41:25,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26803 conditions, 6868 events. 4451/6868 cut-off events. For 31877/31933 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 41489 event pairs, 945 based on Foata normal form. 56/6896 useless extension candidates. Maximal degree in co-relation 26762. Up to 5595 conditions per place. [2024-06-27 22:41:25,484 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 117 selfloop transitions, 48 changer transitions 0/175 dead transitions. [2024-06-27 22:41:25,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 175 transitions, 1704 flow [2024-06-27 22:41:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:41:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:41:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 22:41:25,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5452127659574468 [2024-06-27 22:41:25,486 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 1172 flow. Second operand 8 states and 205 transitions. [2024-06-27 22:41:25,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 175 transitions, 1704 flow [2024-06-27 22:41:25,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 175 transitions, 1583 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 22:41:25,546 INFO L231 Difference]: Finished difference. Result has 100 places, 117 transitions, 1215 flow [2024-06-27 22:41:25,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1215, PETRI_PLACES=100, PETRI_TRANSITIONS=117} [2024-06-27 22:41:25,546 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2024-06-27 22:41:25,547 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 117 transitions, 1215 flow [2024-06-27 22:41:25,547 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-27 22:41:25,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:25,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:25,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:41:25,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:25,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 591470423, now seen corresponding path program 4 times [2024-06-27 22:41:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:25,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157400574] [2024-06-27 22:41:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157400574] [2024-06-27 22:41:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157400574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:41:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061430980] [2024-06-27 22:41:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:30,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:41:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:41:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:41:30,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:41:30,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 117 transitions, 1215 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-27 22:41:30,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:30,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:41:30,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:31,972 INFO L124 PetriNetUnfolderBase]: 4469/6864 cut-off events. [2024-06-27 22:41:31,972 INFO L125 PetriNetUnfolderBase]: For 34973/35058 co-relation queries the response was YES. [2024-06-27 22:41:31,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27012 conditions, 6864 events. 4469/6864 cut-off events. For 34973/35058 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 41364 event pairs, 956 based on Foata normal form. 59/6880 useless extension candidates. Maximal degree in co-relation 26970. Up to 5218 conditions per place. [2024-06-27 22:41:32,019 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 100 selfloop transitions, 53 changer transitions 0/163 dead transitions. [2024-06-27 22:41:32,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 163 transitions, 1656 flow [2024-06-27 22:41:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:41:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:41:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-06-27 22:41:32,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5349544072948328 [2024-06-27 22:41:32,021 INFO L175 Difference]: Start difference. First operand has 100 places, 117 transitions, 1215 flow. Second operand 7 states and 176 transitions. [2024-06-27 22:41:32,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 163 transitions, 1656 flow [2024-06-27 22:41:32,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 163 transitions, 1559 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:41:32,100 INFO L231 Difference]: Finished difference. Result has 101 places, 119 transitions, 1266 flow [2024-06-27 22:41:32,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1266, PETRI_PLACES=101, PETRI_TRANSITIONS=119} [2024-06-27 22:41:32,101 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 50 predicate places. [2024-06-27 22:41:32,101 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 119 transitions, 1266 flow [2024-06-27 22:41:32,101 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-27 22:41:32,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:32,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:32,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:41:32,102 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:32,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:32,102 INFO L85 PathProgramCache]: Analyzing trace with hash -347033989, now seen corresponding path program 1 times [2024-06-27 22:41:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652299464] [2024-06-27 22:41:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652299464] [2024-06-27 22:41:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652299464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:35,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:35,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:41:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370196775] [2024-06-27 22:41:35,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:35,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:41:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:41:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:41:35,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:41:35,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 119 transitions, 1266 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-27 22:41:35,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:35,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:41:35,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:37,572 INFO L124 PetriNetUnfolderBase]: 4532/7318 cut-off events. [2024-06-27 22:41:37,572 INFO L125 PetriNetUnfolderBase]: For 36053/36078 co-relation queries the response was YES. [2024-06-27 22:41:37,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27760 conditions, 7318 events. 4532/7318 cut-off events. For 36053/36078 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 45947 event pairs, 1568 based on Foata normal form. 21/7296 useless extension candidates. Maximal degree in co-relation 27718. Up to 6392 conditions per place. [2024-06-27 22:41:37,609 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 121 selfloop transitions, 32 changer transitions 0/169 dead transitions. [2024-06-27 22:41:37,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 1801 flow [2024-06-27 22:41:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:41:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:41:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-27 22:41:37,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2024-06-27 22:41:37,610 INFO L175 Difference]: Start difference. First operand has 101 places, 119 transitions, 1266 flow. Second operand 6 states and 154 transitions. [2024-06-27 22:41:37,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 1801 flow [2024-06-27 22:41:37,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 169 transitions, 1706 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 22:41:37,656 INFO L231 Difference]: Finished difference. Result has 105 places, 136 transitions, 1405 flow [2024-06-27 22:41:37,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1405, PETRI_PLACES=105, PETRI_TRANSITIONS=136} [2024-06-27 22:41:37,657 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2024-06-27 22:41:37,657 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 136 transitions, 1405 flow [2024-06-27 22:41:37,657 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-27 22:41:37,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:37,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:37,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:41:37,657 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:37,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash 320824884, now seen corresponding path program 1 times [2024-06-27 22:41:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:37,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836335890] [2024-06-27 22:41:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836335890] [2024-06-27 22:41:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836335890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777822302] [2024-06-27 22:41:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:45,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:45,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:45,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:41:45,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 136 transitions, 1405 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:45,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:45,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:41:45,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:48,229 INFO L124 PetriNetUnfolderBase]: 5401/8318 cut-off events. [2024-06-27 22:41:48,229 INFO L125 PetriNetUnfolderBase]: For 42370/42382 co-relation queries the response was YES. [2024-06-27 22:41:48,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34483 conditions, 8318 events. 5401/8318 cut-off events. For 42370/42382 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 50498 event pairs, 1164 based on Foata normal form. 22/8335 useless extension candidates. Maximal degree in co-relation 34436. Up to 6800 conditions per place. [2024-06-27 22:41:48,288 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 176 selfloop transitions, 60 changer transitions 0/243 dead transitions. [2024-06-27 22:41:48,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 243 transitions, 2315 flow [2024-06-27 22:41:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:41:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:41:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 264 transitions. [2024-06-27 22:41:48,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5617021276595745 [2024-06-27 22:41:48,290 INFO L175 Difference]: Start difference. First operand has 105 places, 136 transitions, 1405 flow. Second operand 10 states and 264 transitions. [2024-06-27 22:41:48,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 243 transitions, 2315 flow [2024-06-27 22:41:48,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 243 transitions, 2301 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-27 22:41:48,497 INFO L231 Difference]: Finished difference. Result has 118 places, 151 transitions, 1753 flow [2024-06-27 22:41:48,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1753, PETRI_PLACES=118, PETRI_TRANSITIONS=151} [2024-06-27 22:41:48,498 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2024-06-27 22:41:48,498 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 151 transitions, 1753 flow [2024-06-27 22:41:48,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:48,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:48,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:48,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:41:48,499 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:48,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:48,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1619599272, now seen corresponding path program 2 times [2024-06-27 22:41:48,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:48,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657505800] [2024-06-27 22:41:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657505800] [2024-06-27 22:41:54,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657505800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:54,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:54,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495365047] [2024-06-27 22:41:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:54,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:54,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:54,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:41:54,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 151 transitions, 1753 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:54,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:54,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:41:54,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:58,077 INFO L124 PetriNetUnfolderBase]: 5775/8979 cut-off events. [2024-06-27 22:41:58,077 INFO L125 PetriNetUnfolderBase]: For 56874/56939 co-relation queries the response was YES. [2024-06-27 22:41:58,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39059 conditions, 8979 events. 5775/8979 cut-off events. For 56874/56939 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 56166 event pairs, 1279 based on Foata normal form. 70/9045 useless extension candidates. Maximal degree in co-relation 39005. Up to 7528 conditions per place. [2024-06-27 22:41:58,137 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 206 selfloop transitions, 75 changer transitions 0/288 dead transitions. [2024-06-27 22:41:58,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3110 flow [2024-06-27 22:41:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:41:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:41:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 311 transitions. [2024-06-27 22:41:58,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5090016366612111 [2024-06-27 22:41:58,140 INFO L175 Difference]: Start difference. First operand has 118 places, 151 transitions, 1753 flow. Second operand 13 states and 311 transitions. [2024-06-27 22:41:58,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3110 flow [2024-06-27 22:41:58,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 288 transitions, 2921 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 22:41:58,284 INFO L231 Difference]: Finished difference. Result has 130 places, 188 transitions, 2374 flow [2024-06-27 22:41:58,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2374, PETRI_PLACES=130, PETRI_TRANSITIONS=188} [2024-06-27 22:41:58,284 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 79 predicate places. [2024-06-27 22:41:58,285 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 188 transitions, 2374 flow [2024-06-27 22:41:58,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:58,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:58,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:58,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:41:58,285 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:58,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash 166358200, now seen corresponding path program 3 times [2024-06-27 22:41:58,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:58,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281850030] [2024-06-27 22:41:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281850030] [2024-06-27 22:42:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281850030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:04,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:42:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583926398] [2024-06-27 22:42:04,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:04,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:42:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:04,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:42:04,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:42:04,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:42:04,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 188 transitions, 2374 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:04,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:04,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:42:04,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:07,628 INFO L124 PetriNetUnfolderBase]: 6077/9485 cut-off events. [2024-06-27 22:42:07,629 INFO L125 PetriNetUnfolderBase]: For 66845/66922 co-relation queries the response was YES. [2024-06-27 22:42:07,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42800 conditions, 9485 events. 6077/9485 cut-off events. For 66845/66922 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 59941 event pairs, 1229 based on Foata normal form. 79/9560 useless extension candidates. Maximal degree in co-relation 42742. Up to 6495 conditions per place. [2024-06-27 22:42:07,702 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 176 selfloop transitions, 103 changer transitions 0/286 dead transitions. [2024-06-27 22:42:07,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 286 transitions, 3334 flow [2024-06-27 22:42:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:42:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:42:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 272 transitions. [2024-06-27 22:42:07,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261121856866537 [2024-06-27 22:42:07,705 INFO L175 Difference]: Start difference. First operand has 130 places, 188 transitions, 2374 flow. Second operand 11 states and 272 transitions. [2024-06-27 22:42:07,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 286 transitions, 3334 flow [2024-06-27 22:42:07,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 286 transitions, 3242 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 22:42:07,906 INFO L231 Difference]: Finished difference. Result has 140 places, 196 transitions, 2673 flow [2024-06-27 22:42:07,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2673, PETRI_PLACES=140, PETRI_TRANSITIONS=196} [2024-06-27 22:42:07,906 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 89 predicate places. [2024-06-27 22:42:07,907 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 196 transitions, 2673 flow [2024-06-27 22:42:07,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:07,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:07,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:07,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:42:07,907 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:07,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1161440696, now seen corresponding path program 4 times [2024-06-27 22:42:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:07,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655863474] [2024-06-27 22:42:07,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:07,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655863474] [2024-06-27 22:42:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655863474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:42:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651088028] [2024-06-27 22:42:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:12,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:42:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:12,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:42:12,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:42:12,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:42:12,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 196 transitions, 2673 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:12,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:12,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:42:12,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:15,681 INFO L124 PetriNetUnfolderBase]: 6057/9465 cut-off events. [2024-06-27 22:42:15,681 INFO L125 PetriNetUnfolderBase]: For 73511/73588 co-relation queries the response was YES. [2024-06-27 22:42:15,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44610 conditions, 9465 events. 6057/9465 cut-off events. For 73511/73588 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 59862 event pairs, 1119 based on Foata normal form. 79/9540 useless extension candidates. Maximal degree in co-relation 44547. Up to 6721 conditions per place. [2024-06-27 22:42:15,759 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 162 selfloop transitions, 103 changer transitions 0/272 dead transitions. [2024-06-27 22:42:15,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 272 transitions, 3405 flow [2024-06-27 22:42:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:42:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:42:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-06-27 22:42:15,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-06-27 22:42:15,761 INFO L175 Difference]: Start difference. First operand has 140 places, 196 transitions, 2673 flow. Second operand 10 states and 245 transitions. [2024-06-27 22:42:15,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 272 transitions, 3405 flow [2024-06-27 22:42:15,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 272 transitions, 3233 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 22:42:15,953 INFO L231 Difference]: Finished difference. Result has 144 places, 195 transitions, 2685 flow [2024-06-27 22:42:15,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2471, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2685, PETRI_PLACES=144, PETRI_TRANSITIONS=195} [2024-06-27 22:42:15,954 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 93 predicate places. [2024-06-27 22:42:15,954 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 195 transitions, 2685 flow [2024-06-27 22:42:15,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:15,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:15,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-27 22:42:15,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:42:15,955 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:15,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2126850451, now seen corresponding path program 1 times [2024-06-27 22:42:15,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:15,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668399246] [2024-06-27 22:42:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:15,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:20,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:20,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668399246] [2024-06-27 22:42:20,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668399246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:20,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:20,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:42:20,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432728505] [2024-06-27 22:42:20,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:20,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:42:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:20,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:42:20,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:42:20,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:42:20,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 195 transitions, 2685 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:20,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:20,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:42:20,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:22,963 INFO L124 PetriNetUnfolderBase]: 5719/9366 cut-off events. [2024-06-27 22:42:22,964 INFO L125 PetriNetUnfolderBase]: For 77453/77486 co-relation queries the response was YES. [2024-06-27 22:42:22,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43081 conditions, 9366 events. 5719/9366 cut-off events. For 77453/77486 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 62446 event pairs, 2006 based on Foata normal form. 29/9352 useless extension candidates. Maximal degree in co-relation 43017. Up to 8215 conditions per place. [2024-06-27 22:42:23,027 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 178 selfloop transitions, 33 changer transitions 0/229 dead transitions. [2024-06-27 22:42:23,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 229 transitions, 3263 flow [2024-06-27 22:42:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:42:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:42:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-27 22:42:23,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354609929078015 [2024-06-27 22:42:23,028 INFO L175 Difference]: Start difference. First operand has 144 places, 195 transitions, 2685 flow. Second operand 6 states and 151 transitions. [2024-06-27 22:42:23,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 229 transitions, 3263 flow [2024-06-27 22:42:23,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 229 transitions, 3042 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-27 22:42:23,136 INFO L231 Difference]: Finished difference. Result has 141 places, 196 transitions, 2555 flow [2024-06-27 22:42:23,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2470, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2555, PETRI_PLACES=141, PETRI_TRANSITIONS=196} [2024-06-27 22:42:23,137 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 90 predicate places. [2024-06-27 22:42:23,137 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 196 transitions, 2555 flow [2024-06-27 22:42:23,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:23,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:23,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:23,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:42:23,138 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:23,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash 838998654, now seen corresponding path program 1 times [2024-06-27 22:42:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:23,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496423706] [2024-06-27 22:42:23,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:29,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:29,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496423706] [2024-06-27 22:42:29,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496423706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:29,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:29,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:42:29,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374936752] [2024-06-27 22:42:29,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:29,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:42:29,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:29,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:42:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:42:29,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:42:29,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 196 transitions, 2555 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:29,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:29,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:42:29,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:32,193 INFO L124 PetriNetUnfolderBase]: 6120/9584 cut-off events. [2024-06-27 22:42:32,193 INFO L125 PetriNetUnfolderBase]: For 65863/65872 co-relation queries the response was YES. [2024-06-27 22:42:32,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43883 conditions, 9584 events. 6120/9584 cut-off events. For 65863/65872 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 61012 event pairs, 1385 based on Foata normal form. 3/9583 useless extension candidates. Maximal degree in co-relation 43818. Up to 8764 conditions per place. [2024-06-27 22:42:32,265 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 221 selfloop transitions, 39 changer transitions 0/267 dead transitions. [2024-06-27 22:42:32,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 267 transitions, 3424 flow [2024-06-27 22:42:32,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:42:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:42:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-06-27 22:42:32,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547112462006079 [2024-06-27 22:42:32,266 INFO L175 Difference]: Start difference. First operand has 141 places, 196 transitions, 2555 flow. Second operand 7 states and 180 transitions. [2024-06-27 22:42:32,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 267 transitions, 3424 flow [2024-06-27 22:42:32,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 267 transitions, 3367 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:42:32,427 INFO L231 Difference]: Finished difference. Result has 148 places, 214 transitions, 2753 flow [2024-06-27 22:42:32,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2503, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2753, PETRI_PLACES=148, PETRI_TRANSITIONS=214} [2024-06-27 22:42:32,428 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 97 predicate places. [2024-06-27 22:42:32,428 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 214 transitions, 2753 flow [2024-06-27 22:42:32,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:32,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:32,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:32,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:42:32,429 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:32,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1153162792, now seen corresponding path program 2 times [2024-06-27 22:42:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96015947] [2024-06-27 22:42:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96015947] [2024-06-27 22:42:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96015947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:42:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122117819] [2024-06-27 22:42:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:38,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:42:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:42:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:42:38,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:42:38,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 214 transitions, 2753 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:38,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:38,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:42:38,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:41,453 INFO L124 PetriNetUnfolderBase]: 6166/9651 cut-off events. [2024-06-27 22:42:41,453 INFO L125 PetriNetUnfolderBase]: For 68182/68191 co-relation queries the response was YES. [2024-06-27 22:42:41,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45302 conditions, 9651 events. 6166/9651 cut-off events. For 68182/68191 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 61326 event pairs, 1386 based on Foata normal form. 3/9650 useless extension candidates. Maximal degree in co-relation 45231. Up to 8804 conditions per place. [2024-06-27 22:42:41,525 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 216 selfloop transitions, 44 changer transitions 0/267 dead transitions. [2024-06-27 22:42:41,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 267 transitions, 3541 flow [2024-06-27 22:42:41,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:42:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:42:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-27 22:42:41,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-06-27 22:42:41,526 INFO L175 Difference]: Start difference. First operand has 148 places, 214 transitions, 2753 flow. Second operand 7 states and 175 transitions. [2024-06-27 22:42:41,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 267 transitions, 3541 flow [2024-06-27 22:42:41,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 267 transitions, 3519 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-06-27 22:42:41,675 INFO L231 Difference]: Finished difference. Result has 156 places, 220 transitions, 2887 flow [2024-06-27 22:42:41,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2887, PETRI_PLACES=156, PETRI_TRANSITIONS=220} [2024-06-27 22:42:41,675 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 105 predicate places. [2024-06-27 22:42:41,675 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 220 transitions, 2887 flow [2024-06-27 22:42:41,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:41,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:41,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:42:41,676 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:41,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1944198888, now seen corresponding path program 1 times [2024-06-27 22:42:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:41,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288642230] [2024-06-27 22:42:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:49,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:49,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288642230] [2024-06-27 22:42:49,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288642230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:49,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:49,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:42:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469366890] [2024-06-27 22:42:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:49,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:42:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:49,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:42:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:42:49,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:42:49,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 220 transitions, 2887 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:49,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:49,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:42:49,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:52,268 INFO L124 PetriNetUnfolderBase]: 6611/10224 cut-off events. [2024-06-27 22:42:52,268 INFO L125 PetriNetUnfolderBase]: For 74913/74930 co-relation queries the response was YES. [2024-06-27 22:42:52,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48351 conditions, 10224 events. 6611/10224 cut-off events. For 74913/74930 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 64642 event pairs, 1393 based on Foata normal form. 17/10236 useless extension candidates. Maximal degree in co-relation 48274. Up to 8861 conditions per place. [2024-06-27 22:42:52,354 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 227 selfloop transitions, 75 changer transitions 0/309 dead transitions. [2024-06-27 22:42:52,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 309 transitions, 4057 flow [2024-06-27 22:42:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:42:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:42:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-06-27 22:42:52,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541371158392435 [2024-06-27 22:42:52,356 INFO L175 Difference]: Start difference. First operand has 156 places, 220 transitions, 2887 flow. Second operand 9 states and 229 transitions. [2024-06-27 22:42:52,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 309 transitions, 4057 flow [2024-06-27 22:42:52,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 309 transitions, 3988 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:42:52,518 INFO L231 Difference]: Finished difference. Result has 165 places, 246 transitions, 3263 flow [2024-06-27 22:42:52,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2820, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3263, PETRI_PLACES=165, PETRI_TRANSITIONS=246} [2024-06-27 22:42:52,519 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 114 predicate places. [2024-06-27 22:42:52,519 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 246 transitions, 3263 flow [2024-06-27 22:42:52,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:52,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:52,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:52,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:42:52,520 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:52,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1045238568, now seen corresponding path program 2 times [2024-06-27 22:42:52,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089331250] [2024-06-27 22:42:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:57,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:57,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089331250] [2024-06-27 22:42:57,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089331250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:57,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:57,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:42:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560268119] [2024-06-27 22:42:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:42:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:42:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:42:57,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:42:57,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 246 transitions, 3263 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:57,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:57,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:42:57,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:00,867 INFO L124 PetriNetUnfolderBase]: 7291/11178 cut-off events. [2024-06-27 22:43:00,867 INFO L125 PetriNetUnfolderBase]: For 93698/93710 co-relation queries the response was YES. [2024-06-27 22:43:00,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56949 conditions, 11178 events. 7291/11178 cut-off events. For 93698/93710 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 70512 event pairs, 1346 based on Foata normal form. 21/11196 useless extension candidates. Maximal degree in co-relation 56866. Up to 9470 conditions per place. [2024-06-27 22:43:00,945 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 261 selfloop transitions, 114 changer transitions 0/382 dead transitions. [2024-06-27 22:43:00,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 382 transitions, 5028 flow [2024-06-27 22:43:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:43:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:43:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-06-27 22:43:00,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5765957446808511 [2024-06-27 22:43:00,947 INFO L175 Difference]: Start difference. First operand has 165 places, 246 transitions, 3263 flow. Second operand 10 states and 271 transitions. [2024-06-27 22:43:00,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 382 transitions, 5028 flow [2024-06-27 22:43:01,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 382 transitions, 4851 flow, removed 82 selfloop flow, removed 2 redundant places. [2024-06-27 22:43:01,155 INFO L231 Difference]: Finished difference. Result has 177 places, 300 transitions, 4072 flow [2024-06-27 22:43:01,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3170, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4072, PETRI_PLACES=177, PETRI_TRANSITIONS=300} [2024-06-27 22:43:01,155 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 126 predicate places. [2024-06-27 22:43:01,155 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 300 transitions, 4072 flow [2024-06-27 22:43:01,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:01,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:01,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:01,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:43:01,156 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:01,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1932234810, now seen corresponding path program 3 times [2024-06-27 22:43:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:01,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471027926] [2024-06-27 22:43:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:06,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471027926] [2024-06-27 22:43:06,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471027926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:43:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020670692] [2024-06-27 22:43:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:06,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:43:06,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:06,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:43:06,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:43:06,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:43:06,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 300 transitions, 4072 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:06,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:06,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:43:06,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:09,828 INFO L124 PetriNetUnfolderBase]: 7288/11308 cut-off events. [2024-06-27 22:43:09,828 INFO L125 PetriNetUnfolderBase]: For 113208/113223 co-relation queries the response was YES. [2024-06-27 22:43:09,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61520 conditions, 11308 events. 7288/11308 cut-off events. For 113208/113223 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 72273 event pairs, 1445 based on Foata normal form. 4/11307 useless extension candidates. Maximal degree in co-relation 61431. Up to 10319 conditions per place. [2024-06-27 22:43:09,924 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 282 selfloop transitions, 49 changer transitions 0/338 dead transitions. [2024-06-27 22:43:09,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 338 transitions, 4923 flow [2024-06-27 22:43:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:43:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:43:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 22:43:09,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045592705167173 [2024-06-27 22:43:09,926 INFO L175 Difference]: Start difference. First operand has 177 places, 300 transitions, 4072 flow. Second operand 7 states and 166 transitions. [2024-06-27 22:43:09,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 338 transitions, 4923 flow [2024-06-27 22:43:10,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 338 transitions, 4678 flow, removed 92 selfloop flow, removed 4 redundant places. [2024-06-27 22:43:10,199 INFO L231 Difference]: Finished difference. Result has 180 places, 300 transitions, 3931 flow [2024-06-27 22:43:10,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3827, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3931, PETRI_PLACES=180, PETRI_TRANSITIONS=300} [2024-06-27 22:43:10,199 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 129 predicate places. [2024-06-27 22:43:10,200 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 300 transitions, 3931 flow [2024-06-27 22:43:10,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:10,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:10,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:10,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:43:10,200 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:10,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1932234438, now seen corresponding path program 3 times [2024-06-27 22:43:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694916242] [2024-06-27 22:43:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:16,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694916242] [2024-06-27 22:43:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694916242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:16,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:16,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:43:16,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137248449] [2024-06-27 22:43:16,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:43:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:43:16,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:43:16,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:43:16,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 300 transitions, 3931 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:16,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:16,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:43:16,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:19,038 INFO L124 PetriNetUnfolderBase]: 7284/11169 cut-off events. [2024-06-27 22:43:19,038 INFO L125 PetriNetUnfolderBase]: For 112757/112811 co-relation queries the response was YES. [2024-06-27 22:43:19,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60260 conditions, 11169 events. 7284/11169 cut-off events. For 112757/112811 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 70264 event pairs, 1418 based on Foata normal form. 44/11207 useless extension candidates. Maximal degree in co-relation 60171. Up to 9835 conditions per place. [2024-06-27 22:43:19,132 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 255 selfloop transitions, 93 changer transitions 0/355 dead transitions. [2024-06-27 22:43:19,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 355 transitions, 5015 flow [2024-06-27 22:43:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:43:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:43:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 22:43:19,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523936170212766 [2024-06-27 22:43:19,134 INFO L175 Difference]: Start difference. First operand has 180 places, 300 transitions, 3931 flow. Second operand 8 states and 197 transitions. [2024-06-27 22:43:19,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 355 transitions, 5015 flow [2024-06-27 22:43:19,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 355 transitions, 4969 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 22:43:19,355 INFO L231 Difference]: Finished difference. Result has 187 places, 310 transitions, 4238 flow [2024-06-27 22:43:19,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3886, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4238, PETRI_PLACES=187, PETRI_TRANSITIONS=310} [2024-06-27 22:43:19,356 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 136 predicate places. [2024-06-27 22:43:19,356 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 310 transitions, 4238 flow [2024-06-27 22:43:19,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:19,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:19,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:19,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:43:19,357 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:19,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1430770468, now seen corresponding path program 4 times [2024-06-27 22:43:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837961221] [2024-06-27 22:43:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837961221] [2024-06-27 22:43:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837961221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:22,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717830291] [2024-06-27 22:43:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:22,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:23,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:43:23,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 310 transitions, 4238 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:23,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:23,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:43:23,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:26,459 INFO L124 PetriNetUnfolderBase]: 7483/11577 cut-off events. [2024-06-27 22:43:26,459 INFO L125 PetriNetUnfolderBase]: For 126581/126612 co-relation queries the response was YES. [2024-06-27 22:43:26,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63796 conditions, 11577 events. 7483/11577 cut-off events. For 126581/126612 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 73966 event pairs, 1443 based on Foata normal form. 29/11601 useless extension candidates. Maximal degree in co-relation 63704. Up to 10239 conditions per place. [2024-06-27 22:43:26,572 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 316 selfloop transitions, 81 changer transitions 0/404 dead transitions. [2024-06-27 22:43:26,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 404 transitions, 5781 flow [2024-06-27 22:43:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:43:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:43:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:43:26,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271867612293144 [2024-06-27 22:43:26,574 INFO L175 Difference]: Start difference. First operand has 187 places, 310 transitions, 4238 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:43:26,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 404 transitions, 5781 flow [2024-06-27 22:43:26,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 404 transitions, 5574 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 22:43:26,878 INFO L231 Difference]: Finished difference. Result has 194 places, 334 transitions, 4507 flow [2024-06-27 22:43:26,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4507, PETRI_PLACES=194, PETRI_TRANSITIONS=334} [2024-06-27 22:43:26,879 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 143 predicate places. [2024-06-27 22:43:26,879 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 334 transitions, 4507 flow [2024-06-27 22:43:26,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:26,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:26,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:26,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:43:26,879 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:26,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash 372299948, now seen corresponding path program 5 times [2024-06-27 22:43:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164634057] [2024-06-27 22:43:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:30,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:30,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164634057] [2024-06-27 22:43:30,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164634057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:30,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:30,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:30,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678194156] [2024-06-27 22:43:30,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:30,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:30,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:30,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:30,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:43:30,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 334 transitions, 4507 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:30,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:30,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:43:30,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:33,110 INFO L124 PetriNetUnfolderBase]: 7665/11852 cut-off events. [2024-06-27 22:43:33,111 INFO L125 PetriNetUnfolderBase]: For 135591/135622 co-relation queries the response was YES. [2024-06-27 22:43:33,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67047 conditions, 11852 events. 7665/11852 cut-off events. For 135591/135622 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 75781 event pairs, 1455 based on Foata normal form. 27/11875 useless extension candidates. Maximal degree in co-relation 66951. Up to 10742 conditions per place. [2024-06-27 22:43:33,220 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 328 selfloop transitions, 85 changer transitions 0/420 dead transitions. [2024-06-27 22:43:33,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 420 transitions, 6125 flow [2024-06-27 22:43:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:43:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:43:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-06-27 22:43:33,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5379939209726444 [2024-06-27 22:43:33,221 INFO L175 Difference]: Start difference. First operand has 194 places, 334 transitions, 4507 flow. Second operand 7 states and 177 transitions. [2024-06-27 22:43:33,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 420 transitions, 6125 flow [2024-06-27 22:43:33,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 420 transitions, 6019 flow, removed 43 selfloop flow, removed 2 redundant places. [2024-06-27 22:43:33,514 INFO L231 Difference]: Finished difference. Result has 201 places, 370 transitions, 5219 flow [2024-06-27 22:43:33,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4429, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5219, PETRI_PLACES=201, PETRI_TRANSITIONS=370} [2024-06-27 22:43:33,515 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 150 predicate places. [2024-06-27 22:43:33,515 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 370 transitions, 5219 flow [2024-06-27 22:43:33,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:33,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:33,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:33,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:43:33,515 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:33,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1459697188, now seen corresponding path program 6 times [2024-06-27 22:43:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403873468] [2024-06-27 22:43:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:37,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403873468] [2024-06-27 22:43:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403873468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851314408] [2024-06-27 22:43:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:37,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:37,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:43:37,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 370 transitions, 5219 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:37,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:37,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:43:37,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:40,583 INFO L124 PetriNetUnfolderBase]: 7660/11842 cut-off events. [2024-06-27 22:43:40,583 INFO L125 PetriNetUnfolderBase]: For 137507/137519 co-relation queries the response was YES. [2024-06-27 22:43:40,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67932 conditions, 11842 events. 7660/11842 cut-off events. For 137507/137519 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 75606 event pairs, 1438 based on Foata normal form. 5/11842 useless extension candidates. Maximal degree in co-relation 67833. Up to 10367 conditions per place. [2024-06-27 22:43:40,704 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 299 selfloop transitions, 118 changer transitions 0/424 dead transitions. [2024-06-27 22:43:40,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 424 transitions, 6386 flow [2024-06-27 22:43:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:43:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:43:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 22:43:40,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-06-27 22:43:40,706 INFO L175 Difference]: Start difference. First operand has 201 places, 370 transitions, 5219 flow. Second operand 8 states and 192 transitions. [2024-06-27 22:43:40,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 424 transitions, 6386 flow [2024-06-27 22:43:40,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 424 transitions, 6270 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:43:40,998 INFO L231 Difference]: Finished difference. Result has 207 places, 370 transitions, 5381 flow [2024-06-27 22:43:40,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5103, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5381, PETRI_PLACES=207, PETRI_TRANSITIONS=370} [2024-06-27 22:43:40,999 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 156 predicate places. [2024-06-27 22:43:40,999 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 370 transitions, 5381 flow [2024-06-27 22:43:40,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:40,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:40,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:40,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:43:41,000 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:41,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1431069370, now seen corresponding path program 4 times [2024-06-27 22:43:41,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:41,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383071694] [2024-06-27 22:43:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:41,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:44,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383071694] [2024-06-27 22:43:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383071694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:44,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:44,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:44,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965844385] [2024-06-27 22:43:44,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:44,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:44,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:44,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:43:44,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 370 transitions, 5381 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:44,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:44,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:43:44,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:48,074 INFO L124 PetriNetUnfolderBase]: 7515/11567 cut-off events. [2024-06-27 22:43:48,074 INFO L125 PetriNetUnfolderBase]: For 149830/149883 co-relation queries the response was YES. [2024-06-27 22:43:48,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67389 conditions, 11567 events. 7515/11567 cut-off events. For 149830/149883 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 74034 event pairs, 1399 based on Foata normal form. 44/11559 useless extension candidates. Maximal degree in co-relation 67287. Up to 9332 conditions per place. [2024-06-27 22:43:48,183 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 225 selfloop transitions, 151 changer transitions 0/428 dead transitions. [2024-06-27 22:43:48,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 428 transitions, 6659 flow [2024-06-27 22:43:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:43:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:43:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-06-27 22:43:48,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508274231678487 [2024-06-27 22:43:48,185 INFO L175 Difference]: Start difference. First operand has 207 places, 370 transitions, 5381 flow. Second operand 9 states and 215 transitions. [2024-06-27 22:43:48,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 428 transitions, 6659 flow [2024-06-27 22:43:48,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 428 transitions, 6476 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 22:43:48,478 INFO L231 Difference]: Finished difference. Result has 210 places, 382 transitions, 5739 flow [2024-06-27 22:43:48,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5210, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5739, PETRI_PLACES=210, PETRI_TRANSITIONS=382} [2024-06-27 22:43:48,479 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 159 predicate places. [2024-06-27 22:43:48,479 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 382 transitions, 5739 flow [2024-06-27 22:43:48,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:48,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:48,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:48,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:43:48,480 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:48,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1221653802, now seen corresponding path program 1 times [2024-06-27 22:43:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:48,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434998999] [2024-06-27 22:43:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434998999] [2024-06-27 22:43:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434998999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:53,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:53,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697520129] [2024-06-27 22:43:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:53,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:53,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:53,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:43:53,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 382 transitions, 5739 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:53,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:53,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:43:53,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:56,501 INFO L124 PetriNetUnfolderBase]: 7809/12041 cut-off events. [2024-06-27 22:43:56,501 INFO L125 PetriNetUnfolderBase]: For 161490/161543 co-relation queries the response was YES. [2024-06-27 22:43:56,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72485 conditions, 12041 events. 7809/12041 cut-off events. For 161490/161543 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 77140 event pairs, 1430 based on Foata normal form. 41/12078 useless extension candidates. Maximal degree in co-relation 72384. Up to 10892 conditions per place. [2024-06-27 22:43:56,621 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 360 selfloop transitions, 54 changer transitions 0/421 dead transitions. [2024-06-27 22:43:56,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 421 transitions, 6866 flow [2024-06-27 22:43:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:43:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:43:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-06-27 22:43:56,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47112462006079026 [2024-06-27 22:43:56,623 INFO L175 Difference]: Start difference. First operand has 210 places, 382 transitions, 5739 flow. Second operand 7 states and 155 transitions. [2024-06-27 22:43:56,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 421 transitions, 6866 flow [2024-06-27 22:43:57,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 421 transitions, 6670 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-27 22:43:57,029 INFO L231 Difference]: Finished difference. Result has 213 places, 391 transitions, 5882 flow [2024-06-27 22:43:57,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5559, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5882, PETRI_PLACES=213, PETRI_TRANSITIONS=391} [2024-06-27 22:43:57,029 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 162 predicate places. [2024-06-27 22:43:57,029 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 391 transitions, 5882 flow [2024-06-27 22:43:57,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:57,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:57,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:57,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:43:57,030 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:57,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1931803848, now seen corresponding path program 1 times [2024-06-27 22:43:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601990344] [2024-06-27 22:43:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601990344] [2024-06-27 22:44:02,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601990344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:02,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:02,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:44:02,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930969810] [2024-06-27 22:44:02,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:02,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:44:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:44:02,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:44:02,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:44:02,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 391 transitions, 5882 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:02,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:02,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:44:02,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:05,766 INFO L124 PetriNetUnfolderBase]: 7595/12216 cut-off events. [2024-06-27 22:44:05,766 INFO L125 PetriNetUnfolderBase]: For 151973/152023 co-relation queries the response was YES. [2024-06-27 22:44:05,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68932 conditions, 12216 events. 7595/12216 cut-off events. For 151973/152023 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 82712 event pairs, 2168 based on Foata normal form. 57/12215 useless extension candidates. Maximal degree in co-relation 68831. Up to 10326 conditions per place. [2024-06-27 22:44:05,885 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 344 selfloop transitions, 42 changer transitions 0/438 dead transitions. [2024-06-27 22:44:05,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 438 transitions, 6963 flow [2024-06-27 22:44:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:44:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:44:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 22:44:05,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026595744680851 [2024-06-27 22:44:05,887 INFO L175 Difference]: Start difference. First operand has 213 places, 391 transitions, 5882 flow. Second operand 8 states and 189 transitions. [2024-06-27 22:44:05,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 438 transitions, 6963 flow [2024-06-27 22:44:06,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 438 transitions, 6838 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 22:44:06,180 INFO L231 Difference]: Finished difference. Result has 216 places, 393 transitions, 5883 flow [2024-06-27 22:44:06,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5761, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5883, PETRI_PLACES=216, PETRI_TRANSITIONS=393} [2024-06-27 22:44:06,181 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 165 predicate places. [2024-06-27 22:44:06,181 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 393 transitions, 5883 flow [2024-06-27 22:44:06,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:06,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:06,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:06,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:44:06,182 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:06,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2040930818, now seen corresponding path program 1 times [2024-06-27 22:44:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:06,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919437895] [2024-06-27 22:44:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:06,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919437895] [2024-06-27 22:44:13,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919437895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:13,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:13,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:44:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887110382] [2024-06-27 22:44:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:13,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:44:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:44:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:44:13,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:44:13,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 393 transitions, 5883 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:13,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:13,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:44:13,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:16,905 INFO L124 PetriNetUnfolderBase]: 7998/12282 cut-off events. [2024-06-27 22:44:16,906 INFO L125 PetriNetUnfolderBase]: For 149909/149921 co-relation queries the response was YES. [2024-06-27 22:44:16,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72269 conditions, 12282 events. 7998/12282 cut-off events. For 149909/149921 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 78488 event pairs, 1428 based on Foata normal form. 15/12292 useless extension candidates. Maximal degree in co-relation 72167. Up to 10490 conditions per place. [2024-06-27 22:44:17,005 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 320 selfloop transitions, 130 changer transitions 0/457 dead transitions. [2024-06-27 22:44:17,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 457 transitions, 7206 flow [2024-06-27 22:44:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:44:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:44:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 22:44:17,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-06-27 22:44:17,007 INFO L175 Difference]: Start difference. First operand has 216 places, 393 transitions, 5883 flow. Second operand 9 states and 222 transitions. [2024-06-27 22:44:17,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 457 transitions, 7206 flow [2024-06-27 22:44:17,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 457 transitions, 7084 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:17,342 INFO L231 Difference]: Finished difference. Result has 219 places, 405 transitions, 6213 flow [2024-06-27 22:44:17,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5779, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6213, PETRI_PLACES=219, PETRI_TRANSITIONS=405} [2024-06-27 22:44:17,342 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 168 predicate places. [2024-06-27 22:44:17,343 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 405 transitions, 6213 flow [2024-06-27 22:44:17,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:17,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:17,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:17,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:44:17,343 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:17,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1957344579, now seen corresponding path program 1 times [2024-06-27 22:44:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178965116] [2024-06-27 22:44:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:22,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178965116] [2024-06-27 22:44:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178965116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:22,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:22,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:44:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474789183] [2024-06-27 22:44:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:22,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:44:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:22,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:44:22,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:44:22,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:44:22,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 405 transitions, 6213 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:22,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:22,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:44:22,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:26,162 INFO L124 PetriNetUnfolderBase]: 7992/12370 cut-off events. [2024-06-27 22:44:26,162 INFO L125 PetriNetUnfolderBase]: For 153634/153634 co-relation queries the response was YES. [2024-06-27 22:44:26,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73351 conditions, 12370 events. 7992/12370 cut-off events. For 153634/153634 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 79787 event pairs, 1466 based on Foata normal form. 2/12370 useless extension candidates. Maximal degree in co-relation 73248. Up to 10734 conditions per place. [2024-06-27 22:44:26,299 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 370 selfloop transitions, 121 changer transitions 0/498 dead transitions. [2024-06-27 22:44:26,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 498 transitions, 7770 flow [2024-06-27 22:44:26,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:44:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:44:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2024-06-27 22:44:26,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255319148936171 [2024-06-27 22:44:26,300 INFO L175 Difference]: Start difference. First operand has 219 places, 405 transitions, 6213 flow. Second operand 10 states and 247 transitions. [2024-06-27 22:44:26,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 498 transitions, 7770 flow [2024-06-27 22:44:26,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 498 transitions, 7523 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:26,671 INFO L231 Difference]: Finished difference. Result has 224 places, 412 transitions, 6301 flow [2024-06-27 22:44:26,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5976, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6301, PETRI_PLACES=224, PETRI_TRANSITIONS=412} [2024-06-27 22:44:26,672 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 173 predicate places. [2024-06-27 22:44:26,672 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 412 transitions, 6301 flow [2024-06-27 22:44:26,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:26,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:26,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:26,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:44:26,672 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:26,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash -514425710, now seen corresponding path program 2 times [2024-06-27 22:44:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398005268] [2024-06-27 22:44:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:34,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398005268] [2024-06-27 22:44:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398005268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:44:34,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676417356] [2024-06-27 22:44:34,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:34,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:44:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:44:34,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:44:34,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:44:34,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 412 transitions, 6301 flow. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:34,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:34,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:44:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:38,248 INFO L124 PetriNetUnfolderBase]: 7762/11973 cut-off events. [2024-06-27 22:44:38,248 INFO L125 PetriNetUnfolderBase]: For 159594/159666 co-relation queries the response was YES. [2024-06-27 22:44:38,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72121 conditions, 11973 events. 7762/11973 cut-off events. For 159594/159666 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 77160 event pairs, 1423 based on Foata normal form. 61/11985 useless extension candidates. Maximal degree in co-relation 72016. Up to 10312 conditions per place. [2024-06-27 22:44:38,391 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 295 selfloop transitions, 120 changer transitions 0/469 dead transitions. [2024-06-27 22:44:38,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 469 transitions, 7567 flow [2024-06-27 22:44:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:44:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:44:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-06-27 22:44:38,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846335697399527 [2024-06-27 22:44:38,393 INFO L175 Difference]: Start difference. First operand has 224 places, 412 transitions, 6301 flow. Second operand 9 states and 205 transitions. [2024-06-27 22:44:38,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 469 transitions, 7567 flow [2024-06-27 22:44:38,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 469 transitions, 7329 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-27 22:44:38,820 INFO L231 Difference]: Finished difference. Result has 230 places, 431 transitions, 6616 flow [2024-06-27 22:44:38,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6080, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6616, PETRI_PLACES=230, PETRI_TRANSITIONS=431} [2024-06-27 22:44:38,821 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 179 predicate places. [2024-06-27 22:44:38,821 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 431 transitions, 6616 flow [2024-06-27 22:44:38,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:38,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:38,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:38,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:44:38,822 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:38,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:38,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2022613034, now seen corresponding path program 3 times [2024-06-27 22:44:38,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:38,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447106701] [2024-06-27 22:44:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:38,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:44,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447106701] [2024-06-27 22:44:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447106701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:44:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961305260] [2024-06-27 22:44:44,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:44,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:44:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:44,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:44:44,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:44:45,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:44:45,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 431 transitions, 6616 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:45,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:45,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:44:45,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:48,406 INFO L124 PetriNetUnfolderBase]: 8063/12350 cut-off events. [2024-06-27 22:44:48,406 INFO L125 PetriNetUnfolderBase]: For 168876/168923 co-relation queries the response was YES. [2024-06-27 22:44:48,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74845 conditions, 12350 events. 8063/12350 cut-off events. For 168876/168923 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 78482 event pairs, 1471 based on Foata normal form. 37/12381 useless extension candidates. Maximal degree in co-relation 74738. Up to 10124 conditions per place. [2024-06-27 22:44:48,525 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 289 selfloop transitions, 173 changer transitions 0/469 dead transitions. [2024-06-27 22:44:48,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 469 transitions, 7784 flow [2024-06-27 22:44:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:44:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:44:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-06-27 22:44:48,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2024-06-27 22:44:48,527 INFO L175 Difference]: Start difference. First operand has 230 places, 431 transitions, 6616 flow. Second operand 8 states and 185 transitions. [2024-06-27 22:44:48,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 469 transitions, 7784 flow [2024-06-27 22:44:48,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 469 transitions, 7559 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:48,910 INFO L231 Difference]: Finished difference. Result has 232 places, 431 transitions, 6833 flow [2024-06-27 22:44:48,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6391, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6833, PETRI_PLACES=232, PETRI_TRANSITIONS=431} [2024-06-27 22:44:48,911 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 181 predicate places. [2024-06-27 22:44:48,911 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 431 transitions, 6833 flow [2024-06-27 22:44:48,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:48,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:48,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:48,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:44:48,912 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:48,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1343601309, now seen corresponding path program 2 times [2024-06-27 22:44:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:48,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338123303] [2024-06-27 22:44:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:48,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338123303] [2024-06-27 22:44:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338123303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:52,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:44:52,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081803572] [2024-06-27 22:44:52,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:52,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:44:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:52,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:44:52,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:44:52,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:44:52,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 431 transitions, 6833 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:52,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:52,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:44:52,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:56,426 INFO L124 PetriNetUnfolderBase]: 8190/12650 cut-off events. [2024-06-27 22:44:56,426 INFO L125 PetriNetUnfolderBase]: For 175526/175550 co-relation queries the response was YES. [2024-06-27 22:44:56,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77618 conditions, 12650 events. 8190/12650 cut-off events. For 175526/175550 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 81483 event pairs, 1502 based on Foata normal form. 21/12667 useless extension candidates. Maximal degree in co-relation 77510. Up to 11042 conditions per place. [2024-06-27 22:44:56,570 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 399 selfloop transitions, 134 changer transitions 0/540 dead transitions. [2024-06-27 22:44:56,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 540 transitions, 8573 flow [2024-06-27 22:44:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:44:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:44:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 285 transitions. [2024-06-27 22:44:56,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053191489361702 [2024-06-27 22:44:56,572 INFO L175 Difference]: Start difference. First operand has 232 places, 431 transitions, 6833 flow. Second operand 12 states and 285 transitions. [2024-06-27 22:44:56,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 540 transitions, 8573 flow [2024-06-27 22:44:57,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 540 transitions, 8227 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:44:57,290 INFO L231 Difference]: Finished difference. Result has 238 places, 447 transitions, 6912 flow [2024-06-27 22:44:57,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6487, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6912, PETRI_PLACES=238, PETRI_TRANSITIONS=447} [2024-06-27 22:44:57,290 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 187 predicate places. [2024-06-27 22:44:57,291 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 447 transitions, 6912 flow [2024-06-27 22:44:57,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:57,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:57,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:57,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:44:57,291 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:57,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1704821459, now seen corresponding path program 1 times [2024-06-27 22:44:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122884983] [2024-06-27 22:44:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:02,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122884983] [2024-06-27 22:45:02,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122884983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:02,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:02,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357146121] [2024-06-27 22:45:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:02,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:02,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:02,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:02,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:45:02,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 447 transitions, 6912 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:02,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:02,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:45:02,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:06,089 INFO L124 PetriNetUnfolderBase]: 8213/12996 cut-off events. [2024-06-27 22:45:06,089 INFO L125 PetriNetUnfolderBase]: For 187611/187613 co-relation queries the response was YES. [2024-06-27 22:45:06,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78837 conditions, 12996 events. 8213/12996 cut-off events. For 187611/187613 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 86535 event pairs, 2290 based on Foata normal form. 3/12997 useless extension candidates. Maximal degree in co-relation 78727. Up to 11621 conditions per place. [2024-06-27 22:45:06,242 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 455 selfloop transitions, 34 changer transitions 0/496 dead transitions. [2024-06-27 22:45:06,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 496 transitions, 8291 flow [2024-06-27 22:45:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 22:45:06,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47074468085106386 [2024-06-27 22:45:06,243 INFO L175 Difference]: Start difference. First operand has 238 places, 447 transitions, 6912 flow. Second operand 8 states and 177 transitions. [2024-06-27 22:45:06,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 496 transitions, 8291 flow [2024-06-27 22:45:06,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 496 transitions, 8122 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-27 22:45:06,712 INFO L231 Difference]: Finished difference. Result has 245 places, 457 transitions, 7007 flow [2024-06-27 22:45:06,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6743, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7007, PETRI_PLACES=245, PETRI_TRANSITIONS=457} [2024-06-27 22:45:06,713 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 194 predicate places. [2024-06-27 22:45:06,713 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 457 transitions, 7007 flow [2024-06-27 22:45:06,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:06,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:06,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:06,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:45:06,714 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:06,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash 795599485, now seen corresponding path program 2 times [2024-06-27 22:45:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854679353] [2024-06-27 22:45:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:12,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:12,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854679353] [2024-06-27 22:45:12,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854679353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:12,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:12,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358016539] [2024-06-27 22:45:12,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:12,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:12,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:12,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:45:12,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 457 transitions, 7007 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:12,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:12,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:45:12,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:16,088 INFO L124 PetriNetUnfolderBase]: 8393/13182 cut-off events. [2024-06-27 22:45:16,089 INFO L125 PetriNetUnfolderBase]: For 197332/197332 co-relation queries the response was YES. [2024-06-27 22:45:16,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81240 conditions, 13182 events. 8393/13182 cut-off events. For 197332/197332 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 86806 event pairs, 2282 based on Foata normal form. 1/13181 useless extension candidates. Maximal degree in co-relation 81126. Up to 11819 conditions per place. [2024-06-27 22:45:16,237 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 493 selfloop transitions, 49 changer transitions 0/549 dead transitions. [2024-06-27 22:45:16,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 549 transitions, 8897 flow [2024-06-27 22:45:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:45:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:45:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2024-06-27 22:45:16,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796905222437137 [2024-06-27 22:45:16,239 INFO L175 Difference]: Start difference. First operand has 245 places, 457 transitions, 7007 flow. Second operand 11 states and 248 transitions. [2024-06-27 22:45:16,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 549 transitions, 8897 flow [2024-06-27 22:45:16,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 549 transitions, 8734 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-27 22:45:16,660 INFO L231 Difference]: Finished difference. Result has 255 places, 481 transitions, 7397 flow [2024-06-27 22:45:16,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6901, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7397, PETRI_PLACES=255, PETRI_TRANSITIONS=481} [2024-06-27 22:45:16,660 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 204 predicate places. [2024-06-27 22:45:16,660 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 481 transitions, 7397 flow [2024-06-27 22:45:16,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:16,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:16,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:16,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:45:16,661 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:16,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:16,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1652148919, now seen corresponding path program 3 times [2024-06-27 22:45:16,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:16,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736483432] [2024-06-27 22:45:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736483432] [2024-06-27 22:45:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736483432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:45:22,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635348390] [2024-06-27 22:45:22,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:22,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:45:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:45:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:45:22,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:45:22,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 481 transitions, 7397 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:22,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:22,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:45:22,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:27,189 INFO L124 PetriNetUnfolderBase]: 8398/13248 cut-off events. [2024-06-27 22:45:27,189 INFO L125 PetriNetUnfolderBase]: For 206282/206284 co-relation queries the response was YES. [2024-06-27 22:45:27,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82215 conditions, 13248 events. 8398/13248 cut-off events. For 206282/206284 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 88027 event pairs, 2283 based on Foata normal form. 3/13249 useless extension candidates. Maximal degree in co-relation 82097. Up to 11741 conditions per place. [2024-06-27 22:45:27,349 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 464 selfloop transitions, 66 changer transitions 0/537 dead transitions. [2024-06-27 22:45:27,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 537 transitions, 8863 flow [2024-06-27 22:45:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:45:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:45:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions. [2024-06-27 22:45:27,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-06-27 22:45:27,351 INFO L175 Difference]: Start difference. First operand has 255 places, 481 transitions, 7397 flow. Second operand 10 states and 220 transitions. [2024-06-27 22:45:27,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 537 transitions, 8863 flow [2024-06-27 22:45:27,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 537 transitions, 8790 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-27 22:45:27,814 INFO L231 Difference]: Finished difference. Result has 263 places, 487 transitions, 7579 flow [2024-06-27 22:45:27,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7324, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7579, PETRI_PLACES=263, PETRI_TRANSITIONS=487} [2024-06-27 22:45:27,814 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 212 predicate places. [2024-06-27 22:45:27,815 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 487 transitions, 7579 flow [2024-06-27 22:45:27,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:27,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:27,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:27,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:45:27,815 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:27,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash -207518235, now seen corresponding path program 1 times [2024-06-27 22:45:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:27,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365484490] [2024-06-27 22:45:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:36,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-27 22:45:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365484490] [2024-06-27 22:45:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365484490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:36,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:45:36,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722207192] [2024-06-27 22:45:36,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:36,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:45:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:45:36,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:45:36,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:45:36,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 487 transitions, 7579 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:36,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:36,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:45:36,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:39,815 INFO L124 PetriNetUnfolderBase]: 8479/13066 cut-off events. [2024-06-27 22:45:39,815 INFO L125 PetriNetUnfolderBase]: For 212681/212687 co-relation queries the response was YES. [2024-06-27 22:45:39,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83672 conditions, 13066 events. 8479/13066 cut-off events. For 212681/212687 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 84209 event pairs, 1491 based on Foata normal form. 3/13065 useless extension candidates. Maximal degree in co-relation 83552. Up to 11690 conditions per place. [2024-06-27 22:45:39,992 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 465 selfloop transitions, 86 changer transitions 0/558 dead transitions. [2024-06-27 22:45:39,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 558 transitions, 9125 flow [2024-06-27 22:45:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-06-27 22:45:39,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.550531914893617 [2024-06-27 22:45:39,993 INFO L175 Difference]: Start difference. First operand has 263 places, 487 transitions, 7579 flow. Second operand 8 states and 207 transitions. [2024-06-27 22:45:39,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 558 transitions, 9125 flow [2024-06-27 22:45:40,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 558 transitions, 8959 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-27 22:45:40,527 INFO L231 Difference]: Finished difference. Result has 264 places, 491 transitions, 7646 flow [2024-06-27 22:45:40,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7425, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7646, PETRI_PLACES=264, PETRI_TRANSITIONS=491} [2024-06-27 22:45:40,528 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 213 predicate places. [2024-06-27 22:45:40,528 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 491 transitions, 7646 flow [2024-06-27 22:45:40,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:40,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:40,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:40,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:45:40,529 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:40,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash -198947355, now seen corresponding path program 2 times [2024-06-27 22:45:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806209504] [2024-06-27 22:45:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806209504] [2024-06-27 22:45:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806209504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:49,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:45:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961375481] [2024-06-27 22:45:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:49,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:45:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:45:49,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:45:49,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:45:49,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 491 transitions, 7646 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:49,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:49,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:45:49,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:53,343 INFO L124 PetriNetUnfolderBase]: 8517/13136 cut-off events. [2024-06-27 22:45:53,343 INFO L125 PetriNetUnfolderBase]: For 211500/211506 co-relation queries the response was YES. [2024-06-27 22:45:53,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83863 conditions, 13136 events. 8517/13136 cut-off events. For 211500/211506 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 84764 event pairs, 1528 based on Foata normal form. 3/13135 useless extension candidates. Maximal degree in co-relation 83742. Up to 11880 conditions per place. [2024-06-27 22:45:53,475 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 460 selfloop transitions, 86 changer transitions 0/553 dead transitions. [2024-06-27 22:45:53,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 553 transitions, 9074 flow [2024-06-27 22:45:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 22:45:53,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292553191489362 [2024-06-27 22:45:53,477 INFO L175 Difference]: Start difference. First operand has 264 places, 491 transitions, 7646 flow. Second operand 8 states and 199 transitions. [2024-06-27 22:45:53,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 553 transitions, 9074 flow [2024-06-27 22:45:53,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 553 transitions, 8987 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:53,897 INFO L231 Difference]: Finished difference. Result has 270 places, 493 transitions, 7766 flow [2024-06-27 22:45:53,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7571, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7766, PETRI_PLACES=270, PETRI_TRANSITIONS=493} [2024-06-27 22:45:53,898 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 219 predicate places. [2024-06-27 22:45:53,898 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 493 transitions, 7766 flow [2024-06-27 22:45:53,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:53,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:53,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:53,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:45:53,899 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:53,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash 87939975, now seen corresponding path program 3 times [2024-06-27 22:45:53,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:53,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857440204] [2024-06-27 22:45:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857440204] [2024-06-27 22:46:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857440204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:01,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:01,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043212043] [2024-06-27 22:46:01,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:01,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:01,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:46:01,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 493 transitions, 7766 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:01,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:01,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:46:01,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:05,157 INFO L124 PetriNetUnfolderBase]: 8555/13187 cut-off events. [2024-06-27 22:46:05,157 INFO L125 PetriNetUnfolderBase]: For 217135/217141 co-relation queries the response was YES. [2024-06-27 22:46:05,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84566 conditions, 13187 events. 8555/13187 cut-off events. For 217135/217141 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 85129 event pairs, 1521 based on Foata normal form. 3/13186 useless extension candidates. Maximal degree in co-relation 84443. Up to 11942 conditions per place. [2024-06-27 22:46:05,343 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 458 selfloop transitions, 85 changer transitions 0/550 dead transitions. [2024-06-27 22:46:05,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 550 transitions, 9168 flow [2024-06-27 22:46:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 22:46:05,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159574468085106 [2024-06-27 22:46:05,346 INFO L175 Difference]: Start difference. First operand has 270 places, 493 transitions, 7766 flow. Second operand 8 states and 194 transitions. [2024-06-27 22:46:05,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 550 transitions, 9168 flow [2024-06-27 22:46:06,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 550 transitions, 8963 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:06,199 INFO L231 Difference]: Finished difference. Result has 271 places, 495 transitions, 7757 flow [2024-06-27 22:46:06,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7561, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7757, PETRI_PLACES=271, PETRI_TRANSITIONS=495} [2024-06-27 22:46:06,200 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 220 predicate places. [2024-06-27 22:46:06,200 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 495 transitions, 7757 flow [2024-06-27 22:46:06,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:06,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:06,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:06,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:46:06,201 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:46:06,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash -204658299, now seen corresponding path program 1 times [2024-06-27 22:46:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:06,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112312567] [2024-06-27 22:46:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:15,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:15,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112312567] [2024-06-27 22:46:15,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112312567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:15,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:15,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076119087] [2024-06-27 22:46:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:15,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:15,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:46:15,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 495 transitions, 7757 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:15,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:15,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:46:15,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:20,109 INFO L124 PetriNetUnfolderBase]: 8707/13339 cut-off events. [2024-06-27 22:46:20,109 INFO L125 PetriNetUnfolderBase]: For 221334/221342 co-relation queries the response was YES. [2024-06-27 22:46:20,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86095 conditions, 13339 events. 8707/13339 cut-off events. For 221334/221342 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 85623 event pairs, 1349 based on Foata normal form. 10/13347 useless extension candidates. Maximal degree in co-relation 85972. Up to 10943 conditions per place. [2024-06-27 22:46:20,260 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 422 selfloop transitions, 180 changer transitions 0/609 dead transitions. [2024-06-27 22:46:20,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 609 transitions, 9784 flow [2024-06-27 22:46:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:46:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:46:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 280 transitions. [2024-06-27 22:46:20,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-06-27 22:46:20,261 INFO L175 Difference]: Start difference. First operand has 271 places, 495 transitions, 7757 flow. Second operand 10 states and 280 transitions. [2024-06-27 22:46:20,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 609 transitions, 9784 flow [2024-06-27 22:46:20,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 609 transitions, 9608 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:20,817 INFO L231 Difference]: Finished difference. Result has 276 places, 510 transitions, 8167 flow [2024-06-27 22:46:20,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7581, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8167, PETRI_PLACES=276, PETRI_TRANSITIONS=510} [2024-06-27 22:46:20,818 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 225 predicate places. [2024-06-27 22:46:20,818 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 510 transitions, 8167 flow [2024-06-27 22:46:20,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:20,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:20,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:20,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:46:20,819 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:46:20,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash -198944379, now seen corresponding path program 2 times [2024-06-27 22:46:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:20,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964907503] [2024-06-27 22:46:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:27,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964907503] [2024-06-27 22:46:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964907503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:27,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:27,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852078407] [2024-06-27 22:46:27,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:27,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:27,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:27,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:46:27,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 510 transitions, 8167 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:27,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:27,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:46:27,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:32,699 INFO L124 PetriNetUnfolderBase]: 8833/13555 cut-off events. [2024-06-27 22:46:32,699 INFO L125 PetriNetUnfolderBase]: For 242482/242490 co-relation queries the response was YES. [2024-06-27 22:46:32,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90498 conditions, 13555 events. 8833/13555 cut-off events. For 242482/242490 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 87459 event pairs, 1359 based on Foata normal form. 9/13562 useless extension candidates. Maximal degree in co-relation 90374. Up to 11046 conditions per place. [2024-06-27 22:46:32,875 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 404 selfloop transitions, 215 changer transitions 0/626 dead transitions. [2024-06-27 22:46:32,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 626 transitions, 10351 flow [2024-06-27 22:46:32,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:46:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:46:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 303 transitions. [2024-06-27 22:46:32,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915 [2024-06-27 22:46:32,877 INFO L175 Difference]: Start difference. First operand has 276 places, 510 transitions, 8167 flow. Second operand 12 states and 303 transitions. [2024-06-27 22:46:32,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 626 transitions, 10351 flow [2024-06-27 22:46:33,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 626 transitions, 9961 flow, removed 105 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:33,649 INFO L231 Difference]: Finished difference. Result has 284 places, 524 transitions, 8487 flow [2024-06-27 22:46:33,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7871, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8487, PETRI_PLACES=284, PETRI_TRANSITIONS=524} [2024-06-27 22:46:33,650 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 233 predicate places. [2024-06-27 22:46:33,650 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 524 transitions, 8487 flow [2024-06-27 22:46:33,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:33,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:33,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:33,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:46:33,651 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:46:33,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash -89367129, now seen corresponding path program 3 times [2024-06-27 22:46:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071877204] [2024-06-27 22:46:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071877204] [2024-06-27 22:46:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071877204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:41,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:41,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898478538] [2024-06-27 22:46:41,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:41,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:41,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:42,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:46:42,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 524 transitions, 8487 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:42,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:42,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:46:42,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:45,961 INFO L124 PetriNetUnfolderBase]: 8931/13638 cut-off events. [2024-06-27 22:46:45,962 INFO L125 PetriNetUnfolderBase]: For 261236/261252 co-relation queries the response was YES. [2024-06-27 22:46:46,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92254 conditions, 13638 events. 8931/13638 cut-off events. For 261236/261252 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 87853 event pairs, 1470 based on Foata normal form. 13/13647 useless extension candidates. Maximal degree in co-relation 92129. Up to 11759 conditions per place. [2024-06-27 22:46:46,119 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 435 selfloop transitions, 143 changer transitions 0/585 dead transitions. [2024-06-27 22:46:46,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 585 transitions, 10123 flow [2024-06-27 22:46:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 22:46:46,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-06-27 22:46:46,120 INFO L175 Difference]: Start difference. First operand has 284 places, 524 transitions, 8487 flow. Second operand 8 states and 196 transitions. [2024-06-27 22:46:46,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 585 transitions, 10123 flow [2024-06-27 22:46:46,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 585 transitions, 9765 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:46,738 INFO L231 Difference]: Finished difference. Result has 286 places, 531 transitions, 8625 flow [2024-06-27 22:46:46,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8155, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8625, PETRI_PLACES=286, PETRI_TRANSITIONS=531} [2024-06-27 22:46:46,738 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 235 predicate places. [2024-06-27 22:46:46,739 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 531 transitions, 8625 flow [2024-06-27 22:46:46,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:46,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:46,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:46,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:46:46,739 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:46:46,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash 81633831, now seen corresponding path program 4 times [2024-06-27 22:46:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305428180] [2024-06-27 22:46:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:53,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305428180] [2024-06-27 22:46:53,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305428180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:53,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:53,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407513925] [2024-06-27 22:46:53,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:53,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:53,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:53,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:53,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:53,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:46:53,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 531 transitions, 8625 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:53,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:53,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:46:53,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:57,899 INFO L124 PetriNetUnfolderBase]: 8977/13746 cut-off events. [2024-06-27 22:46:57,899 INFO L125 PetriNetUnfolderBase]: For 266244/266260 co-relation queries the response was YES. [2024-06-27 22:46:58,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92969 conditions, 13746 events. 8977/13746 cut-off events. For 266244/266260 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 88919 event pairs, 1480 based on Foata normal form. 13/13755 useless extension candidates. Maximal degree in co-relation 92843. Up to 11799 conditions per place. [2024-06-27 22:46:58,407 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 442 selfloop transitions, 155 changer transitions 0/604 dead transitions. [2024-06-27 22:46:58,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 604 transitions, 10371 flow [2024-06-27 22:46:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:46:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:46:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-06-27 22:46:58,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2024-06-27 22:46:58,409 INFO L175 Difference]: Start difference. First operand has 286 places, 531 transitions, 8625 flow. Second operand 10 states and 242 transitions. [2024-06-27 22:46:58,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 604 transitions, 10371 flow [2024-06-27 22:46:59,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 604 transitions, 10168 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:59,065 INFO L231 Difference]: Finished difference. Result has 291 places, 535 transitions, 8817 flow [2024-06-27 22:46:59,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8425, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8817, PETRI_PLACES=291, PETRI_TRANSITIONS=535} [2024-06-27 22:46:59,066 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 240 predicate places. [2024-06-27 22:46:59,066 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 535 transitions, 8817 flow [2024-06-27 22:46:59,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:59,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:59,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:59,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:46:59,066 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:46:59,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash -993695651, now seen corresponding path program 5 times [2024-06-27 22:46:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:59,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297345740] [2024-06-27 22:46:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:06,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297345740] [2024-06-27 22:47:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297345740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:06,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902811514] [2024-06-27 22:47:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:06,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:47:06,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 535 transitions, 8817 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:06,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:06,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:47:06,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:11,639 INFO L124 PetriNetUnfolderBase]: 9599/14759 cut-off events. [2024-06-27 22:47:11,640 INFO L125 PetriNetUnfolderBase]: For 293250/293250 co-relation queries the response was YES. [2024-06-27 22:47:11,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101340 conditions, 14759 events. 9599/14759 cut-off events. For 293250/293250 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 97028 event pairs, 1397 based on Foata normal form. 1/14758 useless extension candidates. Maximal degree in co-relation 101214. Up to 11764 conditions per place. [2024-06-27 22:47:11,826 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 508 selfloop transitions, 321 changer transitions 0/836 dead transitions. [2024-06-27 22:47:11,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 836 transitions, 14695 flow [2024-06-27 22:47:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 22:47:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 22:47:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 373 transitions. [2024-06-27 22:47:11,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290780141843971 [2024-06-27 22:47:11,827 INFO L175 Difference]: Start difference. First operand has 291 places, 535 transitions, 8817 flow. Second operand 15 states and 373 transitions. [2024-06-27 22:47:11,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 836 transitions, 14695 flow [2024-06-27 22:47:12,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 836 transitions, 14152 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-27 22:47:12,635 INFO L231 Difference]: Finished difference. Result has 306 places, 692 transitions, 12301 flow [2024-06-27 22:47:12,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8514, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12301, PETRI_PLACES=306, PETRI_TRANSITIONS=692} [2024-06-27 22:47:12,636 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 255 predicate places. [2024-06-27 22:47:12,636 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 692 transitions, 12301 flow [2024-06-27 22:47:12,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:12,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:12,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:12,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:47:12,636 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:47:12,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 148410791, now seen corresponding path program 6 times [2024-06-27 22:47:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916294448] [2024-06-27 22:47:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916294448] [2024-06-27 22:47:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916294448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:19,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198847938] [2024-06-27 22:47:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:19,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:19,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:19,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:19,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:19,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:47:19,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 692 transitions, 12301 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:19,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:19,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:47:19,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:25,051 INFO L124 PetriNetUnfolderBase]: 9626/14756 cut-off events. [2024-06-27 22:47:25,051 INFO L125 PetriNetUnfolderBase]: For 341407/341455 co-relation queries the response was YES. [2024-06-27 22:47:25,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105727 conditions, 14756 events. 9626/14756 cut-off events. For 341407/341455 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 96787 event pairs, 1455 based on Foata normal form. 36/14787 useless extension candidates. Maximal degree in co-relation 105594. Up to 12941 conditions per place. [2024-06-27 22:47:25,230 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 577 selfloop transitions, 160 changer transitions 0/744 dead transitions. [2024-06-27 22:47:25,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 744 transitions, 14383 flow [2024-06-27 22:47:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 22:47:25,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197568389057751 [2024-06-27 22:47:25,232 INFO L175 Difference]: Start difference. First operand has 306 places, 692 transitions, 12301 flow. Second operand 7 states and 171 transitions. [2024-06-27 22:47:25,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 744 transitions, 14383 flow [2024-06-27 22:47:26,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 744 transitions, 13755 flow, removed 200 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:26,543 INFO L231 Difference]: Finished difference. Result has 307 places, 703 transitions, 12281 flow [2024-06-27 22:47:26,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=11731, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12281, PETRI_PLACES=307, PETRI_TRANSITIONS=703} [2024-06-27 22:47:26,543 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 256 predicate places. [2024-06-27 22:47:26,544 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 703 transitions, 12281 flow [2024-06-27 22:47:26,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:26,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:26,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:26,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:47:26,544 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:47:26,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2145297789, now seen corresponding path program 1 times [2024-06-27 22:47:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380639079] [2024-06-27 22:47:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380639079] [2024-06-27 22:47:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380639079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270175626] [2024-06-27 22:47:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:33,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:33,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:47:33,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 703 transitions, 12281 flow. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:33,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:33,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:47:33,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:40,246 INFO L124 PetriNetUnfolderBase]: 11163/17045 cut-off events. [2024-06-27 22:47:40,246 INFO L125 PetriNetUnfolderBase]: For 402900/403055 co-relation queries the response was YES. [2024-06-27 22:47:40,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126686 conditions, 17045 events. 11163/17045 cut-off events. For 402900/403055 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 114302 event pairs, 1438 based on Foata normal form. 77/17051 useless extension candidates. Maximal degree in co-relation 126553. Up to 12870 conditions per place. [2024-06-27 22:47:40,481 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 593 selfloop transitions, 355 changer transitions 0/1011 dead transitions. [2024-06-27 22:47:40,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 1011 transitions, 19153 flow [2024-06-27 22:47:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:47:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:47:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 313 transitions. [2024-06-27 22:47:40,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122749590834698 [2024-06-27 22:47:40,482 INFO L175 Difference]: Start difference. First operand has 307 places, 703 transitions, 12281 flow. Second operand 13 states and 313 transitions. [2024-06-27 22:47:40,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 1011 transitions, 19153 flow [2024-06-27 22:47:41,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 1011 transitions, 18622 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:41,879 INFO L231 Difference]: Finished difference. Result has 321 places, 883 transitions, 16359 flow [2024-06-27 22:47:41,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=11900, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=16359, PETRI_PLACES=321, PETRI_TRANSITIONS=883} [2024-06-27 22:47:41,880 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 270 predicate places. [2024-06-27 22:47:41,880 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 883 transitions, 16359 flow [2024-06-27 22:47:41,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:41,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:41,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:41,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:47:41,881 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:47:41,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1155656335, now seen corresponding path program 2 times [2024-06-27 22:47:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109450179] [2024-06-27 22:47:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109450179] [2024-06-27 22:47:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109450179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546482721] [2024-06-27 22:47:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:50,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:50,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:50,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:50,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-06-27 22:47:50,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 883 transitions, 16359 flow. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:50,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:50,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-06-27 22:47:50,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:56,980 INFO L124 PetriNetUnfolderBase]: 11423/17466 cut-off events. [2024-06-27 22:47:56,980 INFO L125 PetriNetUnfolderBase]: For 446154/446382 co-relation queries the response was YES. [2024-06-27 22:47:57,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135049 conditions, 17466 events. 11423/17466 cut-off events. For 446154/446382 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 117870 event pairs, 1466 based on Foata normal form. 120/17509 useless extension candidates. Maximal degree in co-relation 134909. Up to 12893 conditions per place. [2024-06-27 22:47:57,391 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 514 selfloop transitions, 388 changer transitions 0/965 dead transitions. [2024-06-27 22:47:57,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 965 transitions, 19111 flow [2024-06-27 22:47:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:47:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:47:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 262 transitions. [2024-06-27 22:47:57,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067698259187621 [2024-06-27 22:47:57,393 INFO L175 Difference]: Start difference. First operand has 321 places, 883 transitions, 16359 flow. Second operand 11 states and 262 transitions. [2024-06-27 22:47:57,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 965 transitions, 19111 flow [2024-06-27 22:47:59,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 965 transitions, 18883 flow, removed 78 selfloop flow, removed 3 redundant places. [2024-06-27 22:47:59,466 INFO L231 Difference]: Finished difference. Result has 330 places, 895 transitions, 17331 flow [2024-06-27 22:47:59,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=16143, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17331, PETRI_PLACES=330, PETRI_TRANSITIONS=895} [2024-06-27 22:47:59,467 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 279 predicate places. [2024-06-27 22:47:59,467 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 895 transitions, 17331 flow [2024-06-27 22:47:59,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:59,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:59,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:59,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:47:59,468 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:47:59,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash -712965269, now seen corresponding path program 4 times [2024-06-27 22:47:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524394849] [2024-06-27 22:47:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat