./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 19:25:51,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:25:52,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:25:52,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:25:52,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:25:52,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:25:52,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:25:52,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:25:52,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:25:52,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:25:52,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:25:52,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:25:52,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:25:52,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:25:52,071 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:25:52,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:25:52,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:25:52,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:25:52,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:25:52,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:25:52,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:25:52,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:25:52,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:25:52,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:25:52,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:25:52,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:25:52,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:25:52,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:25:52,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:25:52,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:25:52,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:25:52,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:25:52,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:25:52,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:25:52,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:25:52,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:25:52,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:25:52,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:25:52,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:25:52,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:25:52,086 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:25:52,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:25:52,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:25:52,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 19:25:52,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:25:52,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:25:52,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:25:52,353 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:25:52,354 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:25:52,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-20 19:25:52,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:25:52,610 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:25:52,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-20 19:25:53,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:25:54,009 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:25:54,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-20 19:25:54,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71cc079a/c0d47ccd875f419faaa438e1dbeb9a5c/FLAG205858aca [2024-06-20 19:25:54,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71cc079a/c0d47ccd875f419faaa438e1dbeb9a5c [2024-06-20 19:25:54,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:25:54,060 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:25:54,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:25:54,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:25:54,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:25:54,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:25:52" (1/2) ... [2024-06-20 19:25:54,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406bc184 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:25:54, skipping insertion in model container [2024-06-20 19:25:54,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:25:52" (1/2) ... [2024-06-20 19:25:54,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78bf4193 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:25:54, skipping insertion in model container [2024-06-20 19:25:54,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:25:54" (2/2) ... [2024-06-20 19:25:54,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406bc184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:54, skipping insertion in model container [2024-06-20 19:25:54,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:25:54" (2/2) ... [2024-06-20 19:25:54,070 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:25:54,167 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:25:54,168 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-20 19:25:54,169 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-20 19:25:54,170 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p2_EAX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-06-20 19:25:54,170 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:25:54,171 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-20 19:25:54,215 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:25:54,668 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:25:54,683 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:25:55,034 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:25:55,080 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:25:55,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55 WrapperNode [2024-06-20 19:25:55,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:25:55,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:25:55,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:25:55,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:25:55,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,298 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2024-06-20 19:25:55,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:25:55,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:25:55,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:25:55,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:25:55,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-20 19:25:55,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:25:55,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:25:55,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:25:55,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:25:55,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (1/1) ... [2024-06-20 19:25:55,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:25:55,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:25:55,514 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-20 19:25:55,540 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-20 19:25:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:25:55,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:25:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:25:55,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:25:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:25:55,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:25:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 19:25:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 19:25:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:25:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:25:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:25:55,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:25:55,564 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:25:55,801 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:25:55,804 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:25:57,187 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:25:57,188 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:25:57,525 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:25:57,525 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:25:57,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:25:57 BoogieIcfgContainer [2024-06-20 19:25:57,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:25:57,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:25:57,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:25:57,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:25:57,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:25:52" (1/4) ... [2024-06-20 19:25:57,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615e176e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:25:57, skipping insertion in model container [2024-06-20 19:25:57,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:25:54" (2/4) ... [2024-06-20 19:25:57,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615e176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:25:57, skipping insertion in model container [2024-06-20 19:25:57,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:25:55" (3/4) ... [2024-06-20 19:25:57,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615e176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:25:57, skipping insertion in model container [2024-06-20 19:25:57,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:25:57" (4/4) ... [2024-06-20 19:25:57,535 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-20 19:25:57,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:25:57,551 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 19:25:57,551 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:25:57,674 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:25:57,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-20 19:25:57,787 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-20 19:25:57,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:25:57,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:25:57,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-20 19:25:57,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-20 19:25:57,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:25:57,816 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;@254c53e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:25:57,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 19:25:57,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:25:57,826 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-20 19:25:57,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:25:57,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:57,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:25:57,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:25:57,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash 363251747, now seen corresponding path program 1 times [2024-06-20 19:25:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925536159] [2024-06-20 19:25:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:04,455 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-20 19:26:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925536159] [2024-06-20 19:26:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925536159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:04,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:04,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:26:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895793546] [2024-06-20 19:26:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:04,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:26:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:26:04,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:26:04,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-20 19:26:04,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:04,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:04,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-20 19:26:04,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:05,599 INFO L124 PetriNetUnfolderBase]: 1152/1802 cut-off events. [2024-06-20 19:26:05,599 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-20 19:26:05,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 1802 events. 1152/1802 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8629 event pairs, 785 based on Foata normal form. 1/1757 useless extension candidates. Maximal degree in co-relation 3607. Up to 1732 conditions per place. [2024-06-20 19:26:05,616 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 31 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2024-06-20 19:26:05,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 167 flow [2024-06-20 19:26:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:26:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:26:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-20 19:26:05,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2024-06-20 19:26:05,630 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 71 transitions. [2024-06-20 19:26:05,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 167 flow [2024-06-20 19:26:05,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 19:26:05,635 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow [2024-06-20 19:26:05,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-20 19:26:05,640 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2024-06-20 19:26:05,640 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow [2024-06-20 19:26:05,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:05,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:05,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:26:05,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:05,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1192620866, now seen corresponding path program 1 times [2024-06-20 19:26:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937187128] [2024-06-20 19:26:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:09,912 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-20 19:26:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937187128] [2024-06-20 19:26:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937187128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:26:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385178843] [2024-06-20 19:26:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:09,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:26:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:09,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:26:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:26:10,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-20 19:26:10,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:10,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:10,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-20 19:26:10,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:10,970 INFO L124 PetriNetUnfolderBase]: 1353/2040 cut-off events. [2024-06-20 19:26:10,970 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2024-06-20 19:26:10,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4696 conditions, 2040 events. 1353/2040 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9519 event pairs, 795 based on Foata normal form. 3/2041 useless extension candidates. Maximal degree in co-relation 4684. Up to 2005 conditions per place. [2024-06-20 19:26:10,984 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2024-06-20 19:26:10,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 236 flow [2024-06-20 19:26:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:26:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:26:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-06-20 19:26:10,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55625 [2024-06-20 19:26:10,987 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 89 transitions. [2024-06-20 19:26:10,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 236 flow [2024-06-20 19:26:10,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:26:10,989 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 134 flow [2024-06-20 19:26:10,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-20 19:26:10,990 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-20 19:26:10,990 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 134 flow [2024-06-20 19:26:10,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:10,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:10,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:10,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:26:10,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:10,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1683457414, now seen corresponding path program 1 times [2024-06-20 19:26:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098499420] [2024-06-20 19:26:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:26:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:15,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098499420] [2024-06-20 19:26:15,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098499420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:15,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:15,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:26:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874812069] [2024-06-20 19:26:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:15,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:26:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:15,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:26:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:26:15,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-20 19:26:15,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:15,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:15,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-20 19:26:15,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:16,209 INFO L124 PetriNetUnfolderBase]: 1361/2060 cut-off events. [2024-06-20 19:26:16,209 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-06-20 19:26:16,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5270 conditions, 2060 events. 1361/2060 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9757 event pairs, 569 based on Foata normal form. 5/2062 useless extension candidates. Maximal degree in co-relation 5256. Up to 1951 conditions per place. [2024-06-20 19:26:16,221 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 52 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2024-06-20 19:26:16,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 390 flow [2024-06-20 19:26:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:26:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:26:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-06-20 19:26:16,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.585 [2024-06-20 19:26:16,225 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 134 flow. Second operand 5 states and 117 transitions. [2024-06-20 19:26:16,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 390 flow [2024-06-20 19:26:16,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 376 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 19:26:16,229 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 233 flow [2024-06-20 19:26:16,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2024-06-20 19:26:16,230 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2024-06-20 19:26:16,230 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 233 flow [2024-06-20 19:26:16,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:16,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:16,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:16,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:26:16,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:16,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:16,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2036545723, now seen corresponding path program 1 times [2024-06-20 19:26:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:16,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348144092] [2024-06-20 19:26:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:16,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:20,606 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-20 19:26:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348144092] [2024-06-20 19:26:20,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348144092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:20,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:20,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:26:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733488842] [2024-06-20 19:26:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:26:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:26:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:26:20,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2024-06-20 19:26:20,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:20,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:20,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2024-06-20 19:26:20,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:21,891 INFO L124 PetriNetUnfolderBase]: 1373/2080 cut-off events. [2024-06-20 19:26:21,891 INFO L125 PetriNetUnfolderBase]: For 2771/2774 co-relation queries the response was YES. [2024-06-20 19:26:21,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 2080 events. 1373/2080 cut-off events. For 2771/2774 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9878 event pairs, 405 based on Foata normal form. 12/2089 useless extension candidates. Maximal degree in co-relation 6283. Up to 1919 conditions per place. [2024-06-20 19:26:21,904 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 56 selfloop transitions, 19 changer transitions 0/80 dead transitions. [2024-06-20 19:26:21,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 493 flow [2024-06-20 19:26:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:26:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:26:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-20 19:26:21,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2024-06-20 19:26:21,912 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 233 flow. Second operand 6 states and 134 transitions. [2024-06-20 19:26:21,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 493 flow [2024-06-20 19:26:21,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 485 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-20 19:26:21,921 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 289 flow [2024-06-20 19:26:21,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-06-20 19:26:21,923 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2024-06-20 19:26:21,924 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 289 flow [2024-06-20 19:26:21,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:21,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:21,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:21,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:26:21,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:21,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash 504448289, now seen corresponding path program 1 times [2024-06-20 19:26:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:21,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282854876] [2024-06-20 19:26:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:21,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:31,352 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-20 19:26:31,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:31,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282854876] [2024-06-20 19:26:31,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282854876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:31,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:31,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:26:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377238329] [2024-06-20 19:26:31,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:31,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:26:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:31,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:26:31,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:26:31,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:26:31,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:31,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:31,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:26:31,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:32,340 INFO L124 PetriNetUnfolderBase]: 1161/1821 cut-off events. [2024-06-20 19:26:32,341 INFO L125 PetriNetUnfolderBase]: For 3486/3486 co-relation queries the response was YES. [2024-06-20 19:26:32,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 1821 events. 1161/1821 cut-off events. For 3486/3486 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8878 event pairs, 463 based on Foata normal form. 2/1821 useless extension candidates. Maximal degree in co-relation 5974. Up to 1739 conditions per place. [2024-06-20 19:26:32,352 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 48 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2024-06-20 19:26:32,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 429 flow [2024-06-20 19:26:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:26:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:26:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-20 19:26:32,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-06-20 19:26:32,357 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 289 flow. Second operand 5 states and 89 transitions. [2024-06-20 19:26:32,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 429 flow [2024-06-20 19:26:32,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 379 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 19:26:32,362 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 263 flow [2024-06-20 19:26:32,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-20 19:26:32,363 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2024-06-20 19:26:32,363 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 263 flow [2024-06-20 19:26:32,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:32,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:32,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:26:32,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:32,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1543037825, now seen corresponding path program 1 times [2024-06-20 19:26:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475132690] [2024-06-20 19:26:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:41,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-20 19:26:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:41,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475132690] [2024-06-20 19:26:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475132690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:41,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:41,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:26:41,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482924889] [2024-06-20 19:26:41,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:41,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:26:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:41,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:26:41,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:26:41,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:26:41,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:41,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:41,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:26:41,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:42,683 INFO L124 PetriNetUnfolderBase]: 1151/1843 cut-off events. [2024-06-20 19:26:42,683 INFO L125 PetriNetUnfolderBase]: For 4007/4007 co-relation queries the response was YES. [2024-06-20 19:26:42,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 1843 events. 1151/1843 cut-off events. For 4007/4007 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9043 event pairs, 433 based on Foata normal form. 4/1845 useless extension candidates. Maximal degree in co-relation 5960. Up to 1707 conditions per place. [2024-06-20 19:26:42,696 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 53 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2024-06-20 19:26:42,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 449 flow [2024-06-20 19:26:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:26:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:26:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-20 19:26:42,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-20 19:26:42,699 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 263 flow. Second operand 6 states and 106 transitions. [2024-06-20 19:26:42,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 449 flow [2024-06-20 19:26:42,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 427 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:26:42,705 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 295 flow [2024-06-20 19:26:42,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-06-20 19:26:42,708 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2024-06-20 19:26:42,709 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 295 flow [2024-06-20 19:26:42,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:42,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:42,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:42,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:26:42,710 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:42,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -562934604, now seen corresponding path program 1 times [2024-06-20 19:26:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:42,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421917730] [2024-06-20 19:26:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:51,831 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-20 19:26:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421917730] [2024-06-20 19:26:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421917730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:51,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:26:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981374735] [2024-06-20 19:26:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:51,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:26:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:26:51,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:26:51,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:26:51,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 295 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:51,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:51,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:26:51,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:53,023 INFO L124 PetriNetUnfolderBase]: 1364/2068 cut-off events. [2024-06-20 19:26:53,024 INFO L125 PetriNetUnfolderBase]: For 6198/6204 co-relation queries the response was YES. [2024-06-20 19:26:53,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7352 conditions, 2068 events. 1364/2068 cut-off events. For 6198/6204 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9675 event pairs, 539 based on Foata normal form. 8/2073 useless extension candidates. Maximal degree in co-relation 7329. Up to 1956 conditions per place. [2024-06-20 19:26:53,042 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 53 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2024-06-20 19:26:53,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 535 flow [2024-06-20 19:26:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:26:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:26:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-20 19:26:53,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2024-06-20 19:26:53,045 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 295 flow. Second operand 6 states and 109 transitions. [2024-06-20 19:26:53,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 535 flow [2024-06-20 19:26:53,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 505 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 19:26:53,052 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 337 flow [2024-06-20 19:26:53,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=337, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-06-20 19:26:53,054 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-20 19:26:53,054 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 337 flow [2024-06-20 19:26:53,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:53,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:53,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:26:53,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:53,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -556471104, now seen corresponding path program 2 times [2024-06-20 19:26:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390156841] [2024-06-20 19:26:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:27:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390156841] [2024-06-20 19:27:02,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390156841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:02,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:27:02,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695866052] [2024-06-20 19:27:02,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:02,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:27:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:27:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:27:02,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:02,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 337 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:02,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:02,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:02,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:03,338 INFO L124 PetriNetUnfolderBase]: 1352/2041 cut-off events. [2024-06-20 19:27:03,339 INFO L125 PetriNetUnfolderBase]: For 7423/7427 co-relation queries the response was YES. [2024-06-20 19:27:03,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7491 conditions, 2041 events. 1352/2041 cut-off events. For 7423/7427 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9484 event pairs, 553 based on Foata normal form. 3/2037 useless extension candidates. Maximal degree in co-relation 7467. Up to 1940 conditions per place. [2024-06-20 19:27:03,352 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 47 selfloop transitions, 20 changer transitions 0/71 dead transitions. [2024-06-20 19:27:03,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 509 flow [2024-06-20 19:27:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:27:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:27:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-20 19:27:03,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:27:03,354 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 337 flow. Second operand 6 states and 105 transitions. [2024-06-20 19:27:03,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 509 flow [2024-06-20 19:27:03,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 480 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 19:27:03,361 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 356 flow [2024-06-20 19:27:03,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-06-20 19:27:03,361 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2024-06-20 19:27:03,362 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 356 flow [2024-06-20 19:27:03,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:03,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:03,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:03,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:27:03,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:03,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1356861440, now seen corresponding path program 1 times [2024-06-20 19:27:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725213996] [2024-06-20 19:27:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:09,199 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-20 19:27:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725213996] [2024-06-20 19:27:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725213996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:27:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445334885] [2024-06-20 19:27:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:09,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:27:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:27:09,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:27:09,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:09,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:09,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:09,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:09,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:10,360 INFO L124 PetriNetUnfolderBase]: 1526/2312 cut-off events. [2024-06-20 19:27:10,360 INFO L125 PetriNetUnfolderBase]: For 10062/10062 co-relation queries the response was YES. [2024-06-20 19:27:10,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8837 conditions, 2312 events. 1526/2312 cut-off events. For 10062/10062 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10967 event pairs, 466 based on Foata normal form. 8/2315 useless extension candidates. Maximal degree in co-relation 8812. Up to 1940 conditions per place. [2024-06-20 19:27:10,370 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 78 selfloop transitions, 39 changer transitions 0/121 dead transitions. [2024-06-20 19:27:10,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 121 transitions, 991 flow [2024-06-20 19:27:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:27:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:27:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 19:27:10,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-20 19:27:10,373 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 356 flow. Second operand 8 states and 152 transitions. [2024-06-20 19:27:10,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 121 transitions, 991 flow [2024-06-20 19:27:10,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 121 transitions, 865 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:27:10,381 INFO L231 Difference]: Finished difference. Result has 67 places, 80 transitions, 577 flow [2024-06-20 19:27:10,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=577, PETRI_PLACES=67, PETRI_TRANSITIONS=80} [2024-06-20 19:27:10,382 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-06-20 19:27:10,383 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 80 transitions, 577 flow [2024-06-20 19:27:10,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:10,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:10,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:10,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:27:10,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:10,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1192082890, now seen corresponding path program 2 times [2024-06-20 19:27:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124234278] [2024-06-20 19:27:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:19,940 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-20 19:27:19,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:19,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124234278] [2024-06-20 19:27:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124234278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:27:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281175480] [2024-06-20 19:27:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:19,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:27:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:27:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:27:20,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:20,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 80 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:20,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:20,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:20,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:21,099 INFO L124 PetriNetUnfolderBase]: 1598/2415 cut-off events. [2024-06-20 19:27:21,099 INFO L125 PetriNetUnfolderBase]: For 13189/13194 co-relation queries the response was YES. [2024-06-20 19:27:21,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10200 conditions, 2415 events. 1598/2415 cut-off events. For 13189/13194 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11473 event pairs, 465 based on Foata normal form. 14/2426 useless extension candidates. Maximal degree in co-relation 10171. Up to 1988 conditions per place. [2024-06-20 19:27:21,111 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 70 selfloop transitions, 51 changer transitions 0/125 dead transitions. [2024-06-20 19:27:21,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 125 transitions, 1045 flow [2024-06-20 19:27:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:27:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:27:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-20 19:27:21,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-20 19:27:21,115 INFO L175 Difference]: Start difference. First operand has 67 places, 80 transitions, 577 flow. Second operand 9 states and 159 transitions. [2024-06-20 19:27:21,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 125 transitions, 1045 flow [2024-06-20 19:27:21,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 125 transitions, 1017 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-20 19:27:21,129 INFO L231 Difference]: Finished difference. Result has 74 places, 87 transitions, 736 flow [2024-06-20 19:27:21,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=736, PETRI_PLACES=74, PETRI_TRANSITIONS=87} [2024-06-20 19:27:21,129 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2024-06-20 19:27:21,130 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 87 transitions, 736 flow [2024-06-20 19:27:21,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:21,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:21,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:21,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:27:21,130 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:21,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash -70733930, now seen corresponding path program 3 times [2024-06-20 19:27:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:21,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308286272] [2024-06-20 19:27:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:27:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:30,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308286272] [2024-06-20 19:27:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308286272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:30,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:27:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770436812] [2024-06-20 19:27:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:30,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:27:30,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:27:30,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:27:30,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:30,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 87 transitions, 736 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:30,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:30,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:30,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:32,027 INFO L124 PetriNetUnfolderBase]: 1634/2476 cut-off events. [2024-06-20 19:27:32,027 INFO L125 PetriNetUnfolderBase]: For 15903/15909 co-relation queries the response was YES. [2024-06-20 19:27:32,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11193 conditions, 2476 events. 1634/2476 cut-off events. For 15903/15909 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11821 event pairs, 469 based on Foata normal form. 7/2473 useless extension candidates. Maximal degree in co-relation 11162. Up to 2004 conditions per place. [2024-06-20 19:27:32,040 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 73 selfloop transitions, 62 changer transitions 0/139 dead transitions. [2024-06-20 19:27:32,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 139 transitions, 1344 flow [2024-06-20 19:27:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:27:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:27:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-20 19:27:32,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:27:32,044 INFO L175 Difference]: Start difference. First operand has 74 places, 87 transitions, 736 flow. Second operand 10 states and 175 transitions. [2024-06-20 19:27:32,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 139 transitions, 1344 flow [2024-06-20 19:27:32,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 1192 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-20 19:27:32,064 INFO L231 Difference]: Finished difference. Result has 78 places, 97 transitions, 852 flow [2024-06-20 19:27:32,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=852, PETRI_PLACES=78, PETRI_TRANSITIONS=97} [2024-06-20 19:27:32,065 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2024-06-20 19:27:32,065 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 97 transitions, 852 flow [2024-06-20 19:27:32,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:32,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:32,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:32,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:27:32,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:32,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1095605090, now seen corresponding path program 4 times [2024-06-20 19:27:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:32,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288626787] [2024-06-20 19:27:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:41,783 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-20 19:27:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288626787] [2024-06-20 19:27:41,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288626787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:41,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:41,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:27:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155271154] [2024-06-20 19:27:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:41,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:27:41,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:27:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:27:41,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:41,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 97 transitions, 852 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:41,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:41,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:41,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:42,833 INFO L124 PetriNetUnfolderBase]: 1618/2447 cut-off events. [2024-06-20 19:27:42,834 INFO L125 PetriNetUnfolderBase]: For 15495/15501 co-relation queries the response was YES. [2024-06-20 19:27:42,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10932 conditions, 2447 events. 1618/2447 cut-off events. For 15495/15501 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11617 event pairs, 469 based on Foata normal form. 7/2444 useless extension candidates. Maximal degree in co-relation 10900. Up to 1997 conditions per place. [2024-06-20 19:27:42,850 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 63 selfloop transitions, 61 changer transitions 0/128 dead transitions. [2024-06-20 19:27:42,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 128 transitions, 1240 flow [2024-06-20 19:27:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:27:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:27:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-20 19:27:42,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2024-06-20 19:27:42,854 INFO L175 Difference]: Start difference. First operand has 78 places, 97 transitions, 852 flow. Second operand 8 states and 142 transitions. [2024-06-20 19:27:42,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 128 transitions, 1240 flow [2024-06-20 19:27:42,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 128 transitions, 1087 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-20 19:27:42,875 INFO L231 Difference]: Finished difference. Result has 79 places, 97 transitions, 831 flow [2024-06-20 19:27:42,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=831, PETRI_PLACES=79, PETRI_TRANSITIONS=97} [2024-06-20 19:27:42,876 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2024-06-20 19:27:42,876 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 97 transitions, 831 flow [2024-06-20 19:27:42,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:42,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:42,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:42,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:27:42,877 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:42,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1095596162, now seen corresponding path program 1 times [2024-06-20 19:27:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:42,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209562101] [2024-06-20 19:27:42,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:42,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:52,387 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-20 19:27:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209562101] [2024-06-20 19:27:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209562101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:52,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:27:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690879529] [2024-06-20 19:27:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:52,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:27:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:27:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:27:52,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:27:52,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 97 transitions, 831 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:52,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:52,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:27:52,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:53,463 INFO L124 PetriNetUnfolderBase]: 1403/2212 cut-off events. [2024-06-20 19:27:53,463 INFO L125 PetriNetUnfolderBase]: For 14108/14110 co-relation queries the response was YES. [2024-06-20 19:27:53,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 2212 events. 1403/2212 cut-off events. For 14108/14110 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10809 event pairs, 433 based on Foata normal form. 4/2214 useless extension candidates. Maximal degree in co-relation 9801. Up to 2052 conditions per place. [2024-06-20 19:27:53,472 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 102 selfloop transitions, 13 changer transitions 0/120 dead transitions. [2024-06-20 19:27:53,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 120 transitions, 1145 flow [2024-06-20 19:27:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:27:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:27:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-20 19:27:53,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-20 19:27:53,475 INFO L175 Difference]: Start difference. First operand has 79 places, 97 transitions, 831 flow. Second operand 7 states and 122 transitions. [2024-06-20 19:27:53,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 120 transitions, 1145 flow [2024-06-20 19:27:53,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 1023 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-20 19:27:53,493 INFO L231 Difference]: Finished difference. Result has 79 places, 99 transitions, 768 flow [2024-06-20 19:27:53,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=79, PETRI_TRANSITIONS=99} [2024-06-20 19:27:53,494 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2024-06-20 19:27:53,494 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 99 transitions, 768 flow [2024-06-20 19:27:53,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:53,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:53,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:53,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:27:53,495 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:53,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1727827912, now seen corresponding path program 1 times [2024-06-20 19:27:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982334630] [2024-06-20 19:27:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:02,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-20 19:28:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:02,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982334630] [2024-06-20 19:28:02,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982334630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:02,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:02,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:28:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881820662] [2024-06-20 19:28:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:02,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:28:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:28:02,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:28:02,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:28:02,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 99 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:02,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:02,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:28:02,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:03,113 INFO L124 PetriNetUnfolderBase]: 1400/2214 cut-off events. [2024-06-20 19:28:03,113 INFO L125 PetriNetUnfolderBase]: For 14975/14977 co-relation queries the response was YES. [2024-06-20 19:28:03,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9754 conditions, 2214 events. 1400/2214 cut-off events. For 14975/14977 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10920 event pairs, 466 based on Foata normal form. 1/2213 useless extension candidates. Maximal degree in co-relation 9720. Up to 2090 conditions per place. [2024-06-20 19:28:03,123 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 97 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2024-06-20 19:28:03,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 1024 flow [2024-06-20 19:28:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:28:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:28:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-20 19:28:03,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:28:03,124 INFO L175 Difference]: Start difference. First operand has 79 places, 99 transitions, 768 flow. Second operand 5 states and 85 transitions. [2024-06-20 19:28:03,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 1024 flow [2024-06-20 19:28:03,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 983 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-20 19:28:03,140 INFO L231 Difference]: Finished difference. Result has 79 places, 102 transitions, 777 flow [2024-06-20 19:28:03,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=777, PETRI_PLACES=79, PETRI_TRANSITIONS=102} [2024-06-20 19:28:03,140 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2024-06-20 19:28:03,141 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 102 transitions, 777 flow [2024-06-20 19:28:03,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:03,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:03,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:03,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:28:03,141 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:03,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:03,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1700131418, now seen corresponding path program 1 times [2024-06-20 19:28:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116811415] [2024-06-20 19:28:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:12,844 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-20 19:28:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116811415] [2024-06-20 19:28:12,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116811415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:12,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:12,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:28:12,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213389568] [2024-06-20 19:28:12,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:12,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:28:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:28:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:28:12,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:12,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 102 transitions, 777 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:12,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:12,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:12,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:13,996 INFO L124 PetriNetUnfolderBase]: 1648/2516 cut-off events. [2024-06-20 19:28:13,996 INFO L125 PetriNetUnfolderBase]: For 20731/20740 co-relation queries the response was YES. [2024-06-20 19:28:14,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11538 conditions, 2516 events. 1648/2516 cut-off events. For 20731/20740 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12132 event pairs, 452 based on Foata normal form. 16/2529 useless extension candidates. Maximal degree in co-relation 11503. Up to 2015 conditions per place. [2024-06-20 19:28:14,009 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 83 selfloop transitions, 67 changer transitions 0/154 dead transitions. [2024-06-20 19:28:14,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 154 transitions, 1337 flow [2024-06-20 19:28:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:28:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:28:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-20 19:28:14,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425 [2024-06-20 19:28:14,012 INFO L175 Difference]: Start difference. First operand has 79 places, 102 transitions, 777 flow. Second operand 10 states and 177 transitions. [2024-06-20 19:28:14,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 154 transitions, 1337 flow [2024-06-20 19:28:14,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 154 transitions, 1309 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-20 19:28:14,026 INFO L231 Difference]: Finished difference. Result has 86 places, 108 transitions, 956 flow [2024-06-20 19:28:14,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=956, PETRI_PLACES=86, PETRI_TRANSITIONS=108} [2024-06-20 19:28:14,027 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2024-06-20 19:28:14,027 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 108 transitions, 956 flow [2024-06-20 19:28:14,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:14,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:14,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:14,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:28:14,028 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:14,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:14,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1700136998, now seen corresponding path program 2 times [2024-06-20 19:28:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:14,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344189892] [2024-06-20 19:28:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:23,537 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-20 19:28:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344189892] [2024-06-20 19:28:23,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344189892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:28:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357762877] [2024-06-20 19:28:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:23,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:28:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:23,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:28:23,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:28:23,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:23,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 108 transitions, 956 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:23,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:23,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:23,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:24,648 INFO L124 PetriNetUnfolderBase]: 1680/2568 cut-off events. [2024-06-20 19:28:24,648 INFO L125 PetriNetUnfolderBase]: For 24100/24105 co-relation queries the response was YES. [2024-06-20 19:28:24,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12398 conditions, 2568 events. 1680/2568 cut-off events. For 24100/24105 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12485 event pairs, 468 based on Foata normal form. 10/2575 useless extension candidates. Maximal degree in co-relation 12362. Up to 2044 conditions per place. [2024-06-20 19:28:24,660 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 81 selfloop transitions, 66 changer transitions 0/151 dead transitions. [2024-06-20 19:28:24,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 151 transitions, 1492 flow [2024-06-20 19:28:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:28:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:28:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-20 19:28:24,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-20 19:28:24,662 INFO L175 Difference]: Start difference. First operand has 86 places, 108 transitions, 956 flow. Second operand 9 states and 159 transitions. [2024-06-20 19:28:24,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 151 transitions, 1492 flow [2024-06-20 19:28:24,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 151 transitions, 1326 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-20 19:28:24,682 INFO L231 Difference]: Finished difference. Result has 87 places, 114 transitions, 1009 flow [2024-06-20 19:28:24,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1009, PETRI_PLACES=87, PETRI_TRANSITIONS=114} [2024-06-20 19:28:24,683 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2024-06-20 19:28:24,683 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 114 transitions, 1009 flow [2024-06-20 19:28:24,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:24,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:24,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:28:24,684 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:24,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash -570917640, now seen corresponding path program 3 times [2024-06-20 19:28:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340153030] [2024-06-20 19:28:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:28:34,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:34,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340153030] [2024-06-20 19:28:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340153030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:28:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240185060] [2024-06-20 19:28:34,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:34,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:28:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:28:34,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:28:34,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:34,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 114 transitions, 1009 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:34,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:34,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:34,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:35,135 INFO L124 PetriNetUnfolderBase]: 1664/2551 cut-off events. [2024-06-20 19:28:35,135 INFO L125 PetriNetUnfolderBase]: For 25895/25904 co-relation queries the response was YES. [2024-06-20 19:28:35,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12318 conditions, 2551 events. 1664/2551 cut-off events. For 25895/25904 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12422 event pairs, 494 based on Foata normal form. 9/2548 useless extension candidates. Maximal degree in co-relation 12281. Up to 2031 conditions per place. [2024-06-20 19:28:35,147 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 71 selfloop transitions, 62 changer transitions 0/137 dead transitions. [2024-06-20 19:28:35,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 1349 flow [2024-06-20 19:28:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:28:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:28:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-20 19:28:35,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-20 19:28:35,149 INFO L175 Difference]: Start difference. First operand has 87 places, 114 transitions, 1009 flow. Second operand 7 states and 123 transitions. [2024-06-20 19:28:35,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 1349 flow [2024-06-20 19:28:35,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1197 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-20 19:28:35,168 INFO L231 Difference]: Finished difference. Result has 88 places, 114 transitions, 992 flow [2024-06-20 19:28:35,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=992, PETRI_PLACES=88, PETRI_TRANSITIONS=114} [2024-06-20 19:28:35,169 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2024-06-20 19:28:35,169 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 114 transitions, 992 flow [2024-06-20 19:28:35,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:35,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:35,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:35,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:28:35,170 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:35,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 920930861, now seen corresponding path program 1 times [2024-06-20 19:28:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246467032] [2024-06-20 19:28:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:45,319 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-20 19:28:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246467032] [2024-06-20 19:28:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246467032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:28:45,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635562408] [2024-06-20 19:28:45,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:45,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:28:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:45,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:28:45,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:28:45,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:45,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 114 transitions, 992 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:45,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:45,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:45,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:46,377 INFO L124 PetriNetUnfolderBase]: 1681/2573 cut-off events. [2024-06-20 19:28:46,377 INFO L125 PetriNetUnfolderBase]: For 28412/28417 co-relation queries the response was YES. [2024-06-20 19:28:46,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12561 conditions, 2573 events. 1681/2573 cut-off events. For 28412/28417 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12526 event pairs, 380 based on Foata normal form. 6/2576 useless extension candidates. Maximal degree in co-relation 12523. Up to 2252 conditions per place. [2024-06-20 19:28:46,391 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 108 selfloop transitions, 32 changer transitions 0/144 dead transitions. [2024-06-20 19:28:46,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 144 transitions, 1456 flow [2024-06-20 19:28:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:28:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:28:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-20 19:28:46,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-20 19:28:46,394 INFO L175 Difference]: Start difference. First operand has 88 places, 114 transitions, 992 flow. Second operand 7 states and 124 transitions. [2024-06-20 19:28:46,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 144 transitions, 1456 flow [2024-06-20 19:28:46,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 144 transitions, 1312 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-20 19:28:46,432 INFO L231 Difference]: Finished difference. Result has 88 places, 118 transitions, 967 flow [2024-06-20 19:28:46,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=967, PETRI_PLACES=88, PETRI_TRANSITIONS=118} [2024-06-20 19:28:46,432 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2024-06-20 19:28:46,433 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 118 transitions, 967 flow [2024-06-20 19:28:46,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:46,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:46,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:28:46,433 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:46,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -417029477, now seen corresponding path program 2 times [2024-06-20 19:28:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781325413] [2024-06-20 19:28:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:56,404 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-20 19:28:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781325413] [2024-06-20 19:28:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781325413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:28:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127624072] [2024-06-20 19:28:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:56,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:28:56,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:56,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:28:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:28:56,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:56,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 118 transitions, 967 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:56,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:56,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:56,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:57,513 INFO L124 PetriNetUnfolderBase]: 1673/2560 cut-off events. [2024-06-20 19:28:57,513 INFO L125 PetriNetUnfolderBase]: For 30423/30428 co-relation queries the response was YES. [2024-06-20 19:28:57,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 2560 events. 1673/2560 cut-off events. For 30423/30428 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12450 event pairs, 500 based on Foata normal form. 6/2563 useless extension candidates. Maximal degree in co-relation 12477. Up to 2328 conditions per place. [2024-06-20 19:28:57,526 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 105 selfloop transitions, 33 changer transitions 0/142 dead transitions. [2024-06-20 19:28:57,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 142 transitions, 1321 flow [2024-06-20 19:28:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:28:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:28:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-20 19:28:57,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-20 19:28:57,530 INFO L175 Difference]: Start difference. First operand has 88 places, 118 transitions, 967 flow. Second operand 7 states and 122 transitions. [2024-06-20 19:28:57,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 142 transitions, 1321 flow [2024-06-20 19:28:57,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 142 transitions, 1261 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-20 19:28:57,557 INFO L231 Difference]: Finished difference. Result has 92 places, 118 transitions, 982 flow [2024-06-20 19:28:57,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=982, PETRI_PLACES=92, PETRI_TRANSITIONS=118} [2024-06-20 19:28:57,558 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2024-06-20 19:28:57,558 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 118 transitions, 982 flow [2024-06-20 19:28:57,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:57,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:57,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:57,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:28:57,558 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:57,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1164647285, now seen corresponding path program 1 times [2024-06-20 19:28:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:57,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646401280] [2024-06-20 19:28:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:06,645 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-20 19:29:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646401280] [2024-06-20 19:29:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646401280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:29:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763255598] [2024-06-20 19:29:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:29:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:29:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:29:06,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:06,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 118 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:06,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:06,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:06,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:07,932 INFO L124 PetriNetUnfolderBase]: 1765/2710 cut-off events. [2024-06-20 19:29:07,932 INFO L125 PetriNetUnfolderBase]: For 37567/37572 co-relation queries the response was YES. [2024-06-20 19:29:07,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13387 conditions, 2710 events. 1765/2710 cut-off events. For 37567/37572 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13396 event pairs, 423 based on Foata normal form. 26/2733 useless extension candidates. Maximal degree in co-relation 13346. Up to 2028 conditions per place. [2024-06-20 19:29:07,946 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 87 selfloop transitions, 73 changer transitions 0/164 dead transitions. [2024-06-20 19:29:07,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 164 transitions, 1470 flow [2024-06-20 19:29:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:29:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:29:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-20 19:29:07,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-20 19:29:07,949 INFO L175 Difference]: Start difference. First operand has 92 places, 118 transitions, 982 flow. Second operand 10 states and 176 transitions. [2024-06-20 19:29:07,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 164 transitions, 1470 flow [2024-06-20 19:29:07,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1395 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:29:07,974 INFO L231 Difference]: Finished difference. Result has 96 places, 120 transitions, 1095 flow [2024-06-20 19:29:07,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1095, PETRI_PLACES=96, PETRI_TRANSITIONS=120} [2024-06-20 19:29:07,975 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-06-20 19:29:07,975 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 120 transitions, 1095 flow [2024-06-20 19:29:07,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:07,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:07,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:07,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:29:07,977 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:07,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1382507741, now seen corresponding path program 1 times [2024-06-20 19:29:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:07,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092913133] [2024-06-20 19:29:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:07,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:16,484 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-20 19:29:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:16,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092913133] [2024-06-20 19:29:16,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092913133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:16,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:16,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:29:16,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175596043] [2024-06-20 19:29:16,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:16,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:29:16,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:16,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:29:16,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:29:16,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:16,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 120 transitions, 1095 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:16,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:16,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:16,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:17,380 INFO L124 PetriNetUnfolderBase]: 1770/2728 cut-off events. [2024-06-20 19:29:17,381 INFO L125 PetriNetUnfolderBase]: For 37891/37897 co-relation queries the response was YES. [2024-06-20 19:29:17,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14020 conditions, 2728 events. 1770/2728 cut-off events. For 37891/37897 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13537 event pairs, 529 based on Foata normal form. 7/2733 useless extension candidates. Maximal degree in co-relation 13978. Up to 2623 conditions per place. [2024-06-20 19:29:17,394 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 122 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2024-06-20 19:29:17,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 139 transitions, 1443 flow [2024-06-20 19:29:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:29:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:29:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-20 19:29:17,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 19:29:17,396 INFO L175 Difference]: Start difference. First operand has 96 places, 120 transitions, 1095 flow. Second operand 6 states and 99 transitions. [2024-06-20 19:29:17,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 139 transitions, 1443 flow [2024-06-20 19:29:17,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 139 transitions, 1289 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-20 19:29:17,425 INFO L231 Difference]: Finished difference. Result has 94 places, 123 transitions, 1004 flow [2024-06-20 19:29:17,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1004, PETRI_PLACES=94, PETRI_TRANSITIONS=123} [2024-06-20 19:29:17,426 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-06-20 19:29:17,426 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 123 transitions, 1004 flow [2024-06-20 19:29:17,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:17,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:17,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:17,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:29:17,427 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:17,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1876854729, now seen corresponding path program 2 times [2024-06-20 19:29:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:17,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296635526] [2024-06-20 19:29:17,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:26,549 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-20 19:29:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:26,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296635526] [2024-06-20 19:29:26,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296635526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:26,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:26,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:29:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168278894] [2024-06-20 19:29:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:26,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:29:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:26,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:29:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:29:26,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:26,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 123 transitions, 1004 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:26,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:26,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:26,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:27,841 INFO L124 PetriNetUnfolderBase]: 1787/2745 cut-off events. [2024-06-20 19:29:27,841 INFO L125 PetriNetUnfolderBase]: For 40497/40503 co-relation queries the response was YES. [2024-06-20 19:29:27,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14077 conditions, 2745 events. 1787/2745 cut-off events. For 40497/40503 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13626 event pairs, 429 based on Foata normal form. 5/2740 useless extension candidates. Maximal degree in co-relation 14034. Up to 2211 conditions per place. [2024-06-20 19:29:27,855 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 88 selfloop transitions, 76 changer transitions 0/168 dead transitions. [2024-06-20 19:29:27,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 168 transitions, 1504 flow [2024-06-20 19:29:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:29:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:29:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-06-20 19:29:27,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42272727272727273 [2024-06-20 19:29:27,857 INFO L175 Difference]: Start difference. First operand has 94 places, 123 transitions, 1004 flow. Second operand 11 states and 186 transitions. [2024-06-20 19:29:27,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 168 transitions, 1504 flow [2024-06-20 19:29:27,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 168 transitions, 1465 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-20 19:29:27,886 INFO L231 Difference]: Finished difference. Result has 101 places, 125 transitions, 1161 flow [2024-06-20 19:29:27,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1161, PETRI_PLACES=101, PETRI_TRANSITIONS=125} [2024-06-20 19:29:27,887 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2024-06-20 19:29:27,887 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 125 transitions, 1161 flow [2024-06-20 19:29:27,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:27,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:27,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:27,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:29:27,887 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:27,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1640679369, now seen corresponding path program 3 times [2024-06-20 19:29:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997731912] [2024-06-20 19:29:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:29:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997731912] [2024-06-20 19:29:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997731912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:37,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:29:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155491152] [2024-06-20 19:29:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:37,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:29:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:29:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:29:37,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:37,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 125 transitions, 1161 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:37,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:37,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:37,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:38,671 INFO L124 PetriNetUnfolderBase]: 1804/2772 cut-off events. [2024-06-20 19:29:38,671 INFO L125 PetriNetUnfolderBase]: For 45736/45742 co-relation queries the response was YES. [2024-06-20 19:29:38,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14977 conditions, 2772 events. 1804/2772 cut-off events. For 45736/45742 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13763 event pairs, 434 based on Foata normal form. 5/2767 useless extension candidates. Maximal degree in co-relation 14933. Up to 2238 conditions per place. [2024-06-20 19:29:38,687 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 82 selfloop transitions, 75 changer transitions 0/161 dead transitions. [2024-06-20 19:29:38,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 161 transitions, 1621 flow [2024-06-20 19:29:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:29:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:29:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-20 19:29:38,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-20 19:29:38,689 INFO L175 Difference]: Start difference. First operand has 101 places, 125 transitions, 1161 flow. Second operand 9 states and 155 transitions. [2024-06-20 19:29:38,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 161 transitions, 1621 flow [2024-06-20 19:29:38,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 161 transitions, 1445 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-20 19:29:38,730 INFO L231 Difference]: Finished difference. Result has 101 places, 127 transitions, 1183 flow [2024-06-20 19:29:38,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=101, PETRI_TRANSITIONS=127} [2024-06-20 19:29:38,731 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2024-06-20 19:29:38,731 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 127 transitions, 1183 flow [2024-06-20 19:29:38,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:38,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:38,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:38,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:29:38,731 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:38,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:38,732 INFO L85 PathProgramCache]: Analyzing trace with hash -600896547, now seen corresponding path program 4 times [2024-06-20 19:29:38,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:38,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712291935] [2024-06-20 19:29:38,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:38,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:48,329 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-20 19:29:48,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:48,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712291935] [2024-06-20 19:29:48,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712291935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:29:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808162203] [2024-06-20 19:29:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:48,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:29:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:29:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:29:48,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:48,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 127 transitions, 1183 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:48,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:48,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:48,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:49,617 INFO L124 PetriNetUnfolderBase]: 1796/2760 cut-off events. [2024-06-20 19:29:49,617 INFO L125 PetriNetUnfolderBase]: For 48851/48857 co-relation queries the response was YES. [2024-06-20 19:29:49,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15063 conditions, 2760 events. 1796/2760 cut-off events. For 48851/48857 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13712 event pairs, 390 based on Foata normal form. 5/2755 useless extension candidates. Maximal degree in co-relation 15018. Up to 1994 conditions per place. [2024-06-20 19:29:49,633 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 81 selfloop transitions, 82 changer transitions 0/167 dead transitions. [2024-06-20 19:29:49,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 167 transitions, 1673 flow [2024-06-20 19:29:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:29:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:29:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-20 19:29:49,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-20 19:29:49,635 INFO L175 Difference]: Start difference. First operand has 101 places, 127 transitions, 1183 flow. Second operand 9 states and 159 transitions. [2024-06-20 19:29:49,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 167 transitions, 1673 flow [2024-06-20 19:29:49,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 167 transitions, 1495 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-20 19:29:49,676 INFO L231 Difference]: Finished difference. Result has 103 places, 129 transitions, 1220 flow [2024-06-20 19:29:49,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1220, PETRI_PLACES=103, PETRI_TRANSITIONS=129} [2024-06-20 19:29:49,677 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2024-06-20 19:29:49,677 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 129 transitions, 1220 flow [2024-06-20 19:29:49,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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-20 19:29:49,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:49,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:49,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:29:49,678 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:49,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1393935581, now seen corresponding path program 2 times [2024-06-20 19:29:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:49,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110820555] [2024-06-20 19:29:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:29:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110820555] [2024-06-20 19:29:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110820555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:29:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427247372] [2024-06-20 19:29:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:57,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:29:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:29:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:29:58,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:58,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 129 transitions, 1220 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:58,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:58,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:58,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:58,827 INFO L124 PetriNetUnfolderBase]: 1793/2771 cut-off events. [2024-06-20 19:29:58,828 INFO L125 PetriNetUnfolderBase]: For 52291/52305 co-relation queries the response was YES. [2024-06-20 19:29:58,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15309 conditions, 2771 events. 1793/2771 cut-off events. For 52291/52305 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13801 event pairs, 527 based on Foata normal form. 13/2780 useless extension candidates. Maximal degree in co-relation 15263. Up to 2655 conditions per place. [2024-06-20 19:29:58,843 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 124 selfloop transitions, 18 changer transitions 0/146 dead transitions. [2024-06-20 19:29:58,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 146 transitions, 1590 flow [2024-06-20 19:29:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:29:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:29:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-20 19:29:58,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-20 19:29:58,845 INFO L175 Difference]: Start difference. First operand has 103 places, 129 transitions, 1220 flow. Second operand 6 states and 95 transitions. [2024-06-20 19:29:58,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 146 transitions, 1590 flow [2024-06-20 19:29:58,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 146 transitions, 1393 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 19:29:58,878 INFO L231 Difference]: Finished difference. Result has 103 places, 135 transitions, 1132 flow [2024-06-20 19:29:58,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1132, PETRI_PLACES=103, PETRI_TRANSITIONS=135} [2024-06-20 19:29:58,878 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2024-06-20 19:29:58,879 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 135 transitions, 1132 flow [2024-06-20 19:29:58,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:58,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:58,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:58,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:29:58,880 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:58,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1388227613, now seen corresponding path program 1 times [2024-06-20 19:29:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020475150] [2024-06-20 19:29:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:07,739 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-20 19:30:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020475150] [2024-06-20 19:30:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020475150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:07,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:07,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:30:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907483724] [2024-06-20 19:30:07,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:07,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:30:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:30:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:30:07,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:30:07,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 135 transitions, 1132 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:07,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:07,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:30:07,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:08,657 INFO L124 PetriNetUnfolderBase]: 1689/2663 cut-off events. [2024-06-20 19:30:08,657 INFO L125 PetriNetUnfolderBase]: For 56436/56438 co-relation queries the response was YES. [2024-06-20 19:30:08,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14749 conditions, 2663 events. 1689/2663 cut-off events. For 56436/56438 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13581 event pairs, 513 based on Foata normal form. 2/2663 useless extension candidates. Maximal degree in co-relation 14701. Up to 2482 conditions per place. [2024-06-20 19:30:08,673 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 131 selfloop transitions, 11 changer transitions 0/150 dead transitions. [2024-06-20 19:30:08,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 150 transitions, 1476 flow [2024-06-20 19:30:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:30:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:30:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-20 19:30:08,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2024-06-20 19:30:08,675 INFO L175 Difference]: Start difference. First operand has 103 places, 135 transitions, 1132 flow. Second operand 6 states and 101 transitions. [2024-06-20 19:30:08,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 150 transitions, 1476 flow [2024-06-20 19:30:08,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 150 transitions, 1436 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-20 19:30:08,717 INFO L231 Difference]: Finished difference. Result has 107 places, 138 transitions, 1150 flow [2024-06-20 19:30:08,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1150, PETRI_PLACES=107, PETRI_TRANSITIONS=138} [2024-06-20 19:30:08,718 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2024-06-20 19:30:08,718 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 138 transitions, 1150 flow [2024-06-20 19:30:08,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:08,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:08,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:08,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:30:08,719 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:30:08,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:08,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1393941533, now seen corresponding path program 2 times [2024-06-20 19:30:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354935766] [2024-06-20 19:30:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:08,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:17,055 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-20 19:30:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354935766] [2024-06-20 19:30:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354935766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:17,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:30:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068361408] [2024-06-20 19:30:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:17,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:30:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:30:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:30:17,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:30:17,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 138 transitions, 1150 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:17,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:17,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:30:17,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:17,953 INFO L124 PetriNetUnfolderBase]: 1683/2656 cut-off events. [2024-06-20 19:30:17,953 INFO L125 PetriNetUnfolderBase]: For 59385/59390 co-relation queries the response was YES. [2024-06-20 19:30:17,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15059 conditions, 2656 events. 1683/2656 cut-off events. For 59385/59390 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13582 event pairs, 517 based on Foata normal form. 4/2657 useless extension candidates. Maximal degree in co-relation 15009. Up to 2466 conditions per place. [2024-06-20 19:30:17,968 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 124 selfloop transitions, 18 changer transitions 0/150 dead transitions. [2024-06-20 19:30:17,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 150 transitions, 1490 flow [2024-06-20 19:30:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:30:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:30:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-20 19:30:17,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 19:30:17,969 INFO L175 Difference]: Start difference. First operand has 107 places, 138 transitions, 1150 flow. Second operand 6 states and 100 transitions. [2024-06-20 19:30:17,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 150 transitions, 1490 flow [2024-06-20 19:30:18,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 150 transitions, 1454 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-20 19:30:18,016 INFO L231 Difference]: Finished difference. Result has 109 places, 141 transitions, 1193 flow [2024-06-20 19:30:18,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1193, PETRI_PLACES=109, PETRI_TRANSITIONS=141} [2024-06-20 19:30:18,016 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2024-06-20 19:30:18,016 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 141 transitions, 1193 flow [2024-06-20 19:30:18,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:18,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:18,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:18,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:30:18,017 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:30:18,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1393949469, now seen corresponding path program 1 times [2024-06-20 19:30:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:18,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873417490] [2024-06-20 19:30:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:26,779 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-20 19:30:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873417490] [2024-06-20 19:30:26,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873417490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:26,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:26,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:30:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812461953] [2024-06-20 19:30:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:26,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:30:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:26,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:30:26,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:30:26,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:30:26,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 141 transitions, 1193 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:26,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:26,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:30:26,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:27,684 INFO L124 PetriNetUnfolderBase]: 1794/2765 cut-off events. [2024-06-20 19:30:27,685 INFO L125 PetriNetUnfolderBase]: For 62210/62212 co-relation queries the response was YES. [2024-06-20 19:30:27,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15861 conditions, 2765 events. 1794/2765 cut-off events. For 62210/62212 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13777 event pairs, 558 based on Foata normal form. 1/2764 useless extension candidates. Maximal degree in co-relation 15810. Up to 2679 conditions per place. [2024-06-20 19:30:27,699 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 136 selfloop transitions, 14 changer transitions 0/154 dead transitions. [2024-06-20 19:30:27,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 154 transitions, 1555 flow [2024-06-20 19:30:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:30:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:30:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-20 19:30:27,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:30:27,700 INFO L175 Difference]: Start difference. First operand has 109 places, 141 transitions, 1193 flow. Second operand 7 states and 105 transitions. [2024-06-20 19:30:27,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 154 transitions, 1555 flow [2024-06-20 19:30:27,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 154 transitions, 1500 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 19:30:27,750 INFO L231 Difference]: Finished difference. Result has 112 places, 144 transitions, 1212 flow [2024-06-20 19:30:27,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1212, PETRI_PLACES=112, PETRI_TRANSITIONS=144} [2024-06-20 19:30:27,751 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2024-06-20 19:30:27,751 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 144 transitions, 1212 flow [2024-06-20 19:30:27,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:27,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:27,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:27,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:30:27,752 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:30:27,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1923989091, now seen corresponding path program 1 times [2024-06-20 19:30:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523211604] [2024-06-20 19:30:27,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:38,577 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-20 19:30:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523211604] [2024-06-20 19:30:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523211604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:38,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:30:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661955976] [2024-06-20 19:30:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:38,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:30:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:30:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:30:38,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:30:38,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 144 transitions, 1212 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:30:38,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:38,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:30:38,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:39,930 INFO L124 PetriNetUnfolderBase]: 1913/2963 cut-off events. [2024-06-20 19:30:39,931 INFO L125 PetriNetUnfolderBase]: For 76332/76337 co-relation queries the response was YES. [2024-06-20 19:30:39,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17373 conditions, 2963 events. 1913/2963 cut-off events. For 76332/76337 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15049 event pairs, 303 based on Foata normal form. 18/2978 useless extension candidates. Maximal degree in co-relation 17321. Up to 1749 conditions per place. [2024-06-20 19:30:39,947 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 117 selfloop transitions, 73 changer transitions 0/194 dead transitions. [2024-06-20 19:30:39,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 1886 flow [2024-06-20 19:30:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:30:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:30:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-20 19:30:39,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475 [2024-06-20 19:30:39,950 INFO L175 Difference]: Start difference. First operand has 112 places, 144 transitions, 1212 flow. Second operand 10 states and 179 transitions. [2024-06-20 19:30:39,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 1886 flow [2024-06-20 19:30:40,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 194 transitions, 1812 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 19:30:40,012 INFO L231 Difference]: Finished difference. Result has 116 places, 146 transitions, 1344 flow [2024-06-20 19:30:40,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1344, PETRI_PLACES=116, PETRI_TRANSITIONS=146} [2024-06-20 19:30:40,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-06-20 19:30:40,013 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 146 transitions, 1344 flow [2024-06-20 19:30:40,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:30:40,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:40,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:40,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:30:40,014 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:30:40,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1835423331, now seen corresponding path program 2 times [2024-06-20 19:30:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425626810] [2024-06-20 19:30:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:50,632 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-20 19:30:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425626810] [2024-06-20 19:30:50,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425626810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:50,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:50,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:30:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168108657] [2024-06-20 19:30:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:50,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:30:50,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:30:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:30:50,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:30:50,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 146 transitions, 1344 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:30:50,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:50,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:30:50,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:52,026 INFO L124 PetriNetUnfolderBase]: 1971/3066 cut-off events. [2024-06-20 19:30:52,026 INFO L125 PetriNetUnfolderBase]: For 83158/83163 co-relation queries the response was YES. [2024-06-20 19:30:52,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18435 conditions, 3066 events. 1971/3066 cut-off events. For 83158/83163 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15796 event pairs, 463 based on Foata normal form. 18/3081 useless extension candidates. Maximal degree in co-relation 18383. Up to 2256 conditions per place. [2024-06-20 19:30:52,045 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 119 selfloop transitions, 76 changer transitions 0/199 dead transitions. [2024-06-20 19:30:52,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 199 transitions, 1928 flow [2024-06-20 19:30:52,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:30:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:30:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-06-20 19:30:52,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409090909090909 [2024-06-20 19:30:52,047 INFO L175 Difference]: Start difference. First operand has 116 places, 146 transitions, 1344 flow. Second operand 11 states and 194 transitions. [2024-06-20 19:30:52,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 199 transitions, 1928 flow [2024-06-20 19:30:52,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 199 transitions, 1833 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:30:52,106 INFO L231 Difference]: Finished difference. Result has 121 places, 147 transitions, 1437 flow [2024-06-20 19:30:52,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1437, PETRI_PLACES=121, PETRI_TRANSITIONS=147} [2024-06-20 19:30:52,107 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2024-06-20 19:30:52,107 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 147 transitions, 1437 flow [2024-06-20 19:30:52,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:30:52,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:52,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:52,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:30:52,108 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:30:52,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash -18494401, now seen corresponding path program 1 times [2024-06-20 19:30:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:52,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608513749] [2024-06-20 19:30:52,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:00,791 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-20 19:31:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608513749] [2024-06-20 19:31:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608513749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:00,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:00,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275213525] [2024-06-20 19:31:00,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:00,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:00,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:00,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:00,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:00,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:31:00,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 147 transitions, 1437 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:00,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:00,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:31:00,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:01,875 INFO L124 PetriNetUnfolderBase]: 1981/3091 cut-off events. [2024-06-20 19:31:01,875 INFO L125 PetriNetUnfolderBase]: For 84607/84616 co-relation queries the response was YES. [2024-06-20 19:31:01,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18987 conditions, 3091 events. 1981/3091 cut-off events. For 84607/84616 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16054 event pairs, 566 based on Foata normal form. 10/3098 useless extension candidates. Maximal degree in co-relation 18933. Up to 2856 conditions per place. [2024-06-20 19:31:01,894 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 135 selfloop transitions, 35 changer transitions 0/174 dead transitions. [2024-06-20 19:31:01,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 174 transitions, 1897 flow [2024-06-20 19:31:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-20 19:31:01,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-20 19:31:01,896 INFO L175 Difference]: Start difference. First operand has 121 places, 147 transitions, 1437 flow. Second operand 7 states and 122 transitions. [2024-06-20 19:31:01,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 174 transitions, 1897 flow [2024-06-20 19:31:01,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 174 transitions, 1727 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:31:01,966 INFO L231 Difference]: Finished difference. Result has 119 places, 151 transitions, 1395 flow [2024-06-20 19:31:01,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1395, PETRI_PLACES=119, PETRI_TRANSITIONS=151} [2024-06-20 19:31:01,967 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2024-06-20 19:31:01,967 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 151 transitions, 1395 flow [2024-06-20 19:31:01,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:01,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:01,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:01,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:31:01,967 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:31:01,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:01,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1738602939, now seen corresponding path program 3 times [2024-06-20 19:31:01,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:01,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069112651] [2024-06-20 19:31:01,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:12,725 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-20 19:31:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069112651] [2024-06-20 19:31:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069112651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:12,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:31:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633634834] [2024-06-20 19:31:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:12,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:31:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:31:12,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:31:12,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:31:12,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 151 transitions, 1395 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:31:12,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:12,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:31:12,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:14,292 INFO L124 PetriNetUnfolderBase]: 2100/3306 cut-off events. [2024-06-20 19:31:14,292 INFO L125 PetriNetUnfolderBase]: For 99312/99321 co-relation queries the response was YES. [2024-06-20 19:31:14,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20368 conditions, 3306 events. 2100/3306 cut-off events. For 99312/99321 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17590 event pairs, 379 based on Foata normal form. 24/3327 useless extension candidates. Maximal degree in co-relation 20313. Up to 2373 conditions per place. [2024-06-20 19:31:14,312 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 128 selfloop transitions, 78 changer transitions 0/210 dead transitions. [2024-06-20 19:31:14,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 210 transitions, 2157 flow [2024-06-20 19:31:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:31:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:31:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-06-20 19:31:14,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-20 19:31:14,315 INFO L175 Difference]: Start difference. First operand has 119 places, 151 transitions, 1395 flow. Second operand 11 states and 198 transitions. [2024-06-20 19:31:14,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 210 transitions, 2157 flow [2024-06-20 19:31:14,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 210 transitions, 2059 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-20 19:31:14,384 INFO L231 Difference]: Finished difference. Result has 125 places, 153 transitions, 1521 flow [2024-06-20 19:31:14,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1521, PETRI_PLACES=125, PETRI_TRANSITIONS=153} [2024-06-20 19:31:14,385 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places. [2024-06-20 19:31:14,385 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 153 transitions, 1521 flow [2024-06-20 19:31:14,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:31:14,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:14,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:14,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:31:14,385 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:31:14,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash -763803945, now seen corresponding path program 4 times [2024-06-20 19:31:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934971334] [2024-06-20 19:31:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:25,104 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-20 19:31:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934971334] [2024-06-20 19:31:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934971334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:31:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908327385] [2024-06-20 19:31:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:25,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:31:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:25,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:31:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:31:25,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:31:25,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 153 transitions, 1521 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:31:25,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:25,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:31:25,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:26,596 INFO L124 PetriNetUnfolderBase]: 2175/3431 cut-off events. [2024-06-20 19:31:26,597 INFO L125 PetriNetUnfolderBase]: For 110017/110026 co-relation queries the response was YES. [2024-06-20 19:31:26,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21542 conditions, 3431 events. 2175/3431 cut-off events. For 110017/110026 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18566 event pairs, 524 based on Foata normal form. 28/3456 useless extension candidates. Maximal degree in co-relation 21486. Up to 2749 conditions per place. [2024-06-20 19:31:26,619 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 129 selfloop transitions, 74 changer transitions 0/207 dead transitions. [2024-06-20 19:31:26,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 207 transitions, 2135 flow [2024-06-20 19:31:26,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:31:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:31:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-20 19:31:26,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-06-20 19:31:26,622 INFO L175 Difference]: Start difference. First operand has 125 places, 153 transitions, 1521 flow. Second operand 11 states and 193 transitions. [2024-06-20 19:31:26,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 207 transitions, 2135 flow [2024-06-20 19:31:26,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 207 transitions, 2021 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:31:26,700 INFO L231 Difference]: Finished difference. Result has 129 places, 154 transitions, 1598 flow [2024-06-20 19:31:26,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1598, PETRI_PLACES=129, PETRI_TRANSITIONS=154} [2024-06-20 19:31:26,701 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 88 predicate places. [2024-06-20 19:31:26,701 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 154 transitions, 1598 flow [2024-06-20 19:31:26,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:31:26,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:26,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:26,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:31:26,701 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:31:26,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash -758441565, now seen corresponding path program 5 times [2024-06-20 19:31:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:26,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671686988] [2024-06-20 19:31:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:37,326 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-20 19:31:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671686988] [2024-06-20 19:31:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671686988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:37,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:31:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820030601] [2024-06-20 19:31:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:37,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:31:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:31:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:31:37,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:31:37,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 154 transitions, 1598 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:31:37,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:37,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:31:37,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:38,875 INFO L124 PetriNetUnfolderBase]: 2250/3546 cut-off events. [2024-06-20 19:31:38,875 INFO L125 PetriNetUnfolderBase]: For 117714/117719 co-relation queries the response was YES. [2024-06-20 19:31:38,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22560 conditions, 3546 events. 2250/3546 cut-off events. For 117714/117719 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19359 event pairs, 550 based on Foata normal form. 22/3565 useless extension candidates. Maximal degree in co-relation 22502. Up to 2874 conditions per place. [2024-06-20 19:31:38,894 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 128 selfloop transitions, 67 changer transitions 0/199 dead transitions. [2024-06-20 19:31:38,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 199 transitions, 2164 flow [2024-06-20 19:31:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:31:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:31:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-20 19:31:38,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:31:38,897 INFO L175 Difference]: Start difference. First operand has 129 places, 154 transitions, 1598 flow. Second operand 10 states and 175 transitions. [2024-06-20 19:31:38,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 199 transitions, 2164 flow [2024-06-20 19:31:38,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 199 transitions, 2001 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:31:38,988 INFO L231 Difference]: Finished difference. Result has 130 places, 155 transitions, 1614 flow [2024-06-20 19:31:38,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1614, PETRI_PLACES=130, PETRI_TRANSITIONS=155} [2024-06-20 19:31:38,989 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2024-06-20 19:31:38,989 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 155 transitions, 1614 flow [2024-06-20 19:31:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:31:38,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:38,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:38,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:31:38,989 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:31:38,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash -758226363, now seen corresponding path program 1 times [2024-06-20 19:31:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071679117] [2024-06-20 19:31:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:48,553 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-20 19:31:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071679117] [2024-06-20 19:31:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071679117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:48,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:31:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473573111] [2024-06-20 19:31:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:48,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:31:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:48,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:31:48,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:31:48,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:31:48,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 155 transitions, 1614 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:48,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:48,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:31:48,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:50,024 INFO L124 PetriNetUnfolderBase]: 2291/3627 cut-off events. [2024-06-20 19:31:50,024 INFO L125 PetriNetUnfolderBase]: For 120712/120717 co-relation queries the response was YES. [2024-06-20 19:31:50,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22948 conditions, 3627 events. 2291/3627 cut-off events. For 120712/120717 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20054 event pairs, 556 based on Foata normal form. 14/3638 useless extension candidates. Maximal degree in co-relation 22889. Up to 2540 conditions per place. [2024-06-20 19:31:50,050 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 127 selfloop transitions, 70 changer transitions 0/201 dead transitions. [2024-06-20 19:31:50,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 201 transitions, 2186 flow [2024-06-20 19:31:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:31:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:31:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-20 19:31:50,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-20 19:31:50,053 INFO L175 Difference]: Start difference. First operand has 130 places, 155 transitions, 1614 flow. Second operand 10 states and 176 transitions. [2024-06-20 19:31:50,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 201 transitions, 2186 flow [2024-06-20 19:31:50,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 201 transitions, 2035 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:31:50,152 INFO L231 Difference]: Finished difference. Result has 132 places, 156 transitions, 1644 flow [2024-06-20 19:31:50,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1644, PETRI_PLACES=132, PETRI_TRANSITIONS=156} [2024-06-20 19:31:50,153 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 91 predicate places. [2024-06-20 19:31:50,153 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 1644 flow [2024-06-20 19:31:50,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:50,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:50,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:50,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:31:50,154 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:31:50,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:50,154 INFO L85 PathProgramCache]: Analyzing trace with hash -18195499, now seen corresponding path program 1 times [2024-06-20 19:31:50,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448629493] [2024-06-20 19:31:50,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:58,153 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-20 19:31:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448629493] [2024-06-20 19:31:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448629493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:58,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:58,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4598000] [2024-06-20 19:31:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:58,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:58,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:31:58,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 1644 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:58,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:58,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:31:58,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:59,341 INFO L124 PetriNetUnfolderBase]: 2296/3642 cut-off events. [2024-06-20 19:31:59,341 INFO L125 PetriNetUnfolderBase]: For 120247/120253 co-relation queries the response was YES. [2024-06-20 19:31:59,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23079 conditions, 3642 events. 2296/3642 cut-off events. For 120247/120253 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20223 event pairs, 692 based on Foata normal form. 7/3647 useless extension candidates. Maximal degree in co-relation 23019. Up to 3502 conditions per place. [2024-06-20 19:31:59,364 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 156 selfloop transitions, 16 changer transitions 0/176 dead transitions. [2024-06-20 19:31:59,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 176 transitions, 2092 flow [2024-06-20 19:31:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-20 19:31:59,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2024-06-20 19:31:59,367 INFO L175 Difference]: Start difference. First operand has 132 places, 156 transitions, 1644 flow. Second operand 7 states and 111 transitions. [2024-06-20 19:31:59,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 176 transitions, 2092 flow [2024-06-20 19:31:59,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 176 transitions, 1931 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:31:59,482 INFO L231 Difference]: Finished difference. Result has 131 places, 159 transitions, 1575 flow [2024-06-20 19:31:59,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1575, PETRI_PLACES=131, PETRI_TRANSITIONS=159} [2024-06-20 19:31:59,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 90 predicate places. [2024-06-20 19:31:59,483 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 159 transitions, 1575 flow [2024-06-20 19:31:59,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:59,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:59,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:59,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:31:59,484 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:31:59,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash -91931975, now seen corresponding path program 2 times [2024-06-20 19:31:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:59,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458583945] [2024-06-20 19:31:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458583945] [2024-06-20 19:32:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458583945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:32:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34261801] [2024-06-20 19:32:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:07,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:32:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:32:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:32:07,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:32:07,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 159 transitions, 1575 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:07,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:07,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:32:07,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:08,784 INFO L124 PetriNetUnfolderBase]: 2324/3680 cut-off events. [2024-06-20 19:32:08,784 INFO L125 PetriNetUnfolderBase]: For 123799/123804 co-relation queries the response was YES. [2024-06-20 19:32:08,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23259 conditions, 3680 events. 2324/3680 cut-off events. For 123799/123804 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20417 event pairs, 678 based on Foata normal form. 4/3681 useless extension candidates. Maximal degree in co-relation 23198. Up to 3386 conditions per place. [2024-06-20 19:32:08,810 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 142 selfloop transitions, 38 changer transitions 0/184 dead transitions. [2024-06-20 19:32:08,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 184 transitions, 2161 flow [2024-06-20 19:32:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:32:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:32:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-20 19:32:08,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-20 19:32:08,812 INFO L175 Difference]: Start difference. First operand has 131 places, 159 transitions, 1575 flow. Second operand 7 states and 118 transitions. [2024-06-20 19:32:08,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 184 transitions, 2161 flow [2024-06-20 19:32:08,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 184 transitions, 2091 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-20 19:32:08,971 INFO L231 Difference]: Finished difference. Result has 134 places, 167 transitions, 1722 flow [2024-06-20 19:32:08,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1722, PETRI_PLACES=134, PETRI_TRANSITIONS=167} [2024-06-20 19:32:08,972 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2024-06-20 19:32:08,972 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 167 transitions, 1722 flow [2024-06-20 19:32:08,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:08,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:08,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:08,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:32:08,973 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:32:08,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash 70353319, now seen corresponding path program 6 times [2024-06-20 19:32:08,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:08,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334748114] [2024-06-20 19:32:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:19,571 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-20 19:32:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334748114] [2024-06-20 19:32:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334748114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:19,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:19,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363979514] [2024-06-20 19:32:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:19,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:19,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:19,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:32:19,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 167 transitions, 1722 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:32:19,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:19,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:32:19,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:20,977 INFO L124 PetriNetUnfolderBase]: 2288/3629 cut-off events. [2024-06-20 19:32:20,978 INFO L125 PetriNetUnfolderBase]: For 131134/131143 co-relation queries the response was YES. [2024-06-20 19:32:20,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23104 conditions, 3629 events. 2288/3629 cut-off events. For 131134/131143 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20035 event pairs, 573 based on Foata normal form. 23/3640 useless extension candidates. Maximal degree in co-relation 23041. Up to 2941 conditions per place. [2024-06-20 19:32:21,006 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 132 selfloop transitions, 63 changer transitions 0/199 dead transitions. [2024-06-20 19:32:21,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 199 transitions, 2220 flow [2024-06-20 19:32:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-20 19:32:21,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2024-06-20 19:32:21,009 INFO L175 Difference]: Start difference. First operand has 134 places, 167 transitions, 1722 flow. Second operand 8 states and 141 transitions. [2024-06-20 19:32:21,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 199 transitions, 2220 flow [2024-06-20 19:32:21,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 199 transitions, 2122 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-20 19:32:21,152 INFO L231 Difference]: Finished difference. Result has 139 places, 167 transitions, 1759 flow [2024-06-20 19:32:21,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1759, PETRI_PLACES=139, PETRI_TRANSITIONS=167} [2024-06-20 19:32:21,153 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-20 19:32:21,153 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 167 transitions, 1759 flow [2024-06-20 19:32:21,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-20 19:32:21,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:21,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:21,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:32:21,154 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:32:21,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1111357481, now seen corresponding path program 2 times [2024-06-20 19:32:21,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:21,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954800993] [2024-06-20 19:32:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:30,999 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-20 19:32:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954800993] [2024-06-20 19:32:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954800993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:30,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:31,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:32:31,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055843751] [2024-06-20 19:32:31,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:31,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:32:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:32:31,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:32:31,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:32:31,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 167 transitions, 1759 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:31,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:31,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:32:31,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:32,455 INFO L124 PetriNetUnfolderBase]: 2268/3593 cut-off events. [2024-06-20 19:32:32,455 INFO L125 PetriNetUnfolderBase]: For 125365/125374 co-relation queries the response was YES. [2024-06-20 19:32:32,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22853 conditions, 3593 events. 2268/3593 cut-off events. For 125365/125374 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19776 event pairs, 550 based on Foata normal form. 15/3596 useless extension candidates. Maximal degree in co-relation 22788. Up to 2819 conditions per place. [2024-06-20 19:32:32,479 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 132 selfloop transitions, 65 changer transitions 0/201 dead transitions. [2024-06-20 19:32:32,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 201 transitions, 2271 flow [2024-06-20 19:32:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-20 19:32:32,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446875 [2024-06-20 19:32:32,482 INFO L175 Difference]: Start difference. First operand has 139 places, 167 transitions, 1759 flow. Second operand 8 states and 143 transitions. [2024-06-20 19:32:32,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 201 transitions, 2271 flow [2024-06-20 19:32:32,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 201 transitions, 2114 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:32:32,607 INFO L231 Difference]: Finished difference. Result has 140 places, 167 transitions, 1738 flow [2024-06-20 19:32:32,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1738, PETRI_PLACES=140, PETRI_TRANSITIONS=167} [2024-06-20 19:32:32,607 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 99 predicate places. [2024-06-20 19:32:32,607 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 167 transitions, 1738 flow [2024-06-20 19:32:32,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:32,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:32,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:32,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:32:32,608 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:32:32,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash 336265801, now seen corresponding path program 3 times [2024-06-20 19:32:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:32,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130280069] [2024-06-20 19:32:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:43,319 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-20 19:32:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130280069] [2024-06-20 19:32:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130280069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743253689] [2024-06-20 19:32:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:43,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:43,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:43,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:43,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:32:43,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 167 transitions, 1738 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:43,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:43,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:32:43,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:44,664 INFO L124 PetriNetUnfolderBase]: 2248/3561 cut-off events. [2024-06-20 19:32:44,664 INFO L125 PetriNetUnfolderBase]: For 123312/123321 co-relation queries the response was YES. [2024-06-20 19:32:44,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22262 conditions, 3561 events. 2248/3561 cut-off events. For 123312/123321 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19566 event pairs, 502 based on Foata normal form. 15/3564 useless extension candidates. Maximal degree in co-relation 22196. Up to 2137 conditions per place. [2024-06-20 19:32:44,689 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 123 selfloop transitions, 73 changer transitions 0/200 dead transitions. [2024-06-20 19:32:44,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 200 transitions, 2186 flow [2024-06-20 19:32:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-20 19:32:44,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2024-06-20 19:32:44,692 INFO L175 Difference]: Start difference. First operand has 140 places, 167 transitions, 1738 flow. Second operand 8 states and 141 transitions. [2024-06-20 19:32:44,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 200 transitions, 2186 flow [2024-06-20 19:32:44,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 200 transitions, 1954 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:32:44,832 INFO L231 Difference]: Finished difference. Result has 139 places, 166 transitions, 1596 flow [2024-06-20 19:32:44,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1596, PETRI_PLACES=139, PETRI_TRANSITIONS=166} [2024-06-20 19:32:44,833 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-20 19:32:44,833 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 166 transitions, 1596 flow [2024-06-20 19:32:44,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:44,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:44,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:44,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:32:44,834 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:32:44,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 262343527, now seen corresponding path program 2 times [2024-06-20 19:32:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85305736] [2024-06-20 19:32:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:53,437 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-20 19:32:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85305736] [2024-06-20 19:32:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85305736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:32:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631074323] [2024-06-20 19:32:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:53,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:32:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:53,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:32:53,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:32:53,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:32:53,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 166 transitions, 1596 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:53,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:53,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:32:53,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:54,574 INFO L124 PetriNetUnfolderBase]: 2253/3572 cut-off events. [2024-06-20 19:32:54,574 INFO L125 PetriNetUnfolderBase]: For 121948/121950 co-relation queries the response was YES. [2024-06-20 19:32:54,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22023 conditions, 3572 events. 2253/3572 cut-off events. For 121948/121950 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19664 event pairs, 672 based on Foata normal form. 1/3571 useless extension candidates. Maximal degree in co-relation 21957. Up to 3447 conditions per place. [2024-06-20 19:32:54,597 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 161 selfloop transitions, 14 changer transitions 0/179 dead transitions. [2024-06-20 19:32:54,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 179 transitions, 2032 flow [2024-06-20 19:32:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:32:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:32:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-20 19:32:54,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-20 19:32:54,599 INFO L175 Difference]: Start difference. First operand has 139 places, 166 transitions, 1596 flow. Second operand 7 states and 104 transitions. [2024-06-20 19:32:54,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 179 transitions, 2032 flow [2024-06-20 19:32:54,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 179 transitions, 1825 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:32:54,706 INFO L231 Difference]: Finished difference. Result has 139 places, 169 transitions, 1487 flow [2024-06-20 19:32:54,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1487, PETRI_PLACES=139, PETRI_TRANSITIONS=169} [2024-06-20 19:32:54,706 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 98 predicate places. [2024-06-20 19:32:54,706 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 169 transitions, 1487 flow [2024-06-20 19:32:54,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:54,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:54,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:54,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:32:54,707 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:32:54,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1578750881, now seen corresponding path program 3 times [2024-06-20 19:32:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872165892] [2024-06-20 19:32:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:03,307 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-20 19:33:03,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:03,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872165892] [2024-06-20 19:33:03,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872165892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:03,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:03,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:33:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257608958] [2024-06-20 19:33:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:03,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:33:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:33:03,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:33:03,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:33:03,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 169 transitions, 1487 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:03,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:03,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:33:03,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:04,406 INFO L124 PetriNetUnfolderBase]: 2250/3576 cut-off events. [2024-06-20 19:33:04,407 INFO L125 PetriNetUnfolderBase]: For 124655/124669 co-relation queries the response was YES. [2024-06-20 19:33:04,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21467 conditions, 3576 events. 2250/3576 cut-off events. For 124655/124669 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19758 event pairs, 638 based on Foata normal form. 13/3585 useless extension candidates. Maximal degree in co-relation 21401. Up to 3409 conditions per place. [2024-06-20 19:33:04,431 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 152 selfloop transitions, 28 changer transitions 0/184 dead transitions. [2024-06-20 19:33:04,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 184 transitions, 1951 flow [2024-06-20 19:33:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:33:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:33:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-20 19:33:04,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-06-20 19:33:04,432 INFO L175 Difference]: Start difference. First operand has 139 places, 169 transitions, 1487 flow. Second operand 7 states and 108 transitions. [2024-06-20 19:33:04,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 184 transitions, 1951 flow [2024-06-20 19:33:04,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 184 transitions, 1875 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-20 19:33:04,552 INFO L231 Difference]: Finished difference. Result has 141 places, 172 transitions, 1543 flow [2024-06-20 19:33:04,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1543, PETRI_PLACES=141, PETRI_TRANSITIONS=172} [2024-06-20 19:33:04,553 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2024-06-20 19:33:04,553 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 172 transitions, 1543 flow [2024-06-20 19:33:04,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:04,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:04,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:04,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:33:04,553 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:33:04,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1460769809, now seen corresponding path program 3 times [2024-06-20 19:33:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682000060] [2024-06-20 19:33:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:13,345 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-20 19:33:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682000060] [2024-06-20 19:33:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682000060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:13,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:13,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:33:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330703759] [2024-06-20 19:33:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:13,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:33:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:33:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:33:13,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:33:13,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 172 transitions, 1543 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:13,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:13,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:33:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:14,443 INFO L124 PetriNetUnfolderBase]: 2254/3571 cut-off events. [2024-06-20 19:33:14,443 INFO L125 PetriNetUnfolderBase]: For 130210/130219 co-relation queries the response was YES. [2024-06-20 19:33:14,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21818 conditions, 3571 events. 2254/3571 cut-off events. For 130210/130219 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19600 event pairs, 649 based on Foata normal form. 5/3564 useless extension candidates. Maximal degree in co-relation 21751. Up to 3244 conditions per place. [2024-06-20 19:33:14,466 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 144 selfloop transitions, 50 changer transitions 0/198 dead transitions. [2024-06-20 19:33:14,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 198 transitions, 2287 flow [2024-06-20 19:33:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:33:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:33:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-20 19:33:14,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-20 19:33:14,467 INFO L175 Difference]: Start difference. First operand has 141 places, 172 transitions, 1543 flow. Second operand 7 states and 115 transitions. [2024-06-20 19:33:14,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 198 transitions, 2287 flow [2024-06-20 19:33:14,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 198 transitions, 2177 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-20 19:33:14,595 INFO L231 Difference]: Finished difference. Result has 145 places, 185 transitions, 1751 flow [2024-06-20 19:33:14,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1751, PETRI_PLACES=145, PETRI_TRANSITIONS=185} [2024-06-20 19:33:14,595 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places. [2024-06-20 19:33:14,595 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 185 transitions, 1751 flow [2024-06-20 19:33:14,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:14,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:14,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:14,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:33:14,596 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:33:14,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 816948625, now seen corresponding path program 1 times [2024-06-20 19:33:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426033797] [2024-06-20 19:33:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:33:24,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:24,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426033797] [2024-06-20 19:33:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426033797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:24,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:24,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809847668] [2024-06-20 19:33:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:24,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:24,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:33:24,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 185 transitions, 1751 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:24,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:24,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:33:24,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:25,500 INFO L124 PetriNetUnfolderBase]: 2182/3499 cut-off events. [2024-06-20 19:33:25,500 INFO L125 PetriNetUnfolderBase]: For 142264/142268 co-relation queries the response was YES. [2024-06-20 19:33:25,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22313 conditions, 3499 events. 2182/3499 cut-off events. For 142264/142268 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19446 event pairs, 616 based on Foata normal form. 3/3500 useless extension candidates. Maximal degree in co-relation 22243. Up to 3249 conditions per place. [2024-06-20 19:33:25,524 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 180 selfloop transitions, 19 changer transitions 0/213 dead transitions. [2024-06-20 19:33:25,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 213 transitions, 2274 flow [2024-06-20 19:33:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:33:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:33:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-20 19:33:25,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-20 19:33:25,525 INFO L175 Difference]: Start difference. First operand has 145 places, 185 transitions, 1751 flow. Second operand 9 states and 143 transitions. [2024-06-20 19:33:25,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 213 transitions, 2274 flow [2024-06-20 19:33:25,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 213 transitions, 2168 flow, removed 41 selfloop flow, removed 2 redundant places. [2024-06-20 19:33:25,684 INFO L231 Difference]: Finished difference. Result has 154 places, 193 transitions, 1773 flow [2024-06-20 19:33:25,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1773, PETRI_PLACES=154, PETRI_TRANSITIONS=193} [2024-06-20 19:33:25,685 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places. [2024-06-20 19:33:25,685 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 193 transitions, 1773 flow [2024-06-20 19:33:25,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:25,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:25,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:25,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:33:25,685 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:33:25,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash 85384243, now seen corresponding path program 2 times [2024-06-20 19:33:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166276467] [2024-06-20 19:33:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:34,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-20 19:33:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166276467] [2024-06-20 19:33:34,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166276467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:34,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:34,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144167259] [2024-06-20 19:33:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:34,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:34,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:33:34,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 193 transitions, 1773 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:34,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:34,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:33:34,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:35,839 INFO L124 PetriNetUnfolderBase]: 2249/3601 cut-off events. [2024-06-20 19:33:35,840 INFO L125 PetriNetUnfolderBase]: For 154003/154007 co-relation queries the response was YES. [2024-06-20 19:33:35,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23346 conditions, 3601 events. 2249/3601 cut-off events. For 154003/154007 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20101 event pairs, 595 based on Foata normal form. 5/3602 useless extension candidates. Maximal degree in co-relation 23272. Up to 3294 conditions per place. [2024-06-20 19:33:35,867 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 179 selfloop transitions, 28 changer transitions 0/221 dead transitions. [2024-06-20 19:33:35,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 221 transitions, 2441 flow [2024-06-20 19:33:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-20 19:33:35,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:33:35,868 INFO L175 Difference]: Start difference. First operand has 154 places, 193 transitions, 1773 flow. Second operand 8 states and 136 transitions. [2024-06-20 19:33:35,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 221 transitions, 2441 flow [2024-06-20 19:33:36,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 221 transitions, 2377 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-20 19:33:36,019 INFO L231 Difference]: Finished difference. Result has 158 places, 201 transitions, 1894 flow [2024-06-20 19:33:36,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1894, PETRI_PLACES=158, PETRI_TRANSITIONS=201} [2024-06-20 19:33:36,020 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 117 predicate places. [2024-06-20 19:33:36,020 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 201 transitions, 1894 flow [2024-06-20 19:33:36,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:36,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:36,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:33:36,021 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:33:36,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash 262515763, now seen corresponding path program 3 times [2024-06-20 19:33:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:36,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972567469] [2024-06-20 19:33:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:44,734 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-20 19:33:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:44,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972567469] [2024-06-20 19:33:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972567469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:44,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363198124] [2024-06-20 19:33:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:44,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:33:44,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 201 transitions, 1894 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:44,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:44,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:33:44,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:45,944 INFO L124 PetriNetUnfolderBase]: 2259/3615 cut-off events. [2024-06-20 19:33:45,944 INFO L125 PetriNetUnfolderBase]: For 157860/157865 co-relation queries the response was YES. [2024-06-20 19:33:45,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23937 conditions, 3615 events. 2259/3615 cut-off events. For 157860/157865 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20161 event pairs, 616 based on Foata normal form. 8/3618 useless extension candidates. Maximal degree in co-relation 23861. Up to 3258 conditions per place. [2024-06-20 19:33:45,973 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 172 selfloop transitions, 42 changer transitions 0/228 dead transitions. [2024-06-20 19:33:45,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 228 transitions, 2680 flow [2024-06-20 19:33:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-20 19:33:45,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-20 19:33:45,975 INFO L175 Difference]: Start difference. First operand has 158 places, 201 transitions, 1894 flow. Second operand 8 states and 139 transitions. [2024-06-20 19:33:45,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 228 transitions, 2680 flow [2024-06-20 19:33:46,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 228 transitions, 2602 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-20 19:33:46,137 INFO L231 Difference]: Finished difference. Result has 162 places, 209 transitions, 2043 flow [2024-06-20 19:33:46,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2043, PETRI_PLACES=162, PETRI_TRANSITIONS=209} [2024-06-20 19:33:46,138 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places. [2024-06-20 19:33:46,138 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 209 transitions, 2043 flow [2024-06-20 19:33:46,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:46,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:46,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:46,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:33:46,139 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:33:46,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1460338847, now seen corresponding path program 1 times [2024-06-20 19:33:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:46,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864750700] [2024-06-20 19:33:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:46,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:33:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864750700] [2024-06-20 19:33:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864750700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:56,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:56,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:56,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920618878] [2024-06-20 19:33:56,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:56,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:56,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:56,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:56,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:56,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:33:56,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 209 transitions, 2043 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:33:56,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:56,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:33:56,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:57,696 INFO L124 PetriNetUnfolderBase]: 2345/3700 cut-off events. [2024-06-20 19:33:57,696 INFO L125 PetriNetUnfolderBase]: For 158064/158066 co-relation queries the response was YES. [2024-06-20 19:33:57,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24721 conditions, 3700 events. 2345/3700 cut-off events. For 158064/158066 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20244 event pairs, 653 based on Foata normal form. 2/3700 useless extension candidates. Maximal degree in co-relation 24643. Up to 3571 conditions per place. [2024-06-20 19:33:57,723 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 201 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2024-06-20 19:33:57,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 222 transitions, 2559 flow [2024-06-20 19:33:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-20 19:33:57,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-20 19:33:57,724 INFO L175 Difference]: Start difference. First operand has 162 places, 209 transitions, 2043 flow. Second operand 8 states and 116 transitions. [2024-06-20 19:33:57,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 222 transitions, 2559 flow [2024-06-20 19:33:57,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 222 transitions, 2437 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-20 19:33:57,915 INFO L231 Difference]: Finished difference. Result has 165 places, 211 transitions, 2016 flow [2024-06-20 19:33:57,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2016, PETRI_PLACES=165, PETRI_TRANSITIONS=211} [2024-06-20 19:33:57,915 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2024-06-20 19:33:57,915 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 211 transitions, 2016 flow [2024-06-20 19:33:57,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:33:57,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:57,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:57,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:33:57,916 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:33:57,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash -828885271, now seen corresponding path program 1 times [2024-06-20 19:33:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670158971] [2024-06-20 19:33:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:06,116 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-20 19:34:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670158971] [2024-06-20 19:34:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670158971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:34:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448855414] [2024-06-20 19:34:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:06,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:34:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:06,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:34:06,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:34:06,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:34:06,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 211 transitions, 2016 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:06,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:06,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:34:06,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:07,438 INFO L124 PetriNetUnfolderBase]: 2355/3718 cut-off events. [2024-06-20 19:34:07,438 INFO L125 PetriNetUnfolderBase]: For 162658/162667 co-relation queries the response was YES. [2024-06-20 19:34:07,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24529 conditions, 3718 events. 2355/3718 cut-off events. For 162658/162667 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20450 event pairs, 579 based on Foata normal form. 10/3725 useless extension candidates. Maximal degree in co-relation 24450. Up to 3449 conditions per place. [2024-06-20 19:34:07,464 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 194 selfloop transitions, 40 changer transitions 0/238 dead transitions. [2024-06-20 19:34:07,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 238 transitions, 2642 flow [2024-06-20 19:34:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-20 19:34:07,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-20 19:34:07,465 INFO L175 Difference]: Start difference. First operand has 165 places, 211 transitions, 2016 flow. Second operand 8 states and 134 transitions. [2024-06-20 19:34:07,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 238 transitions, 2642 flow [2024-06-20 19:34:07,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 238 transitions, 2565 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-20 19:34:07,619 INFO L231 Difference]: Finished difference. Result has 167 places, 215 transitions, 2116 flow [2024-06-20 19:34:07,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2116, PETRI_PLACES=167, PETRI_TRANSITIONS=215} [2024-06-20 19:34:07,620 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2024-06-20 19:34:07,620 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 215 transitions, 2116 flow [2024-06-20 19:34:07,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:07,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:07,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:07,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:34:07,620 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:34:07,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash -658069474, now seen corresponding path program 1 times [2024-06-20 19:34:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:07,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386445404] [2024-06-20 19:34:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:34:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386445404] [2024-06-20 19:34:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386445404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:16,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:34:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754120914] [2024-06-20 19:34:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:16,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:34:16,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:16,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:34:16,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:34:16,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:34:16,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 215 transitions, 2116 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:16,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:16,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:34:16,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:17,639 INFO L124 PetriNetUnfolderBase]: 2365/3725 cut-off events. [2024-06-20 19:34:17,640 INFO L125 PetriNetUnfolderBase]: For 169639/169644 co-relation queries the response was YES. [2024-06-20 19:34:17,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25210 conditions, 3725 events. 2365/3725 cut-off events. For 169639/169644 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20395 event pairs, 586 based on Foata normal form. 4/3726 useless extension candidates. Maximal degree in co-relation 25130. Up to 3465 conditions per place. [2024-06-20 19:34:17,743 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 198 selfloop transitions, 36 changer transitions 0/238 dead transitions. [2024-06-20 19:34:17,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 238 transitions, 2710 flow [2024-06-20 19:34:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:34:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:34:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-20 19:34:17,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-20 19:34:17,745 INFO L175 Difference]: Start difference. First operand has 167 places, 215 transitions, 2116 flow. Second operand 7 states and 118 transitions. [2024-06-20 19:34:17,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 238 transitions, 2710 flow [2024-06-20 19:34:17,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 238 transitions, 2561 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-20 19:34:17,954 INFO L231 Difference]: Finished difference. Result has 168 places, 219 transitions, 2120 flow [2024-06-20 19:34:17,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2120, PETRI_PLACES=168, PETRI_TRANSITIONS=219} [2024-06-20 19:34:17,955 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2024-06-20 19:34:17,955 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 219 transitions, 2120 flow [2024-06-20 19:34:17,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:17,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:17,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-20 19:34:17,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:34:17,956 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:34:17,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1445081084, now seen corresponding path program 2 times [2024-06-20 19:34:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491099702] [2024-06-20 19:34:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:26,388 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-20 19:34:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491099702] [2024-06-20 19:34:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491099702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:26,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:34:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724322118] [2024-06-20 19:34:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:26,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:34:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:26,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:34:26,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:34:26,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:34:26,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 219 transitions, 2120 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:26,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:26,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:34:26,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:27,670 INFO L124 PetriNetUnfolderBase]: 2367/3729 cut-off events. [2024-06-20 19:34:27,670 INFO L125 PetriNetUnfolderBase]: For 175428/175433 co-relation queries the response was YES. [2024-06-20 19:34:27,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25258 conditions, 3729 events. 2367/3729 cut-off events. For 175428/175433 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 20426 event pairs, 587 based on Foata normal form. 4/3730 useless extension candidates. Maximal degree in co-relation 25177. Up to 3428 conditions per place. [2024-06-20 19:34:27,694 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 189 selfloop transitions, 45 changer transitions 0/238 dead transitions. [2024-06-20 19:34:27,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 238 transitions, 2792 flow [2024-06-20 19:34:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:34:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:34:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-20 19:34:27,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-20 19:34:27,697 INFO L175 Difference]: Start difference. First operand has 168 places, 219 transitions, 2120 flow. Second operand 7 states and 117 transitions. [2024-06-20 19:34:27,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 238 transitions, 2792 flow [2024-06-20 19:34:27,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 238 transitions, 2693 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-20 19:34:27,918 INFO L231 Difference]: Finished difference. Result has 170 places, 222 transitions, 2182 flow [2024-06-20 19:34:27,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2021, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2182, PETRI_PLACES=170, PETRI_TRANSITIONS=222} [2024-06-20 19:34:27,919 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 129 predicate places. [2024-06-20 19:34:27,919 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 222 transitions, 2182 flow [2024-06-20 19:34:27,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:27,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:27,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:27,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:34:27,920 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:34:27,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash -289033017, now seen corresponding path program 2 times [2024-06-20 19:34:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579659092] [2024-06-20 19:34:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:34:37,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:37,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579659092] [2024-06-20 19:34:37,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579659092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:37,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:37,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:34:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290898279] [2024-06-20 19:34:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:37,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:34:37,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:37,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:34:37,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:34:37,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:34:37,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 222 transitions, 2182 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:37,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:37,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:34:37,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:38,310 INFO L124 PetriNetUnfolderBase]: 2411/3796 cut-off events. [2024-06-20 19:34:38,310 INFO L125 PetriNetUnfolderBase]: For 188310/188315 co-relation queries the response was YES. [2024-06-20 19:34:38,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26200 conditions, 3796 events. 2411/3796 cut-off events. For 188310/188315 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20905 event pairs, 587 based on Foata normal form. 4/3797 useless extension candidates. Maximal degree in co-relation 26118. Up to 3440 conditions per place. [2024-06-20 19:34:38,344 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 190 selfloop transitions, 58 changer transitions 0/252 dead transitions. [2024-06-20 19:34:38,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 252 transitions, 3192 flow [2024-06-20 19:34:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-20 19:34:38,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 19:34:38,345 INFO L175 Difference]: Start difference. First operand has 170 places, 222 transitions, 2182 flow. Second operand 8 states and 133 transitions. [2024-06-20 19:34:38,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 252 transitions, 3192 flow [2024-06-20 19:34:38,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 252 transitions, 3092 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-20 19:34:38,585 INFO L231 Difference]: Finished difference. Result has 175 places, 234 transitions, 2513 flow [2024-06-20 19:34:38,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2513, PETRI_PLACES=175, PETRI_TRANSITIONS=234} [2024-06-20 19:34:38,586 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 134 predicate places. [2024-06-20 19:34:38,586 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 234 transitions, 2513 flow [2024-06-20 19:34:38,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:38,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:38,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:38,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:34:38,586 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:34:38,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1445089020, now seen corresponding path program 1 times [2024-06-20 19:34:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681942177] [2024-06-20 19:34:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:48,349 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-20 19:34:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681942177] [2024-06-20 19:34:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681942177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:48,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:34:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267193492] [2024-06-20 19:34:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:48,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:34:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:34:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:34:48,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:34:48,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 234 transitions, 2513 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:48,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:48,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:34:48,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:49,613 INFO L124 PetriNetUnfolderBase]: 2416/3808 cut-off events. [2024-06-20 19:34:49,613 INFO L125 PetriNetUnfolderBase]: For 197626/197630 co-relation queries the response was YES. [2024-06-20 19:34:49,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26963 conditions, 3808 events. 2416/3808 cut-off events. For 197626/197630 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20940 event pairs, 602 based on Foata normal form. 5/3811 useless extension candidates. Maximal degree in co-relation 26879. Up to 3654 conditions per place. [2024-06-20 19:34:49,643 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 230 selfloop transitions, 20 changer transitions 0/254 dead transitions. [2024-06-20 19:34:49,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 254 transitions, 3141 flow [2024-06-20 19:34:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-20 19:34:49,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-20 19:34:49,645 INFO L175 Difference]: Start difference. First operand has 175 places, 234 transitions, 2513 flow. Second operand 8 states and 122 transitions. [2024-06-20 19:34:49,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 254 transitions, 3141 flow [2024-06-20 19:34:49,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 254 transitions, 2997 flow, removed 57 selfloop flow, removed 3 redundant places. [2024-06-20 19:34:49,883 INFO L231 Difference]: Finished difference. Result has 180 places, 237 transitions, 2495 flow [2024-06-20 19:34:49,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2371, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2495, PETRI_PLACES=180, PETRI_TRANSITIONS=237} [2024-06-20 19:34:49,883 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 139 predicate places. [2024-06-20 19:34:49,883 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 237 transitions, 2495 flow [2024-06-20 19:34:49,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:49,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:49,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:49,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:34:49,884 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:34:49,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1445088617, now seen corresponding path program 3 times [2024-06-20 19:34:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145535889] [2024-06-20 19:34:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:58,237 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-20 19:34:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145535889] [2024-06-20 19:34:58,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145535889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:58,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:58,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:34:58,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168863602] [2024-06-20 19:34:58,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:58,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:34:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:58,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:34:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:34:58,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:34:58,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 237 transitions, 2495 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:58,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:58,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:34:58,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:59,541 INFO L124 PetriNetUnfolderBase]: 2412/3799 cut-off events. [2024-06-20 19:34:59,541 INFO L125 PetriNetUnfolderBase]: For 201119/201124 co-relation queries the response was YES. [2024-06-20 19:34:59,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26947 conditions, 3799 events. 2412/3799 cut-off events. For 201119/201124 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20945 event pairs, 586 based on Foata normal form. 4/3800 useless extension candidates. Maximal degree in co-relation 26861. Up to 3445 conditions per place. [2024-06-20 19:34:59,575 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 194 selfloop transitions, 57 changer transitions 0/255 dead transitions. [2024-06-20 19:34:59,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 255 transitions, 3253 flow [2024-06-20 19:34:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-20 19:34:59,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 19:34:59,576 INFO L175 Difference]: Start difference. First operand has 180 places, 237 transitions, 2495 flow. Second operand 8 states and 132 transitions. [2024-06-20 19:34:59,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 255 transitions, 3253 flow [2024-06-20 19:34:59,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 255 transitions, 3087 flow, removed 65 selfloop flow, removed 6 redundant places. [2024-06-20 19:34:59,871 INFO L231 Difference]: Finished difference. Result has 182 places, 237 transitions, 2451 flow [2024-06-20 19:34:59,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2329, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2451, PETRI_PLACES=182, PETRI_TRANSITIONS=237} [2024-06-20 19:34:59,872 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2024-06-20 19:34:59,872 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 237 transitions, 2451 flow [2024-06-20 19:34:59,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:34:59,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:59,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:59,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:34:59,872 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:34:59,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:59,873 INFO L85 PathProgramCache]: Analyzing trace with hash -452111876, now seen corresponding path program 3 times [2024-06-20 19:34:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:59,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141942759] [2024-06-20 19:34:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:08,929 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-20 19:35:08,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:08,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141942759] [2024-06-20 19:35:08,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141942759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:08,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:08,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:35:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840083603] [2024-06-20 19:35:08,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:08,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:35:08,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:08,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:35:08,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:35:09,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:35:09,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 237 transitions, 2451 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:09,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:09,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:35:09,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:10,238 INFO L124 PetriNetUnfolderBase]: 2405/3785 cut-off events. [2024-06-20 19:35:10,238 INFO L125 PetriNetUnfolderBase]: For 205680/205682 co-relation queries the response was YES. [2024-06-20 19:35:10,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26980 conditions, 3785 events. 2405/3785 cut-off events. For 205680/205682 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20665 event pairs, 587 based on Foata normal form. 3/3779 useless extension candidates. Maximal degree in co-relation 26893. Up to 3530 conditions per place. [2024-06-20 19:35:10,266 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 214 selfloop transitions, 38 changer transitions 0/256 dead transitions. [2024-06-20 19:35:10,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 256 transitions, 3036 flow [2024-06-20 19:35:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:35:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:35:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-20 19:35:10,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 19:35:10,268 INFO L175 Difference]: Start difference. First operand has 182 places, 237 transitions, 2451 flow. Second operand 8 states and 126 transitions. [2024-06-20 19:35:10,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 256 transitions, 3036 flow [2024-06-20 19:35:10,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 256 transitions, 2871 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-20 19:35:10,507 INFO L231 Difference]: Finished difference. Result has 183 places, 238 transitions, 2385 flow [2024-06-20 19:35:10,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2385, PETRI_PLACES=183, PETRI_TRANSITIONS=238} [2024-06-20 19:35:10,508 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 142 predicate places. [2024-06-20 19:35:10,508 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 238 transitions, 2385 flow [2024-06-20 19:35:10,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:10,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:10,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:10,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:35:10,510 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:35:10,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash 947651888, now seen corresponding path program 4 times [2024-06-20 19:35:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786343427] [2024-06-20 19:35:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:19,020 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-20 19:35:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786343427] [2024-06-20 19:35:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786343427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:35:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144070860] [2024-06-20 19:35:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:19,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:35:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:19,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:35:19,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:35:19,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:35:19,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 238 transitions, 2385 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:19,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:19,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:35:19,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:20,216 INFO L124 PetriNetUnfolderBase]: 2410/3789 cut-off events. [2024-06-20 19:35:20,216 INFO L125 PetriNetUnfolderBase]: For 212562/212566 co-relation queries the response was YES. [2024-06-20 19:35:20,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27058 conditions, 3789 events. 2410/3789 cut-off events. For 212562/212566 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 20729 event pairs, 586 based on Foata normal form. 2/3781 useless extension candidates. Maximal degree in co-relation 26971. Up to 3517 conditions per place. [2024-06-20 19:35:20,249 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 207 selfloop transitions, 45 changer transitions 0/256 dead transitions. [2024-06-20 19:35:20,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 256 transitions, 3000 flow [2024-06-20 19:35:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:35:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:35:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-20 19:35:20,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2024-06-20 19:35:20,251 INFO L175 Difference]: Start difference. First operand has 183 places, 238 transitions, 2385 flow. Second operand 7 states and 114 transitions. [2024-06-20 19:35:20,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 256 transitions, 3000 flow [2024-06-20 19:35:20,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 256 transitions, 2882 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:20,589 INFO L231 Difference]: Finished difference. Result has 185 places, 242 transitions, 2452 flow [2024-06-20 19:35:20,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2452, PETRI_PLACES=185, PETRI_TRANSITIONS=242} [2024-06-20 19:35:20,589 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places. [2024-06-20 19:35:20,589 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 242 transitions, 2452 flow [2024-06-20 19:35:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:20,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:20,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:20,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:35:20,590 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:35:20,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -451952644, now seen corresponding path program 5 times [2024-06-20 19:35:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658738463] [2024-06-20 19:35:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:29,162 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-20 19:35:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:29,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658738463] [2024-06-20 19:35:29,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658738463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:29,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:29,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:35:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728179319] [2024-06-20 19:35:29,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:29,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:35:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:35:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:35:29,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:35:29,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 242 transitions, 2452 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:29,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:29,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:35:29,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:30,330 INFO L124 PetriNetUnfolderBase]: 2415/3803 cut-off events. [2024-06-20 19:35:30,330 INFO L125 PetriNetUnfolderBase]: For 220763/220770 co-relation queries the response was YES. [2024-06-20 19:35:30,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27292 conditions, 3803 events. 2415/3803 cut-off events. For 220763/220770 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20854 event pairs, 610 based on Foata normal form. 4/3794 useless extension candidates. Maximal degree in co-relation 27202. Up to 3460 conditions per place. [2024-06-20 19:35:30,361 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 187 selfloop transitions, 65 changer transitions 0/256 dead transitions. [2024-06-20 19:35:30,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 256 transitions, 3154 flow [2024-06-20 19:35:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:35:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:35:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-20 19:35:30,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-20 19:35:30,363 INFO L175 Difference]: Start difference. First operand has 185 places, 242 transitions, 2452 flow. Second operand 7 states and 113 transitions. [2024-06-20 19:35:30,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 256 transitions, 3154 flow [2024-06-20 19:35:30,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 256 transitions, 3042 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-20 19:35:30,715 INFO L231 Difference]: Finished difference. Result has 188 places, 245 transitions, 2534 flow [2024-06-20 19:35:30,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2340, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2534, PETRI_PLACES=188, PETRI_TRANSITIONS=245} [2024-06-20 19:35:30,715 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places. [2024-06-20 19:35:30,716 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 245 transitions, 2534 flow [2024-06-20 19:35:30,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:30,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:30,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:30,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:35:30,716 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:35:30,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -457666564, now seen corresponding path program 6 times [2024-06-20 19:35:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272633214] [2024-06-20 19:35:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:39,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272633214] [2024-06-20 19:35:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272633214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:39,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:39,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:35:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574222816] [2024-06-20 19:35:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:39,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:35:39,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:39,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:35:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:35:39,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:35:39,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 245 transitions, 2534 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:39,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:39,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:35:39,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:40,470 INFO L124 PetriNetUnfolderBase]: 2407/3793 cut-off events. [2024-06-20 19:35:40,470 INFO L125 PetriNetUnfolderBase]: For 226212/226219 co-relation queries the response was YES. [2024-06-20 19:35:40,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27270 conditions, 3793 events. 2407/3793 cut-off events. For 226212/226219 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20807 event pairs, 611 based on Foata normal form. 5/3785 useless extension candidates. Maximal degree in co-relation 27179. Up to 3452 conditions per place. [2024-06-20 19:35:40,501 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 190 selfloop transitions, 61 changer transitions 0/255 dead transitions. [2024-06-20 19:35:40,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 255 transitions, 3066 flow [2024-06-20 19:35:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:35:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:35:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-20 19:35:40,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2024-06-20 19:35:40,503 INFO L175 Difference]: Start difference. First operand has 188 places, 245 transitions, 2534 flow. Second operand 7 states and 113 transitions. [2024-06-20 19:35:40,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 255 transitions, 3066 flow [2024-06-20 19:35:40,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 255 transitions, 2834 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:40,872 INFO L231 Difference]: Finished difference. Result has 189 places, 245 transitions, 2432 flow [2024-06-20 19:35:40,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2432, PETRI_PLACES=189, PETRI_TRANSITIONS=245} [2024-06-20 19:35:40,872 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places. [2024-06-20 19:35:40,872 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 245 transitions, 2432 flow [2024-06-20 19:35:40,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:40,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:40,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:40,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:35:40,873 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:35:40,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1973675733, now seen corresponding path program 4 times [2024-06-20 19:35:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422435789] [2024-06-20 19:35:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:49,501 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-20 19:35:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422435789] [2024-06-20 19:35:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422435789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:49,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:35:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484741013] [2024-06-20 19:35:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:49,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:35:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:35:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:35:49,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:35:49,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 245 transitions, 2432 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:35:49,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:49,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:35:49,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:50,871 INFO L124 PetriNetUnfolderBase]: 2435/3838 cut-off events. [2024-06-20 19:35:50,871 INFO L125 PetriNetUnfolderBase]: For 236977/236984 co-relation queries the response was YES. [2024-06-20 19:35:50,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27792 conditions, 3838 events. 2435/3838 cut-off events. For 236977/236984 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21151 event pairs, 634 based on Foata normal form. 5/3840 useless extension candidates. Maximal degree in co-relation 27702. Up to 3661 conditions per place. [2024-06-20 19:35:50,897 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 226 selfloop transitions, 34 changer transitions 0/264 dead transitions. [2024-06-20 19:35:50,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 264 transitions, 3286 flow [2024-06-20 19:35:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:35:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:35:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-20 19:35:50,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-20 19:35:50,899 INFO L175 Difference]: Start difference. First operand has 189 places, 245 transitions, 2432 flow. Second operand 8 states and 123 transitions. [2024-06-20 19:35:50,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 264 transitions, 3286 flow [2024-06-20 19:35:51,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 264 transitions, 3154 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:51,184 INFO L231 Difference]: Finished difference. Result has 192 places, 253 transitions, 2590 flow [2024-06-20 19:35:51,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2590, PETRI_PLACES=192, PETRI_TRANSITIONS=253} [2024-06-20 19:35:51,184 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places. [2024-06-20 19:35:51,184 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 253 transitions, 2590 flow [2024-06-20 19:35:51,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:35:51,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:51,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:51,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:35:51,185 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:35:51,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1973676136, now seen corresponding path program 2 times [2024-06-20 19:35:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272510646] [2024-06-20 19:35:51,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:00,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272510646] [2024-06-20 19:36:00,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272510646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:00,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:00,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:00,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516820513] [2024-06-20 19:36:00,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:00,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:00,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:00,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:00,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:36:00,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 253 transitions, 2590 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:00,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:00,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:36:00,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:01,715 INFO L124 PetriNetUnfolderBase]: 2440/3844 cut-off events. [2024-06-20 19:36:01,716 INFO L125 PetriNetUnfolderBase]: For 247444/247448 co-relation queries the response was YES. [2024-06-20 19:36:01,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28358 conditions, 3844 events. 2440/3844 cut-off events. For 247444/247448 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21159 event pairs, 628 based on Foata normal form. 2/3844 useless extension candidates. Maximal degree in co-relation 28266. Up to 3707 conditions per place. [2024-06-20 19:36:01,746 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 244 selfloop transitions, 18 changer transitions 0/266 dead transitions. [2024-06-20 19:36:01,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 266 transitions, 3222 flow [2024-06-20 19:36:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-20 19:36:01,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-20 19:36:01,747 INFO L175 Difference]: Start difference. First operand has 192 places, 253 transitions, 2590 flow. Second operand 8 states and 116 transitions. [2024-06-20 19:36:01,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 266 transitions, 3222 flow [2024-06-20 19:36:02,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 266 transitions, 2984 flow, removed 66 selfloop flow, removed 5 redundant places. [2024-06-20 19:36:02,024 INFO L231 Difference]: Finished difference. Result has 195 places, 256 transitions, 2482 flow [2024-06-20 19:36:02,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2482, PETRI_PLACES=195, PETRI_TRANSITIONS=256} [2024-06-20 19:36:02,025 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 154 predicate places. [2024-06-20 19:36:02,025 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 256 transitions, 2482 flow [2024-06-20 19:36:02,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:02,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:02,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:02,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:36:02,026 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:36:02,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash -444326148, now seen corresponding path program 3 times [2024-06-20 19:36:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330635880] [2024-06-20 19:36:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:11,791 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-20 19:36:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330635880] [2024-06-20 19:36:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330635880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599534741] [2024-06-20 19:36:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:11,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:11,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:11,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:11,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:36:11,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 256 transitions, 2482 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:11,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:11,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:36:11,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:13,098 INFO L124 PetriNetUnfolderBase]: 2445/3851 cut-off events. [2024-06-20 19:36:13,098 INFO L125 PetriNetUnfolderBase]: For 255587/255591 co-relation queries the response was YES. [2024-06-20 19:36:13,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28393 conditions, 3851 events. 2445/3851 cut-off events. For 255587/255591 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21141 event pairs, 630 based on Foata normal form. 2/3851 useless extension candidates. Maximal degree in co-relation 28301. Up to 3708 conditions per place. [2024-06-20 19:36:13,129 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 242 selfloop transitions, 24 changer transitions 0/270 dead transitions. [2024-06-20 19:36:13,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 270 transitions, 3130 flow [2024-06-20 19:36:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-20 19:36:13,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-20 19:36:13,131 INFO L175 Difference]: Start difference. First operand has 195 places, 256 transitions, 2482 flow. Second operand 9 states and 129 transitions. [2024-06-20 19:36:13,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 270 transitions, 3130 flow [2024-06-20 19:36:13,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 270 transitions, 3022 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:13,469 INFO L231 Difference]: Finished difference. Result has 198 places, 259 transitions, 2522 flow [2024-06-20 19:36:13,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2522, PETRI_PLACES=198, PETRI_TRANSITIONS=259} [2024-06-20 19:36:13,470 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places. [2024-06-20 19:36:13,470 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 259 transitions, 2522 flow [2024-06-20 19:36:13,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:13,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:13,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:13,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:36:13,471 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:36:13,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash -457658628, now seen corresponding path program 4 times [2024-06-20 19:36:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008156306] [2024-06-20 19:36:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008156306] [2024-06-20 19:36:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008156306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:22,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781875929] [2024-06-20 19:36:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:22,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:22,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:36:22,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 259 transitions, 2522 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:22,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:22,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:36:22,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:24,028 INFO L124 PetriNetUnfolderBase]: 2442/3850 cut-off events. [2024-06-20 19:36:24,029 INFO L125 PetriNetUnfolderBase]: For 261387/261395 co-relation queries the response was YES. [2024-06-20 19:36:24,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28583 conditions, 3850 events. 2442/3850 cut-off events. For 261387/261395 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21169 event pairs, 608 based on Foata normal form. 7/3853 useless extension candidates. Maximal degree in co-relation 28490. Up to 3676 conditions per place. [2024-06-20 19:36:24,062 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 239 selfloop transitions, 31 changer transitions 0/274 dead transitions. [2024-06-20 19:36:24,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 274 transitions, 3196 flow [2024-06-20 19:36:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-20 19:36:24,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:36:24,063 INFO L175 Difference]: Start difference. First operand has 198 places, 259 transitions, 2522 flow. Second operand 8 states and 120 transitions. [2024-06-20 19:36:24,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 274 transitions, 3196 flow [2024-06-20 19:36:24,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 274 transitions, 3070 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:24,481 INFO L231 Difference]: Finished difference. Result has 199 places, 262 transitions, 2564 flow [2024-06-20 19:36:24,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2396, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2564, PETRI_PLACES=199, PETRI_TRANSITIONS=262} [2024-06-20 19:36:24,482 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 158 predicate places. [2024-06-20 19:36:24,482 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 262 transitions, 2564 flow [2024-06-20 19:36:24,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:24,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:24,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:24,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:36:24,483 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:36:24,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1960788723, now seen corresponding path program 5 times [2024-06-20 19:36:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121000997] [2024-06-20 19:36:24,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:24,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:33,214 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-20 19:36:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121000997] [2024-06-20 19:36:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121000997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:33,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:33,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095014611] [2024-06-20 19:36:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:33,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:36:33,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 262 transitions, 2564 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:33,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:33,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:36:33,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:34,517 INFO L124 PetriNetUnfolderBase]: 2454/3865 cut-off events. [2024-06-20 19:36:34,517 INFO L125 PetriNetUnfolderBase]: For 275042/275049 co-relation queries the response was YES. [2024-06-20 19:36:34,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29088 conditions, 3865 events. 2454/3865 cut-off events. For 275042/275049 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21381 event pairs, 610 based on Foata normal form. 5/3857 useless extension candidates. Maximal degree in co-relation 28994. Up to 3406 conditions per place. [2024-06-20 19:36:34,548 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 194 selfloop transitions, 87 changer transitions 0/285 dead transitions. [2024-06-20 19:36:34,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 285 transitions, 3792 flow [2024-06-20 19:36:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-20 19:36:34,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 19:36:34,549 INFO L175 Difference]: Start difference. First operand has 199 places, 262 transitions, 2564 flow. Second operand 8 states and 132 transitions. [2024-06-20 19:36:34,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 285 transitions, 3792 flow [2024-06-20 19:36:34,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 285 transitions, 3646 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:34,859 INFO L231 Difference]: Finished difference. Result has 202 places, 270 transitions, 2844 flow [2024-06-20 19:36:34,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2418, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2844, PETRI_PLACES=202, PETRI_TRANSITIONS=270} [2024-06-20 19:36:34,860 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places. [2024-06-20 19:36:34,860 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 270 transitions, 2844 flow [2024-06-20 19:36:34,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:34,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:34,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:34,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:36:34,861 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:36:34,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1696647201, now seen corresponding path program 6 times [2024-06-20 19:36:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832557772] [2024-06-20 19:36:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832557772] [2024-06-20 19:36:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832557772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:43,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239013287] [2024-06-20 19:36:43,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:43,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:43,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:43,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:43,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:36:43,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 270 transitions, 2844 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:43,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:43,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:36:43,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:44,767 INFO L124 PetriNetUnfolderBase]: 2456/3868 cut-off events. [2024-06-20 19:36:44,768 INFO L125 PetriNetUnfolderBase]: For 285348/285355 co-relation queries the response was YES. [2024-06-20 19:36:44,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29800 conditions, 3868 events. 2456/3868 cut-off events. For 285348/285355 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21437 event pairs, 608 based on Foata normal form. 5/3860 useless extension candidates. Maximal degree in co-relation 29704. Up to 3410 conditions per place. [2024-06-20 19:36:44,799 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 188 selfloop transitions, 95 changer transitions 0/287 dead transitions. [2024-06-20 19:36:44,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 287 transitions, 3815 flow [2024-06-20 19:36:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-20 19:36:44,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-20 19:36:44,800 INFO L175 Difference]: Start difference. First operand has 202 places, 270 transitions, 2844 flow. Second operand 8 states and 131 transitions. [2024-06-20 19:36:44,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 287 transitions, 3815 flow [2024-06-20 19:36:45,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 287 transitions, 3534 flow, removed 82 selfloop flow, removed 5 redundant places. [2024-06-20 19:36:45,159 INFO L231 Difference]: Finished difference. Result has 205 places, 274 transitions, 2887 flow [2024-06-20 19:36:45,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2585, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2887, PETRI_PLACES=205, PETRI_TRANSITIONS=274} [2024-06-20 19:36:45,160 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 164 predicate places. [2024-06-20 19:36:45,160 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 274 transitions, 2887 flow [2024-06-20 19:36:45,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:36:45,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:45,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:45,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:36:45,160 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:36:45,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash -444485380, now seen corresponding path program 1 times [2024-06-20 19:36:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746080967] [2024-06-20 19:36:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:54,725 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-20 19:36:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746080967] [2024-06-20 19:36:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746080967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:54,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:36:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595237474] [2024-06-20 19:36:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:54,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:36:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:36:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:36:54,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:36:54,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 274 transitions, 2887 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:54,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:54,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:36:54,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:56,097 INFO L124 PetriNetUnfolderBase]: 2345/3753 cut-off events. [2024-06-20 19:36:56,097 INFO L125 PetriNetUnfolderBase]: For 290475/290479 co-relation queries the response was YES. [2024-06-20 19:36:56,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29006 conditions, 3753 events. 2345/3753 cut-off events. For 290475/290479 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21183 event pairs, 590 based on Foata normal form. 3/3750 useless extension candidates. Maximal degree in co-relation 28909. Up to 3475 conditions per place. [2024-06-20 19:36:56,125 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 253 selfloop transitions, 21 changer transitions 0/293 dead transitions. [2024-06-20 19:36:56,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 293 transitions, 3539 flow [2024-06-20 19:36:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-20 19:36:56,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:36:56,128 INFO L175 Difference]: Start difference. First operand has 205 places, 274 transitions, 2887 flow. Second operand 8 states and 128 transitions. [2024-06-20 19:36:56,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 293 transitions, 3539 flow [2024-06-20 19:36:56,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 293 transitions, 3292 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-20 19:36:56,523 INFO L231 Difference]: Finished difference. Result has 208 places, 277 transitions, 2754 flow [2024-06-20 19:36:56,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2640, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2754, PETRI_PLACES=208, PETRI_TRANSITIONS=277} [2024-06-20 19:36:56,524 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 167 predicate places. [2024-06-20 19:36:56,524 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 277 transitions, 2754 flow [2024-06-20 19:36:56,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:56,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:56,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:56,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:36:56,525 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:36:56,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:56,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1648048580, now seen corresponding path program 1 times [2024-06-20 19:36:56,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:56,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097435117] [2024-06-20 19:36:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:05,640 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-20 19:37:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097435117] [2024-06-20 19:37:05,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097435117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:05,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:05,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524365507] [2024-06-20 19:37:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:05,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:05,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:37:05,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 277 transitions, 2754 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:05,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:05,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:37:05,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:06,918 INFO L124 PetriNetUnfolderBase]: 2443/3851 cut-off events. [2024-06-20 19:37:06,918 INFO L125 PetriNetUnfolderBase]: For 290389/290393 co-relation queries the response was YES. [2024-06-20 19:37:06,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29258 conditions, 3851 events. 2443/3851 cut-off events. For 290389/290393 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21281 event pairs, 650 based on Foata normal form. 2/3851 useless extension candidates. Maximal degree in co-relation 29160. Up to 3706 conditions per place. [2024-06-20 19:37:06,952 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 270 selfloop transitions, 18 changer transitions 0/292 dead transitions. [2024-06-20 19:37:06,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 292 transitions, 3396 flow [2024-06-20 19:37:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-20 19:37:06,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-20 19:37:06,954 INFO L175 Difference]: Start difference. First operand has 208 places, 277 transitions, 2754 flow. Second operand 8 states and 119 transitions. [2024-06-20 19:37:06,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 292 transitions, 3396 flow [2024-06-20 19:37:07,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 292 transitions, 3324 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:07,356 INFO L231 Difference]: Finished difference. Result has 210 places, 279 transitions, 2758 flow [2024-06-20 19:37:07,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2682, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2758, PETRI_PLACES=210, PETRI_TRANSITIONS=279} [2024-06-20 19:37:07,356 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 169 predicate places. [2024-06-20 19:37:07,356 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 279 transitions, 2758 flow [2024-06-20 19:37:07,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:07,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:07,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:07,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:37:07,357 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:37:07,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash -451938756, now seen corresponding path program 2 times [2024-06-20 19:37:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:07,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323715450] [2024-06-20 19:37:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:07,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:16,685 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-20 19:37:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323715450] [2024-06-20 19:37:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323715450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:16,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327284901] [2024-06-20 19:37:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:16,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:16,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:16,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:16,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:37:16,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 279 transitions, 2758 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:16,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:16,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:37:16,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:18,054 INFO L124 PetriNetUnfolderBase]: 2453/3867 cut-off events. [2024-06-20 19:37:18,054 INFO L125 PetriNetUnfolderBase]: For 299025/299032 co-relation queries the response was YES. [2024-06-20 19:37:18,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29429 conditions, 3867 events. 2453/3867 cut-off events. For 299025/299032 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21385 event pairs, 631 based on Foata normal form. 4/3868 useless extension candidates. Maximal degree in co-relation 29330. Up to 3705 conditions per place. [2024-06-20 19:37:18,084 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 261 selfloop transitions, 30 changer transitions 0/295 dead transitions. [2024-06-20 19:37:18,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 295 transitions, 3437 flow [2024-06-20 19:37:18,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-20 19:37:18,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:37:18,085 INFO L175 Difference]: Start difference. First operand has 210 places, 279 transitions, 2758 flow. Second operand 8 states and 120 transitions. [2024-06-20 19:37:18,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 295 transitions, 3437 flow [2024-06-20 19:37:18,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 295 transitions, 3361 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:18,535 INFO L231 Difference]: Finished difference. Result has 212 places, 285 transitions, 2825 flow [2024-06-20 19:37:18,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2682, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2825, PETRI_PLACES=212, PETRI_TRANSITIONS=285} [2024-06-20 19:37:18,536 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 171 predicate places. [2024-06-20 19:37:18,536 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 285 transitions, 2825 flow [2024-06-20 19:37:18,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:18,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:18,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:18,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:37:18,537 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:37:18,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1974127558, now seen corresponding path program 3 times [2024-06-20 19:37:18,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:18,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239583326] [2024-06-20 19:37:18,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:18,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:28,414 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-20 19:37:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:28,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239583326] [2024-06-20 19:37:28,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239583326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617152176] [2024-06-20 19:37:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:28,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:28,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:37:28,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 285 transitions, 2825 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:28,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:28,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:37:28,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:29,838 INFO L124 PetriNetUnfolderBase]: 2458/3874 cut-off events. [2024-06-20 19:37:29,839 INFO L125 PetriNetUnfolderBase]: For 307752/307759 co-relation queries the response was YES. [2024-06-20 19:37:29,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29632 conditions, 3874 events. 2458/3874 cut-off events. For 307752/307759 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21434 event pairs, 631 based on Foata normal form. 4/3875 useless extension candidates. Maximal degree in co-relation 29532. Up to 3699 conditions per place. [2024-06-20 19:37:29,870 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 255 selfloop transitions, 42 changer transitions 0/301 dead transitions. [2024-06-20 19:37:29,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 301 transitions, 3659 flow [2024-06-20 19:37:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-20 19:37:29,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-20 19:37:29,872 INFO L175 Difference]: Start difference. First operand has 212 places, 285 transitions, 2825 flow. Second operand 8 states and 121 transitions. [2024-06-20 19:37:29,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 301 transitions, 3659 flow [2024-06-20 19:37:30,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 301 transitions, 3577 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-20 19:37:30,293 INFO L231 Difference]: Finished difference. Result has 215 places, 290 transitions, 2919 flow [2024-06-20 19:37:30,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2743, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2919, PETRI_PLACES=215, PETRI_TRANSITIONS=290} [2024-06-20 19:37:30,294 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 174 predicate places. [2024-06-20 19:37:30,294 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 290 transitions, 2919 flow [2024-06-20 19:37:30,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:30,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:30,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:30,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:37:30,294 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:37:30,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash -444587106, now seen corresponding path program 4 times [2024-06-20 19:37:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702431047] [2024-06-20 19:37:30,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:40,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702431047] [2024-06-20 19:37:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702431047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769210435] [2024-06-20 19:37:40,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:40,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:40,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:40,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:37:40,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 290 transitions, 2919 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:40,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:40,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:37:40,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:41,337 INFO L124 PetriNetUnfolderBase]: 2451/3864 cut-off events. [2024-06-20 19:37:41,337 INFO L125 PetriNetUnfolderBase]: For 314228/314235 co-relation queries the response was YES. [2024-06-20 19:37:41,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29669 conditions, 3864 events. 2451/3864 cut-off events. For 314228/314235 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21388 event pairs, 631 based on Foata normal form. 4/3865 useless extension candidates. Maximal degree in co-relation 29568. Up to 3702 conditions per place. [2024-06-20 19:37:41,368 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 265 selfloop transitions, 31 changer transitions 0/300 dead transitions. [2024-06-20 19:37:41,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 300 transitions, 3537 flow [2024-06-20 19:37:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-20 19:37:41,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-20 19:37:41,369 INFO L175 Difference]: Start difference. First operand has 215 places, 290 transitions, 2919 flow. Second operand 8 states and 119 transitions. [2024-06-20 19:37:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 300 transitions, 3537 flow [2024-06-20 19:37:41,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 300 transitions, 3446 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-20 19:37:41,841 INFO L231 Difference]: Finished difference. Result has 219 places, 290 transitions, 2896 flow [2024-06-20 19:37:41,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2828, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2896, PETRI_PLACES=219, PETRI_TRANSITIONS=290} [2024-06-20 19:37:41,842 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2024-06-20 19:37:41,842 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 290 transitions, 2896 flow [2024-06-20 19:37:41,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:41,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:41,842 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-20 19:37:41,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:37:41,842 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:37:41,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1552260502, now seen corresponding path program 1 times [2024-06-20 19:37:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749011726] [2024-06-20 19:37:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:50,499 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-20 19:37:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749011726] [2024-06-20 19:37:50,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749011726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:50,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:50,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:50,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454464575] [2024-06-20 19:37:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:50,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:50,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:37:50,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 290 transitions, 2896 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:50,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:50,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:37:50,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:51,990 INFO L124 PetriNetUnfolderBase]: 2467/3890 cut-off events. [2024-06-20 19:37:51,990 INFO L125 PetriNetUnfolderBase]: For 326720/326727 co-relation queries the response was YES. [2024-06-20 19:37:52,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30032 conditions, 3890 events. 2467/3890 cut-off events. For 326720/326727 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21464 event pairs, 437 based on Foata normal form. 10/3897 useless extension candidates. Maximal degree in co-relation 29929. Up to 3549 conditions per place. [2024-06-20 19:37:52,023 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 278 selfloop transitions, 39 changer transitions 0/321 dead transitions. [2024-06-20 19:37:52,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 321 transitions, 3706 flow [2024-06-20 19:37:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-20 19:37:52,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-20 19:37:52,024 INFO L175 Difference]: Start difference. First operand has 219 places, 290 transitions, 2896 flow. Second operand 8 states and 137 transitions. [2024-06-20 19:37:52,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 321 transitions, 3706 flow [2024-06-20 19:37:52,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 321 transitions, 3612 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:37:52,528 INFO L231 Difference]: Finished difference. Result has 220 places, 293 transitions, 2976 flow [2024-06-20 19:37:52,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2802, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2976, PETRI_PLACES=220, PETRI_TRANSITIONS=293} [2024-06-20 19:37:52,529 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places. [2024-06-20 19:37:52,529 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 293 transitions, 2976 flow [2024-06-20 19:37:52,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:37:52,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:52,529 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-20 19:37:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:37:52,529 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:37:52,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2031787222, now seen corresponding path program 2 times [2024-06-20 19:37:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762114515] [2024-06-20 19:37:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762114515] [2024-06-20 19:38:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762114515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:01,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:38:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31334555] [2024-06-20 19:38:01,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:01,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:38:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:38:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:38:01,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:38:01,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 293 transitions, 2976 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:38:01,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:01,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:38:01,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:02,990 INFO L124 PetriNetUnfolderBase]: 2483/3914 cut-off events. [2024-06-20 19:38:02,990 INFO L125 PetriNetUnfolderBase]: For 337523/337530 co-relation queries the response was YES. [2024-06-20 19:38:03,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30729 conditions, 3914 events. 2483/3914 cut-off events. For 337523/337530 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21631 event pairs, 573 based on Foata normal form. 10/3921 useless extension candidates. Maximal degree in co-relation 30625. Up to 3626 conditions per place. [2024-06-20 19:38:03,020 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 276 selfloop transitions, 40 changer transitions 0/320 dead transitions. [2024-06-20 19:38:03,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 320 transitions, 3778 flow [2024-06-20 19:38:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:38:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:38:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-20 19:38:03,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-20 19:38:03,021 INFO L175 Difference]: Start difference. First operand has 220 places, 293 transitions, 2976 flow. Second operand 8 states and 134 transitions. [2024-06-20 19:38:03,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 320 transitions, 3778 flow [2024-06-20 19:38:03,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 320 transitions, 3626 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:03,471 INFO L231 Difference]: Finished difference. Result has 222 places, 296 transitions, 3006 flow [2024-06-20 19:38:03,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2824, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3006, PETRI_PLACES=222, PETRI_TRANSITIONS=296} [2024-06-20 19:38:03,472 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 181 predicate places. [2024-06-20 19:38:03,472 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 296 transitions, 3006 flow [2024-06-20 19:38:03,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:38:03,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:03,472 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-20 19:38:03,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:38:03,473 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:38:03,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -593205794, now seen corresponding path program 1 times [2024-06-20 19:38:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:03,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988302090] [2024-06-20 19:38:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:12,954 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-20 19:38:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988302090] [2024-06-20 19:38:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988302090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654848827] [2024-06-20 19:38:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:13,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:38:13,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 296 transitions, 3006 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 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-20 19:38:13,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:13,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:38:13,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:14,425 INFO L124 PetriNetUnfolderBase]: 2493/3928 cut-off events. [2024-06-20 19:38:14,425 INFO L125 PetriNetUnfolderBase]: For 342013/342020 co-relation queries the response was YES. [2024-06-20 19:38:14,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31046 conditions, 3928 events. 2493/3928 cut-off events. For 342013/342020 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21754 event pairs, 572 based on Foata normal form. 8/3933 useless extension candidates. Maximal degree in co-relation 30941. Up to 3640 conditions per place. [2024-06-20 19:38:14,461 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 275 selfloop transitions, 45 changer transitions 0/324 dead transitions. [2024-06-20 19:38:14,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 324 transitions, 3840 flow [2024-06-20 19:38:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-20 19:38:14,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-20 19:38:14,462 INFO L175 Difference]: Start difference. First operand has 222 places, 296 transitions, 3006 flow. Second operand 9 states and 147 transitions. [2024-06-20 19:38:14,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 324 transitions, 3840 flow [2024-06-20 19:38:14,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 324 transitions, 3680 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:14,934 INFO L231 Difference]: Finished difference. Result has 225 places, 300 transitions, 3065 flow [2024-06-20 19:38:14,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2846, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3065, PETRI_PLACES=225, PETRI_TRANSITIONS=300} [2024-06-20 19:38:14,935 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places. [2024-06-20 19:38:14,935 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 300 transitions, 3065 flow [2024-06-20 19:38:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 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-20 19:38:14,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:14,935 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-20 19:38:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:38:14,936 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:38:14,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -639398004, now seen corresponding path program 1 times [2024-06-20 19:38:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624841184] [2024-06-20 19:38:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:24,091 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-20 19:38:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624841184] [2024-06-20 19:38:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624841184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076836463] [2024-06-20 19:38:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:24,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:24,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:24,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:24,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:38:24,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 300 transitions, 3065 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:24,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:24,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:38:24,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:25,590 INFO L124 PetriNetUnfolderBase]: 2513/3947 cut-off events. [2024-06-20 19:38:25,591 INFO L125 PetriNetUnfolderBase]: For 355979/355986 co-relation queries the response was YES. [2024-06-20 19:38:25,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31565 conditions, 3947 events. 2513/3947 cut-off events. For 355979/355986 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 21751 event pairs, 471 based on Foata normal form. 7/3951 useless extension candidates. Maximal degree in co-relation 31459. Up to 3362 conditions per place. [2024-06-20 19:38:25,628 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 260 selfloop transitions, 88 changer transitions 0/352 dead transitions. [2024-06-20 19:38:25,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 352 transitions, 4049 flow [2024-06-20 19:38:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:38:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:38:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-06-20 19:38:25,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-20 19:38:25,629 INFO L175 Difference]: Start difference. First operand has 225 places, 300 transitions, 3065 flow. Second operand 11 states and 184 transitions. [2024-06-20 19:38:25,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 352 transitions, 4049 flow [2024-06-20 19:38:26,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 352 transitions, 3858 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:26,235 INFO L231 Difference]: Finished difference. Result has 230 places, 313 transitions, 3238 flow [2024-06-20 19:38:26,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2874, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3238, PETRI_PLACES=230, PETRI_TRANSITIONS=313} [2024-06-20 19:38:26,236 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 189 predicate places. [2024-06-20 19:38:26,236 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 313 transitions, 3238 flow [2024-06-20 19:38:26,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:26,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:26,236 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-20 19:38:26,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:38:26,237 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:38:26,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1369754718, now seen corresponding path program 2 times [2024-06-20 19:38:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192778844] [2024-06-20 19:38:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:35,797 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-20 19:38:35,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:35,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192778844] [2024-06-20 19:38:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192778844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:35,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276280033] [2024-06-20 19:38:35,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:35,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:35,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:35,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:35,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:38:35,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 313 transitions, 3238 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:35,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:35,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:38:35,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:37,386 INFO L124 PetriNetUnfolderBase]: 2549/3989 cut-off events. [2024-06-20 19:38:37,386 INFO L125 PetriNetUnfolderBase]: For 374282/374289 co-relation queries the response was YES. [2024-06-20 19:38:37,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33150 conditions, 3989 events. 2549/3989 cut-off events. For 374282/374289 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 21911 event pairs, 482 based on Foata normal form. 7/3993 useless extension candidates. Maximal degree in co-relation 33042. Up to 3370 conditions per place. [2024-06-20 19:38:37,421 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 255 selfloop transitions, 99 changer transitions 0/358 dead transitions. [2024-06-20 19:38:37,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 358 transitions, 4394 flow [2024-06-20 19:38:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:38:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:38:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-20 19:38:37,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-20 19:38:37,424 INFO L175 Difference]: Start difference. First operand has 230 places, 313 transitions, 3238 flow. Second operand 11 states and 185 transitions. [2024-06-20 19:38:37,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 358 transitions, 4394 flow [2024-06-20 19:38:38,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 358 transitions, 4151 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-20 19:38:38,017 INFO L231 Difference]: Finished difference. Result has 233 places, 321 transitions, 3388 flow [2024-06-20 19:38:38,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2995, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3388, PETRI_PLACES=233, PETRI_TRANSITIONS=321} [2024-06-20 19:38:38,017 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places. [2024-06-20 19:38:38,017 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 321 transitions, 3388 flow [2024-06-20 19:38:38,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:38,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:38,018 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-20 19:38:38,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:38:38,018 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:38:38,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1670710510, now seen corresponding path program 1 times [2024-06-20 19:38:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816594434] [2024-06-20 19:38:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:46,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:46,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816594434] [2024-06-20 19:38:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816594434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:38:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663746571] [2024-06-20 19:38:46,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:46,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:38:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:38:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:38:46,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:38:46,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 321 transitions, 3388 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:38:46,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:46,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:38:46,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:48,234 INFO L124 PetriNetUnfolderBase]: 2559/4007 cut-off events. [2024-06-20 19:38:48,235 INFO L125 PetriNetUnfolderBase]: For 381981/381988 co-relation queries the response was YES. [2024-06-20 19:38:48,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33769 conditions, 4007 events. 2559/4007 cut-off events. For 381981/381988 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 22049 event pairs, 499 based on Foata normal form. 5/4009 useless extension candidates. Maximal degree in co-relation 33660. Up to 3734 conditions per place. [2024-06-20 19:38:48,274 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 300 selfloop transitions, 41 changer transitions 0/345 dead transitions. [2024-06-20 19:38:48,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 345 transitions, 4218 flow [2024-06-20 19:38:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:38:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:38:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-20 19:38:48,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-20 19:38:48,275 INFO L175 Difference]: Start difference. First operand has 233 places, 321 transitions, 3388 flow. Second operand 8 states and 131 transitions. [2024-06-20 19:38:48,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 345 transitions, 4218 flow [2024-06-20 19:38:48,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 345 transitions, 3952 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-20 19:38:48,925 INFO L231 Difference]: Finished difference. Result has 233 places, 325 transitions, 3303 flow [2024-06-20 19:38:48,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3122, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3303, PETRI_PLACES=233, PETRI_TRANSITIONS=325} [2024-06-20 19:38:48,926 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 192 predicate places. [2024-06-20 19:38:48,926 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 325 transitions, 3303 flow [2024-06-20 19:38:48,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:38:48,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:48,926 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-20 19:38:48,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:38:48,926 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:38:48,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1675352140, now seen corresponding path program 2 times [2024-06-20 19:38:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:48,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158266864] [2024-06-20 19:38:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:57,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158266864] [2024-06-20 19:38:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158266864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:38:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870092123] [2024-06-20 19:38:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:57,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:38:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:38:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:38:57,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:38:57,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 325 transitions, 3303 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:38:57,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:57,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:38:57,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:58,914 INFO L124 PetriNetUnfolderBase]: 2577/4039 cut-off events. [2024-06-20 19:38:58,914 INFO L125 PetriNetUnfolderBase]: For 392198/392205 co-relation queries the response was YES. [2024-06-20 19:38:58,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33782 conditions, 4039 events. 2577/4039 cut-off events. For 392198/392205 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 22282 event pairs, 490 based on Foata normal form. 5/4041 useless extension candidates. Maximal degree in co-relation 33672. Up to 3670 conditions per place. [2024-06-20 19:38:58,952 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 278 selfloop transitions, 68 changer transitions 0/350 dead transitions. [2024-06-20 19:38:58,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 350 transitions, 4510 flow [2024-06-20 19:38:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:38:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:38:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-20 19:38:58,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 19:38:58,954 INFO L175 Difference]: Start difference. First operand has 233 places, 325 transitions, 3303 flow. Second operand 8 states and 133 transitions. [2024-06-20 19:38:58,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 350 transitions, 4510 flow [2024-06-20 19:38:59,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 350 transitions, 4377 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:59,690 INFO L231 Difference]: Finished difference. Result has 235 places, 332 transitions, 3486 flow [2024-06-20 19:38:59,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3170, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3486, PETRI_PLACES=235, PETRI_TRANSITIONS=332} [2024-06-20 19:38:59,691 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 194 predicate places. [2024-06-20 19:38:59,691 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 332 transitions, 3486 flow [2024-06-20 19:38:59,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:38:59,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:59,691 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-20 19:38:59,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:38:59,691 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:38:59,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash -369975298, now seen corresponding path program 3 times [2024-06-20 19:38:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:59,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526110057] [2024-06-20 19:38:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:09,162 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-20 19:39:09,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:09,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526110057] [2024-06-20 19:39:09,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526110057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:09,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:09,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:39:09,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434982916] [2024-06-20 19:39:09,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:09,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:39:09,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:09,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:39:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:39:09,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:39:09,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 332 transitions, 3486 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:09,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:09,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:39:09,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:10,736 INFO L124 PetriNetUnfolderBase]: 2629/4115 cut-off events. [2024-06-20 19:39:10,736 INFO L125 PetriNetUnfolderBase]: For 420103/420110 co-relation queries the response was YES. [2024-06-20 19:39:10,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34900 conditions, 4115 events. 2629/4115 cut-off events. For 420103/420110 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 22700 event pairs, 478 based on Foata normal form. 7/4119 useless extension candidates. Maximal degree in co-relation 34789. Up to 3350 conditions per place. [2024-06-20 19:39:10,778 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 260 selfloop transitions, 104 changer transitions 0/368 dead transitions. [2024-06-20 19:39:10,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 368 transitions, 4646 flow [2024-06-20 19:39:10,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-20 19:39:10,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415 [2024-06-20 19:39:10,780 INFO L175 Difference]: Start difference. First operand has 235 places, 332 transitions, 3486 flow. Second operand 10 states and 166 transitions. [2024-06-20 19:39:10,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 368 transitions, 4646 flow [2024-06-20 19:39:11,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 368 transitions, 4507 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-20 19:39:11,313 INFO L231 Difference]: Finished difference. Result has 241 places, 339 transitions, 3718 flow [2024-06-20 19:39:11,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3718, PETRI_PLACES=241, PETRI_TRANSITIONS=339} [2024-06-20 19:39:11,313 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 200 predicate places. [2024-06-20 19:39:11,313 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 339 transitions, 3718 flow [2024-06-20 19:39:11,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:11,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:11,314 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-20 19:39:11,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:39:11,314 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:39:11,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1848079180, now seen corresponding path program 3 times [2024-06-20 19:39:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:11,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133443186] [2024-06-20 19:39:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:20,149 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-20 19:39:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133443186] [2024-06-20 19:39:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133443186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:20,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:20,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:39:20,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053660833] [2024-06-20 19:39:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:20,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:39:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:20,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:39:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:39:20,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:39:20,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 339 transitions, 3718 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:39:20,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:20,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:39:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:21,665 INFO L124 PetriNetUnfolderBase]: 2623/4104 cut-off events. [2024-06-20 19:39:21,665 INFO L125 PetriNetUnfolderBase]: For 422840/422847 co-relation queries the response was YES. [2024-06-20 19:39:21,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35472 conditions, 4104 events. 2623/4104 cut-off events. For 422840/422847 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 22610 event pairs, 517 based on Foata normal form. 5/4106 useless extension candidates. Maximal degree in co-relation 35360. Up to 3737 conditions per place. [2024-06-20 19:39:21,700 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 284 selfloop transitions, 68 changer transitions 0/356 dead transitions. [2024-06-20 19:39:21,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 356 transitions, 4622 flow [2024-06-20 19:39:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:39:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:39:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-20 19:39:21,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-20 19:39:21,702 INFO L175 Difference]: Start difference. First operand has 241 places, 339 transitions, 3718 flow. Second operand 8 states and 131 transitions. [2024-06-20 19:39:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 356 transitions, 4622 flow [2024-06-20 19:39:22,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 356 transitions, 4371 flow, removed 80 selfloop flow, removed 6 redundant places. [2024-06-20 19:39:22,308 INFO L231 Difference]: Finished difference. Result has 243 places, 339 transitions, 3613 flow [2024-06-20 19:39:22,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3467, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3613, PETRI_PLACES=243, PETRI_TRANSITIONS=339} [2024-06-20 19:39:22,309 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places. [2024-06-20 19:39:22,309 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 339 transitions, 3613 flow [2024-06-20 19:39:22,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-20 19:39:22,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:22,309 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-20 19:39:22,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:39:22,310 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:39:22,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash -370098430, now seen corresponding path program 3 times [2024-06-20 19:39:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109090545] [2024-06-20 19:39:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15