./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi009_power.opt_pso.oepc_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-bcb38a6-m [2024-06-03 22:23:18,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:23:18,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:23:18,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:23:18,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:23:19,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:23:19,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:23:19,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:23:19,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:23:19,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:23:19,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:23:19,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:23:19,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:23:19,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:23:19,016 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:23:19,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:23:19,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:23:19,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:23:19,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:23:19,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:23:19,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:23:19,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:23:19,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:23:19,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:23:19,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:23:19,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:23:19,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:23:19,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:23:19,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:23:19,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:23:19,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:23:19,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:23:19,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:23:19,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:23:19,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:23:19,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:23:19,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:23:19,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:23:19,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:23:19,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:23:19,022 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:23:19,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:23:19,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:23:19,023 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-03 22:23:19,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:23:19,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:23:19,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:23:19,260 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:23:19,260 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:23:19,261 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-03 22:23:19,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:23:19,425 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:23:19,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-03 22:23:20,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:23:20,640 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:23:20,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-03 22:23:20,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c6f2932/5a9b4163fe4747b880f763c9bedfdeca/FLAG130887b00 [2024-06-03 22:23:20,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c6f2932/5a9b4163fe4747b880f763c9bedfdeca [2024-06-03 22:23:20,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:23:20,664 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:23:20,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:23:20,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:23:20,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:23:20,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:23:19" (1/2) ... [2024-06-03 22:23:20,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5eff4d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:23:20, skipping insertion in model container [2024-06-03 22:23:20,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:23:19" (1/2) ... [2024-06-03 22:23:20,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@426fc3c6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:23:20, skipping insertion in model container [2024-06-03 22:23:20,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:23:20" (2/2) ... [2024-06-03 22:23:20,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5eff4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:20, skipping insertion in model container [2024-06-03 22:23:20,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:23:20" (2/2) ... [2024-06-03 22:23:20,672 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:23:20,738 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:23:20,738 INFO L97 edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((((! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_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_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 )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_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_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 )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_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_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$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_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_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$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_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_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$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_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_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_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_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_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_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 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_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 )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_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_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) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (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_thd3 >= 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_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 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_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_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 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_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd3 >= 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_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 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_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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0) [2024-06-03 22:23:20,739 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((((! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_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_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 )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_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_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 )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_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_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$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_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_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$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_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_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$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_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_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_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_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_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_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 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_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 )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_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_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) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (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_thd3 >= 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_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 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_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_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 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_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd3 >= 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_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 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_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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0) [2024-06-03 22:23:20,740 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((((! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_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_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 )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_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_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 )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_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_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$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_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_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$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_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_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$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 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_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_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_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_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_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_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 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_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 )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_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_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) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (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_thd3 >= 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_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 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_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_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 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_thd3 >= 0LL) && (long long )y$r_buff0_thd1 - (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_thd3 >= 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_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 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_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_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_thd3 >= 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_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_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0) [2024-06-03 22:23:20,740 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:23:20,740 INFO L106 edCorrectnessWitness]: ghost_update [L845-L845] multithreaded = 1; [2024-06-03 22:23:20,779 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:23:21,103 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:23:21,115 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:23:21,373 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:23:21,404 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:23:21,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21 WrapperNode [2024-06-03 22:23:21,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:23:21,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:23:21,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:23:21,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:23:21,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,535 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2024-06-03 22:23:21,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:23:21,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:23:21,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:23:21,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:23:21,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,620 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-03 22:23:21,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:23:21,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:23:21,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:23:21,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:23:21,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (1/1) ... [2024-06-03 22:23:21,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:23:21,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:23:21,729 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-03 22:23:21,739 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-03 22:23:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:23:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:23:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:23:21,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:23:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:23:21,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:23:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 22:23:21,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 22:23:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:23:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:23:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:23:21,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:23:21,763 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:23:21,904 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:23:21,906 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:23:22,877 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:23:22,879 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:23:23,159 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:23:23,159 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:23:23,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:23:23 BoogieIcfgContainer [2024-06-03 22:23:23,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:23:23,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:23:23,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:23:23,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:23:23,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:23:19" (1/4) ... [2024-06-03 22:23:23,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3540e77f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:23:23, skipping insertion in model container [2024-06-03 22:23:23,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:23:20" (2/4) ... [2024-06-03 22:23:23,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3540e77f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:23:23, skipping insertion in model container [2024-06-03 22:23:23,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:23:21" (3/4) ... [2024-06-03 22:23:23,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3540e77f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:23:23, skipping insertion in model container [2024-06-03 22:23:23,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:23:23" (4/4) ... [2024-06-03 22:23:23,169 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-03 22:23:23,182 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:23:23,182 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 22:23:23,183 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:23:23,292 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:23:23,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:23:23,378 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 22:23:23,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:23:23,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:23:23,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 22:23:23,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 22:23:23,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:23:23,400 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;@760da5d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:23:23,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 22:23:23,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:23:23,408 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:23:23,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:23:23,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:23,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:23:23,410 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-03 22:23:23,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash -505467053, now seen corresponding path program 1 times [2024-06-03 22:23:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:23,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20756085] [2024-06-03 22:23:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20756085] [2024-06-03 22:23:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20756085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:28,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:28,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:23:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081931540] [2024-06-03 22:23:28,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:28,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:23:28,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:28,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:23:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:23:28,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-03 22:23:28,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:28,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:28,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-03 22:23:28,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:28,810 INFO L124 PetriNetUnfolderBase]: 897/1401 cut-off events. [2024-06-03 22:23:28,810 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-06-03 22:23:28,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1401 events. 897/1401 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6765 event pairs, 581 based on Foata normal form. 1/1371 useless extension candidates. Maximal degree in co-relation 2818. Up to 1359 conditions per place. [2024-06-03 22:23:28,823 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-03 22:23:28,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 171 flow [2024-06-03 22:23:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:23:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:23:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-03 22:23:28,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-06-03 22:23:28,834 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 75 transitions. [2024-06-03 22:23:28,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 171 flow [2024-06-03 22:23:28,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 22:23:28,839 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-03 22:23:28,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-03 22:23:28,842 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-03 22:23:28,843 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-03 22:23:28,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:28,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:28,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:28,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:23:28,844 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-03 22:23:28,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash -212201232, now seen corresponding path program 1 times [2024-06-03 22:23:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:28,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974491723] [2024-06-03 22:23:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:32,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:32,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974491723] [2024-06-03 22:23:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974491723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:23:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000847252] [2024-06-03 22:23:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:32,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:23:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:23:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:23:33,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:23:33,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:33,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:33,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:23:33,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:33,720 INFO L124 PetriNetUnfolderBase]: 1140/1761 cut-off events. [2024-06-03 22:23:33,721 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2024-06-03 22:23:33,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 1761 events. 1140/1761 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8277 event pairs, 549 based on Foata normal form. 3/1760 useless extension candidates. Maximal degree in co-relation 4036. Up to 1684 conditions per place. [2024-06-03 22:23:33,729 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 35 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-06-03 22:23:33,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 212 flow [2024-06-03 22:23:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:23:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:23:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-03 22:23:33,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2024-06-03 22:23:33,732 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 3 states and 72 transitions. [2024-06-03 22:23:33,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 212 flow [2024-06-03 22:23:33,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:23:33,735 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 136 flow [2024-06-03 22:23:33,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-03 22:23:33,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-03 22:23:33,736 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 136 flow [2024-06-03 22:23:33,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:33,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:33,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:23:33,739 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-03 22:23:33,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 566595149, now seen corresponding path program 1 times [2024-06-03 22:23:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496967182] [2024-06-03 22:23:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496967182] [2024-06-03 22:23:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496967182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:38,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:38,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:23:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460813466] [2024-06-03 22:23:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:38,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:23:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:23:38,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:23:38,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:23:38,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-03 22:23:38,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:38,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:23:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:39,100 INFO L124 PetriNetUnfolderBase]: 1131/1744 cut-off events. [2024-06-03 22:23:39,101 INFO L125 PetriNetUnfolderBase]: For 947/947 co-relation queries the response was YES. [2024-06-03 22:23:39,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 1744 events. 1131/1744 cut-off events. For 947/947 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8166 event pairs, 409 based on Foata normal form. 6/1744 useless extension candidates. Maximal degree in co-relation 4454. Up to 1639 conditions per place. [2024-06-03 22:23:39,109 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 39 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2024-06-03 22:23:39,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 268 flow [2024-06-03 22:23:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:23:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:23:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-03 22:23:39,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2024-06-03 22:23:39,112 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 136 flow. Second operand 4 states and 92 transitions. [2024-06-03 22:23:39,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 268 flow [2024-06-03 22:23:39,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:23:39,115 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 163 flow [2024-06-03 22:23:39,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-03 22:23:39,116 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-06-03 22:23:39,116 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 163 flow [2024-06-03 22:23:39,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-03 22:23:39,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:39,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:39,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:23:39,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:23:39,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1276211552, now seen corresponding path program 1 times [2024-06-03 22:23:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:39,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981862843] [2024-06-03 22:23:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:45,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981862843] [2024-06-03 22:23:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981862843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:45,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:23:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560820740] [2024-06-03 22:23:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:45,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:23:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:45,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:23:45,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:23:45,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:23:45,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 22:23:45,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:45,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:23:45,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:46,368 INFO L124 PetriNetUnfolderBase]: 872/1380 cut-off events. [2024-06-03 22:23:46,368 INFO L125 PetriNetUnfolderBase]: For 1463/1463 co-relation queries the response was YES. [2024-06-03 22:23:46,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3824 conditions, 1380 events. 872/1380 cut-off events. For 1463/1463 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6826 event pairs, 400 based on Foata normal form. 4/1382 useless extension candidates. Maximal degree in co-relation 3805. Up to 1283 conditions per place. [2024-06-03 22:23:46,375 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 38 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-03 22:23:46,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 305 flow [2024-06-03 22:23:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:23:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:23:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-03 22:23:46,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4926829268292683 [2024-06-03 22:23:46,377 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 163 flow. Second operand 5 states and 101 transitions. [2024-06-03 22:23:46,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 305 flow [2024-06-03 22:23:46,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 284 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 22:23:46,379 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 191 flow [2024-06-03 22:23:46,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-03 22:23:46,380 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2024-06-03 22:23:46,380 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 191 flow [2024-06-03 22:23:46,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 22:23:46,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:46,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:46,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:23:46,381 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-03 22:23:46,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:46,381 INFO L85 PathProgramCache]: Analyzing trace with hash 915003230, now seen corresponding path program 1 times [2024-06-03 22:23:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952841020] [2024-06-03 22:23:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:46,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:54,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:54,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952841020] [2024-06-03 22:23:54,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952841020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:54,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:54,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:23:54,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100920949] [2024-06-03 22:23:54,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:54,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:23:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:54,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:23:54,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:23:54,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-03 22:23:54,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:54,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:54,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-03 22:23:54,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:55,278 INFO L124 PetriNetUnfolderBase]: 889/1402 cut-off events. [2024-06-03 22:23:55,278 INFO L125 PetriNetUnfolderBase]: For 2185/2185 co-relation queries the response was YES. [2024-06-03 22:23:55,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 1402 events. 889/1402 cut-off events. For 2185/2185 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6822 event pairs, 378 based on Foata normal form. 4/1405 useless extension candidates. Maximal degree in co-relation 4247. Up to 1310 conditions per place. [2024-06-03 22:23:55,287 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 47 selfloop transitions, 12 changer transitions 0/65 dead transitions. [2024-06-03 22:23:55,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 396 flow [2024-06-03 22:23:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:23:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:23:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-03 22:23:55,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483739837398374 [2024-06-03 22:23:55,290 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 191 flow. Second operand 6 states and 119 transitions. [2024-06-03 22:23:55,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 396 flow [2024-06-03 22:23:55,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 366 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 22:23:55,299 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 257 flow [2024-06-03 22:23:55,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2024-06-03 22:23:55,301 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2024-06-03 22:23:55,301 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 257 flow [2024-06-03 22:23:55,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:55,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:55,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:55,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:23:55,304 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-03 22:23:55,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash 568777869, now seen corresponding path program 1 times [2024-06-03 22:23:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:55,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165175259] [2024-06-03 22:23:55,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:04,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165175259] [2024-06-03 22:24:04,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165175259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:24:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356262349] [2024-06-03 22:24:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:04,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:24:04,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:24:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:24:04,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:24:04,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 257 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:04,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:04,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:24:04,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:05,397 INFO L124 PetriNetUnfolderBase]: 1095/1677 cut-off events. [2024-06-03 22:24:05,398 INFO L125 PetriNetUnfolderBase]: For 4058/4058 co-relation queries the response was YES. [2024-06-03 22:24:05,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5762 conditions, 1677 events. 1095/1677 cut-off events. For 4058/4058 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8012 event pairs, 404 based on Foata normal form. 6/1681 useless extension candidates. Maximal degree in co-relation 5739. Up to 1525 conditions per place. [2024-06-03 22:24:05,407 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 53 selfloop transitions, 30 changer transitions 0/88 dead transitions. [2024-06-03 22:24:05,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 614 flow [2024-06-03 22:24:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:24:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:24:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-03 22:24:05,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725609756097561 [2024-06-03 22:24:05,410 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 257 flow. Second operand 8 states and 155 transitions. [2024-06-03 22:24:05,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 614 flow [2024-06-03 22:24:05,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 88 transitions, 568 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 22:24:05,413 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 416 flow [2024-06-03 22:24:05,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=416, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2024-06-03 22:24:05,413 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-06-03 22:24:05,413 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 416 flow [2024-06-03 22:24:05,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:05,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:05,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:05,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:24:05,414 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:24:05,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 154232375, now seen corresponding path program 1 times [2024-06-03 22:24:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344786214] [2024-06-03 22:24:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:15,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344786214] [2024-06-03 22:24:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344786214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:15,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:24:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299646460] [2024-06-03 22:24:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:15,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:24:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:24:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:24:15,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:24:15,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 416 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-03 22:24:15,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:15,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:24:15,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:15,936 INFO L124 PetriNetUnfolderBase]: 1363/2083 cut-off events. [2024-06-03 22:24:15,937 INFO L125 PetriNetUnfolderBase]: For 7355/7355 co-relation queries the response was YES. [2024-06-03 22:24:15,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7981 conditions, 2083 events. 1363/2083 cut-off events. For 7355/7355 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9825 event pairs, 434 based on Foata normal form. 2/2085 useless extension candidates. Maximal degree in co-relation 7955. Up to 2036 conditions per place. [2024-06-03 22:24:15,948 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 65 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-06-03 22:24:15,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 618 flow [2024-06-03 22:24:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:24:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:24:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-06-03 22:24:15,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2024-06-03 22:24:15,950 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 416 flow. Second operand 5 states and 88 transitions. [2024-06-03 22:24:15,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 618 flow [2024-06-03 22:24:15,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 567 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 22:24:15,955 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 435 flow [2024-06-03 22:24:15,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=435, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2024-06-03 22:24:15,956 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-03 22:24:15,956 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 435 flow [2024-06-03 22:24:15,956 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-03 22:24:15,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:15,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:15,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:24:15,957 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-03 22:24:15,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:15,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1502315787, now seen corresponding path program 1 times [2024-06-03 22:24:15,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250691638] [2024-06-03 22:24:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:24,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250691638] [2024-06-03 22:24:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250691638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:24:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218952698] [2024-06-03 22:24:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:24,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:24:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:24:24,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:24:24,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:24:24,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 435 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:24,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:24,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:24:24,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:25,178 INFO L124 PetriNetUnfolderBase]: 1278/1991 cut-off events. [2024-06-03 22:24:25,178 INFO L125 PetriNetUnfolderBase]: For 8238/8238 co-relation queries the response was YES. [2024-06-03 22:24:25,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 1991 events. 1278/1991 cut-off events. For 8238/8238 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9677 event pairs, 414 based on Foata normal form. 2/1992 useless extension candidates. Maximal degree in co-relation 7973. Up to 1761 conditions per place. [2024-06-03 22:24:25,191 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 51 selfloop transitions, 29 changer transitions 0/86 dead transitions. [2024-06-03 22:24:25,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 649 flow [2024-06-03 22:24:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:24:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:24:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-03 22:24:25,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483739837398374 [2024-06-03 22:24:25,194 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 435 flow. Second operand 6 states and 119 transitions. [2024-06-03 22:24:25,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 649 flow [2024-06-03 22:24:25,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 629 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-03 22:24:25,199 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 493 flow [2024-06-03 22:24:25,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=493, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-06-03 22:24:25,200 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-03 22:24:25,200 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 493 flow [2024-06-03 22:24:25,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:25,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:25,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:25,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:24:25,201 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-03 22:24:25,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1161567413, now seen corresponding path program 2 times [2024-06-03 22:24:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363565541] [2024-06-03 22:24:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:35,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363565541] [2024-06-03 22:24:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363565541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:35,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:24:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377220676] [2024-06-03 22:24:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:35,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:24:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:24:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:24:36,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:24:36,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 493 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:36,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:36,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:24:36,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:37,040 INFO L124 PetriNetUnfolderBase]: 1277/1987 cut-off events. [2024-06-03 22:24:37,040 INFO L125 PetriNetUnfolderBase]: For 9974/9974 co-relation queries the response was YES. [2024-06-03 22:24:37,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8317 conditions, 1987 events. 1277/1987 cut-off events. For 9974/9974 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9648 event pairs, 414 based on Foata normal form. 6/1992 useless extension candidates. Maximal degree in co-relation 8285. Up to 1719 conditions per place. [2024-06-03 22:24:37,052 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 57 selfloop transitions, 36 changer transitions 0/99 dead transitions. [2024-06-03 22:24:37,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 843 flow [2024-06-03 22:24:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:24:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:24:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-03 22:24:37,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4843205574912892 [2024-06-03 22:24:37,055 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 493 flow. Second operand 7 states and 139 transitions. [2024-06-03 22:24:37,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 843 flow [2024-06-03 22:24:37,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 785 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-03 22:24:37,062 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 588 flow [2024-06-03 22:24:37,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2024-06-03 22:24:37,067 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-03 22:24:37,067 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 588 flow [2024-06-03 22:24:37,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:37,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:37,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:37,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:24:37,067 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-03 22:24:37,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1295235570, now seen corresponding path program 1 times [2024-06-03 22:24:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950800389] [2024-06-03 22:24:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:45,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950800389] [2024-06-03 22:24:45,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950800389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:45,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:45,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321112816] [2024-06-03 22:24:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:45,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:45,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:45,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:24:45,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 588 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:45,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:45,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:24:45,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:46,361 INFO L124 PetriNetUnfolderBase]: 1296/2041 cut-off events. [2024-06-03 22:24:46,361 INFO L125 PetriNetUnfolderBase]: For 13366/13366 co-relation queries the response was YES. [2024-06-03 22:24:46,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9113 conditions, 2041 events. 1296/2041 cut-off events. For 13366/13366 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9889 event pairs, 407 based on Foata normal form. 24/2064 useless extension candidates. Maximal degree in co-relation 9080. Up to 1754 conditions per place. [2024-06-03 22:24:46,372 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 82 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2024-06-03 22:24:46,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 113 transitions, 952 flow [2024-06-03 22:24:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:24:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:24:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-03 22:24:46,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-03 22:24:46,375 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 588 flow. Second operand 9 states and 170 transitions. [2024-06-03 22:24:46,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 113 transitions, 952 flow [2024-06-03 22:24:46,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 113 transitions, 899 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-03 22:24:46,385 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 669 flow [2024-06-03 22:24:46,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=669, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2024-06-03 22:24:46,386 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-03 22:24:46,386 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 669 flow [2024-06-03 22:24:46,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:46,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:46,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:46,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:24:46,387 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-03 22:24:46,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1045502606, now seen corresponding path program 1 times [2024-06-03 22:24:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:46,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740870584] [2024-06-03 22:24:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:46,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:54,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:54,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740870584] [2024-06-03 22:24:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740870584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:54,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:54,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:24:54,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870634475] [2024-06-03 22:24:54,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:54,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:24:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:24:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:24:54,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:24:54,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 669 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:54,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:54,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:24:54,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:55,217 INFO L124 PetriNetUnfolderBase]: 1347/2104 cut-off events. [2024-06-03 22:24:55,218 INFO L125 PetriNetUnfolderBase]: For 14057/14057 co-relation queries the response was YES. [2024-06-03 22:24:55,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9578 conditions, 2104 events. 1347/2104 cut-off events. For 14057/14057 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10390 event pairs, 281 based on Foata normal form. 4/2107 useless extension candidates. Maximal degree in co-relation 9541. Up to 1940 conditions per place. [2024-06-03 22:24:55,227 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 80 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-06-03 22:24:55,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 100 transitions, 917 flow [2024-06-03 22:24:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:24:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:24:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-03 22:24:55,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:24:55,243 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 669 flow. Second operand 6 states and 114 transitions. [2024-06-03 22:24:55,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 100 transitions, 917 flow [2024-06-03 22:24:55,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 874 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:24:55,253 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 683 flow [2024-06-03 22:24:55,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=683, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2024-06-03 22:24:55,254 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-03 22:24:55,254 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 683 flow [2024-06-03 22:24:55,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:55,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:55,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:55,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:24:55,255 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-03 22:24:55,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:55,255 INFO L85 PathProgramCache]: Analyzing trace with hash 959186284, now seen corresponding path program 2 times [2024-06-03 22:24:55,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:55,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432596554] [2024-06-03 22:24:55,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:55,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:03,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432596554] [2024-06-03 22:25:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432596554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:03,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:25:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195861821] [2024-06-03 22:25:03,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:03,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:25:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:03,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:25:03,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:25:03,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:25:03,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 683 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:03,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:03,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:25:03,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:04,482 INFO L124 PetriNetUnfolderBase]: 1339/2092 cut-off events. [2024-06-03 22:25:04,482 INFO L125 PetriNetUnfolderBase]: For 15313/15313 co-relation queries the response was YES. [2024-06-03 22:25:04,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9647 conditions, 2092 events. 1339/2092 cut-off events. For 15313/15313 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10360 event pairs, 384 based on Foata normal form. 4/2095 useless extension candidates. Maximal degree in co-relation 9609. Up to 1917 conditions per place. [2024-06-03 22:25:04,494 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 79 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-06-03 22:25:04,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 953 flow [2024-06-03 22:25:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:25:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:25:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-03 22:25:04,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-03 22:25:04,497 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 683 flow. Second operand 6 states and 116 transitions. [2024-06-03 22:25:04,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 953 flow [2024-06-03 22:25:04,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 103 transitions, 914 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:25:04,510 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 714 flow [2024-06-03 22:25:04,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2024-06-03 22:25:04,511 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-03 22:25:04,511 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 714 flow [2024-06-03 22:25:04,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:04,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:04,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:04,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:25:04,513 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:25:04,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1342839642, now seen corresponding path program 1 times [2024-06-03 22:25:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:04,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062550850] [2024-06-03 22:25:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062550850] [2024-06-03 22:25:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062550850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:25:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391475753] [2024-06-03 22:25:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:14,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:25:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:25:14,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:25:14,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:25:14,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 714 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:14,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:14,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:25:14,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:15,725 INFO L124 PetriNetUnfolderBase]: 1435/2204 cut-off events. [2024-06-03 22:25:15,725 INFO L125 PetriNetUnfolderBase]: For 18019/18019 co-relation queries the response was YES. [2024-06-03 22:25:15,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10344 conditions, 2204 events. 1435/2204 cut-off events. For 18019/18019 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10622 event pairs, 411 based on Foata normal form. 4/2207 useless extension candidates. Maximal degree in co-relation 10305. Up to 2108 conditions per place. [2024-06-03 22:25:15,738 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 79 selfloop transitions, 15 changer transitions 0/98 dead transitions. [2024-06-03 22:25:15,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 98 transitions, 958 flow [2024-06-03 22:25:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:25:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:25:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-03 22:25:15,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-03 22:25:15,740 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 714 flow. Second operand 5 states and 92 transitions. [2024-06-03 22:25:15,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 98 transitions, 958 flow [2024-06-03 22:25:15,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 98 transitions, 908 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 22:25:15,754 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 735 flow [2024-06-03 22:25:15,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=735, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2024-06-03 22:25:15,754 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-03 22:25:15,754 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 735 flow [2024-06-03 22:25:15,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:15,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:15,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:15,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:25:15,755 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-03 22:25:15,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2040737618, now seen corresponding path program 2 times [2024-06-03 22:25:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596204758] [2024-06-03 22:25:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596204758] [2024-06-03 22:25:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596204758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:25:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921324447] [2024-06-03 22:25:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:26,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:25:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:26,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:25:26,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:25:26,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:25:26,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 735 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:26,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:26,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:25:26,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:27,819 INFO L124 PetriNetUnfolderBase]: 1423/2188 cut-off events. [2024-06-03 22:25:27,819 INFO L125 PetriNetUnfolderBase]: For 19501/19501 co-relation queries the response was YES. [2024-06-03 22:25:27,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 2188 events. 1423/2188 cut-off events. For 19501/19501 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10511 event pairs, 409 based on Foata normal form. 4/2191 useless extension candidates. Maximal degree in co-relation 10548. Up to 2076 conditions per place. [2024-06-03 22:25:27,830 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 82 selfloop transitions, 18 changer transitions 0/104 dead transitions. [2024-06-03 22:25:27,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 104 transitions, 1011 flow [2024-06-03 22:25:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:25:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:25:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 22:25:27,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-03 22:25:27,831 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 735 flow. Second operand 6 states and 107 transitions. [2024-06-03 22:25:27,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 104 transitions, 1011 flow [2024-06-03 22:25:27,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 104 transitions, 970 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-03 22:25:27,845 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 772 flow [2024-06-03 22:25:27,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2024-06-03 22:25:27,846 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2024-06-03 22:25:27,846 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 772 flow [2024-06-03 22:25:27,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:27,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:27,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:27,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:25:27,847 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:25:27,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2106743304, now seen corresponding path program 1 times [2024-06-03 22:25:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823942629] [2024-06-03 22:25:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823942629] [2024-06-03 22:25:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823942629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:36,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:25:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923317810] [2024-06-03 22:25:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:25:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:25:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:25:36,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:25:36,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 772 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-03 22:25:36,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:36,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:25:36,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:37,713 INFO L124 PetriNetUnfolderBase]: 1433/2203 cut-off events. [2024-06-03 22:25:37,713 INFO L125 PetriNetUnfolderBase]: For 19806/19806 co-relation queries the response was YES. [2024-06-03 22:25:37,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10738 conditions, 2203 events. 1433/2203 cut-off events. For 19806/19806 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10579 event pairs, 395 based on Foata normal form. 2/2205 useless extension candidates. Maximal degree in co-relation 10697. Up to 2126 conditions per place. [2024-06-03 22:25:37,726 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 96 selfloop transitions, 15 changer transitions 0/115 dead transitions. [2024-06-03 22:25:37,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 115 transitions, 1119 flow [2024-06-03 22:25:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:25:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:25:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-03 22:25:37,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44308943089430897 [2024-06-03 22:25:37,730 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 772 flow. Second operand 6 states and 109 transitions. [2024-06-03 22:25:37,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 115 transitions, 1119 flow [2024-06-03 22:25:37,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 115 transitions, 1071 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:25:37,744 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 836 flow [2024-06-03 22:25:37,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=836, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2024-06-03 22:25:37,745 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-03 22:25:37,745 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 836 flow [2024-06-03 22:25:37,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-03 22:25:37,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:37,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:37,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:25:37,746 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:25:37,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2070756954, now seen corresponding path program 2 times [2024-06-03 22:25:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44419799] [2024-06-03 22:25:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:46,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-03 22:25:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44419799] [2024-06-03 22:25:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44419799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:46,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:46,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:25:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092998789] [2024-06-03 22:25:46,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:46,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:25:46,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:46,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:25:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:25:46,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:25:46,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 836 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-03 22:25:46,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:46,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:25:46,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:47,372 INFO L124 PetriNetUnfolderBase]: 1427/2195 cut-off events. [2024-06-03 22:25:47,373 INFO L125 PetriNetUnfolderBase]: For 21903/21903 co-relation queries the response was YES. [2024-06-03 22:25:47,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11065 conditions, 2195 events. 1427/2195 cut-off events. For 21903/21903 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10489 event pairs, 393 based on Foata normal form. 2/2197 useless extension candidates. Maximal degree in co-relation 11022. Up to 2136 conditions per place. [2024-06-03 22:25:47,385 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 96 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2024-06-03 22:25:47,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 111 transitions, 1083 flow [2024-06-03 22:25:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:25:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:25:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 22:25:47,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:25:47,386 INFO L175 Difference]: Start difference. First operand has 88 places, 99 transitions, 836 flow. Second operand 6 states and 102 transitions. [2024-06-03 22:25:47,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 111 transitions, 1083 flow [2024-06-03 22:25:47,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 111 transitions, 1041 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 22:25:47,402 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 831 flow [2024-06-03 22:25:47,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2024-06-03 22:25:47,402 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-03 22:25:47,403 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 831 flow [2024-06-03 22:25:47,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-03 22:25:47,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:47,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:25:47,403 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:25:47,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1107950500, now seen corresponding path program 1 times [2024-06-03 22:25:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627871205] [2024-06-03 22:25:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627871205] [2024-06-03 22:25:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627871205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:25:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636245048] [2024-06-03 22:25:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:57,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:25:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:25:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:25:57,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:25:57,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 831 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-03 22:25:57,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:57,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:25:57,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:58,370 INFO L124 PetriNetUnfolderBase]: 1422/2188 cut-off events. [2024-06-03 22:25:58,370 INFO L125 PetriNetUnfolderBase]: For 23553/23553 co-relation queries the response was YES. [2024-06-03 22:25:58,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11040 conditions, 2188 events. 1422/2188 cut-off events. For 23553/23553 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10490 event pairs, 392 based on Foata normal form. 2/2190 useless extension candidates. Maximal degree in co-relation 10996. Up to 2131 conditions per place. [2024-06-03 22:25:58,379 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 99 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2024-06-03 22:25:58,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 113 transitions, 1091 flow [2024-06-03 22:25:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:25:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:25:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-03 22:25:58,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-03 22:25:58,381 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 831 flow. Second operand 6 states and 101 transitions. [2024-06-03 22:25:58,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 113 transitions, 1091 flow [2024-06-03 22:25:58,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 1071 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-03 22:25:58,395 INFO L231 Difference]: Finished difference. Result has 93 places, 102 transitions, 856 flow [2024-06-03 22:25:58,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=93, PETRI_TRANSITIONS=102} [2024-06-03 22:25:58,396 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-03 22:25:58,396 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 102 transitions, 856 flow [2024-06-03 22:25:58,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 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-03 22:25:58,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:58,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:58,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:25:58,397 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-03 22:25:58,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash -620243916, now seen corresponding path program 1 times [2024-06-03 22:25:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:58,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456733709] [2024-06-03 22:25:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:58,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:06,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-03 22:26:06,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:06,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456733709] [2024-06-03 22:26:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456733709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:06,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:06,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165155224] [2024-06-03 22:26:06,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:06,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:06,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:26:06,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 102 transitions, 856 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:06,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:06,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:26:06,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:07,341 INFO L124 PetriNetUnfolderBase]: 1420/2235 cut-off events. [2024-06-03 22:26:07,342 INFO L125 PetriNetUnfolderBase]: For 28363/28363 co-relation queries the response was YES. [2024-06-03 22:26:07,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11577 conditions, 2235 events. 1420/2235 cut-off events. For 28363/28363 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11196 event pairs, 237 based on Foata normal form. 16/2250 useless extension candidates. Maximal degree in co-relation 11532. Up to 1970 conditions per place. [2024-06-03 22:26:07,355 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 107 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2024-06-03 22:26:07,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 1188 flow [2024-06-03 22:26:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:26:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:26:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 22:26:07,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 22:26:07,358 INFO L175 Difference]: Start difference. First operand has 93 places, 102 transitions, 856 flow. Second operand 7 states and 133 transitions. [2024-06-03 22:26:07,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 1188 flow [2024-06-03 22:26:07,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1159 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:26:07,375 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 883 flow [2024-06-03 22:26:07,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=883, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2024-06-03 22:26:07,376 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-03 22:26:07,376 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 883 flow [2024-06-03 22:26:07,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:07,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:07,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:07,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:26:07,377 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-03 22:26:07,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash 723300754, now seen corresponding path program 2 times [2024-06-03 22:26:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917769453] [2024-06-03 22:26:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:17,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:17,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917769453] [2024-06-03 22:26:17,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917769453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:17,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:17,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:17,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952359705] [2024-06-03 22:26:17,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:17,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:17,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:17,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:17,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:17,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:26:17,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 883 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:17,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:17,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:26:17,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:18,691 INFO L124 PetriNetUnfolderBase]: 1433/2264 cut-off events. [2024-06-03 22:26:18,691 INFO L125 PetriNetUnfolderBase]: For 30256/30256 co-relation queries the response was YES. [2024-06-03 22:26:18,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11854 conditions, 2264 events. 1433/2264 cut-off events. For 30256/30256 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11462 event pairs, 376 based on Foata normal form. 8/2271 useless extension candidates. Maximal degree in co-relation 11808. Up to 2006 conditions per place. [2024-06-03 22:26:18,703 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 89 selfloop transitions, 31 changer transitions 0/127 dead transitions. [2024-06-03 22:26:18,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 127 transitions, 1219 flow [2024-06-03 22:26:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:26:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:26:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 22:26:18,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-03 22:26:18,711 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 883 flow. Second operand 7 states and 135 transitions. [2024-06-03 22:26:18,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 127 transitions, 1219 flow [2024-06-03 22:26:18,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 1179 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 22:26:18,732 INFO L231 Difference]: Finished difference. Result has 98 places, 105 transitions, 949 flow [2024-06-03 22:26:18,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=949, PETRI_PLACES=98, PETRI_TRANSITIONS=105} [2024-06-03 22:26:18,732 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-03 22:26:18,733 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 105 transitions, 949 flow [2024-06-03 22:26:18,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:18,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:18,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:18,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:26:18,733 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-03 22:26:18,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 723297034, now seen corresponding path program 3 times [2024-06-03 22:26:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:18,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108960783] [2024-06-03 22:26:18,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108960783] [2024-06-03 22:26:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108960783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:27,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:27,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336962682] [2024-06-03 22:26:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:27,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:27,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:26:27,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 105 transitions, 949 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:27,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:27,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:26:27,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:28,502 INFO L124 PetriNetUnfolderBase]: 1502/2387 cut-off events. [2024-06-03 22:26:28,502 INFO L125 PetriNetUnfolderBase]: For 36384/36384 co-relation queries the response was YES. [2024-06-03 22:26:28,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12773 conditions, 2387 events. 1502/2387 cut-off events. For 36384/36384 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12329 event pairs, 380 based on Foata normal form. 16/2402 useless extension candidates. Maximal degree in co-relation 12726. Up to 2101 conditions per place. [2024-06-03 22:26:28,518 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 104 selfloop transitions, 20 changer transitions 0/131 dead transitions. [2024-06-03 22:26:28,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 131 transitions, 1301 flow [2024-06-03 22:26:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:26:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:26:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 22:26:28,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-03 22:26:28,521 INFO L175 Difference]: Start difference. First operand has 98 places, 105 transitions, 949 flow. Second operand 7 states and 135 transitions. [2024-06-03 22:26:28,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 131 transitions, 1301 flow [2024-06-03 22:26:28,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 131 transitions, 1219 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 22:26:28,551 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 939 flow [2024-06-03 22:26:28,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=939, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2024-06-03 22:26:28,551 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-06-03 22:26:28,551 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 939 flow [2024-06-03 22:26:28,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:28,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:28,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:28,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:26:28,552 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:26:28,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -425187852, now seen corresponding path program 4 times [2024-06-03 22:26:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589918857] [2024-06-03 22:26:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:38,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:38,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589918857] [2024-06-03 22:26:38,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589918857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:38,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:38,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297563605] [2024-06-03 22:26:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:38,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:38,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:39,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:26:39,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 939 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:39,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:39,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:26:39,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:40,229 INFO L124 PetriNetUnfolderBase]: 1548/2465 cut-off events. [2024-06-03 22:26:40,229 INFO L125 PetriNetUnfolderBase]: For 41472/41472 co-relation queries the response was YES. [2024-06-03 22:26:40,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13078 conditions, 2465 events. 1548/2465 cut-off events. For 41472/41472 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12827 event pairs, 406 based on Foata normal form. 24/2488 useless extension candidates. Maximal degree in co-relation 13030. Up to 2046 conditions per place. [2024-06-03 22:26:40,242 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 89 selfloop transitions, 43 changer transitions 0/139 dead transitions. [2024-06-03 22:26:40,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 1411 flow [2024-06-03 22:26:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:26:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:26:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-03 22:26:40,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-03 22:26:40,244 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 939 flow. Second operand 8 states and 159 transitions. [2024-06-03 22:26:40,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 1411 flow [2024-06-03 22:26:40,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 1357 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:26:40,271 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 1019 flow [2024-06-03 22:26:40,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1019, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2024-06-03 22:26:40,271 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2024-06-03 22:26:40,272 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 1019 flow [2024-06-03 22:26:40,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:40,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:40,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:40,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:26:40,272 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-03 22:26:40,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -424980090, now seen corresponding path program 1 times [2024-06-03 22:26:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:40,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308306914] [2024-06-03 22:26:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:51,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:51,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308306914] [2024-06-03 22:26:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308306914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:51,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121538396] [2024-06-03 22:26:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:51,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:52,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:26:52,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 1019 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:52,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:52,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:26:52,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:53,342 INFO L124 PetriNetUnfolderBase]: 1670/2597 cut-off events. [2024-06-03 22:26:53,343 INFO L125 PetriNetUnfolderBase]: For 40788/40788 co-relation queries the response was YES. [2024-06-03 22:26:53,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13836 conditions, 2597 events. 1670/2597 cut-off events. For 40788/40788 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13147 event pairs, 440 based on Foata normal form. 2/2598 useless extension candidates. Maximal degree in co-relation 13787. Up to 2364 conditions per place. [2024-06-03 22:26:53,356 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 103 selfloop transitions, 42 changer transitions 0/149 dead transitions. [2024-06-03 22:26:53,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 149 transitions, 1495 flow [2024-06-03 22:26:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:26:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:26:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-03 22:26:53,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44173441734417346 [2024-06-03 22:26:53,358 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 1019 flow. Second operand 9 states and 163 transitions. [2024-06-03 22:26:53,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 149 transitions, 1495 flow [2024-06-03 22:26:53,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 149 transitions, 1374 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 22:26:53,389 INFO L231 Difference]: Finished difference. Result has 107 places, 119 transitions, 1110 flow [2024-06-03 22:26:53,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1110, PETRI_PLACES=107, PETRI_TRANSITIONS=119} [2024-06-03 22:26:53,389 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-03 22:26:53,389 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 119 transitions, 1110 flow [2024-06-03 22:26:53,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:53,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:53,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:53,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:26:53,390 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-03 22:26:53,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash -425181900, now seen corresponding path program 2 times [2024-06-03 22:26:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237869341] [2024-06-03 22:26:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:53,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237869341] [2024-06-03 22:27:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237869341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:27:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797444093] [2024-06-03 22:27:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:06,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:27:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:27:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:27:06,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:27:06,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 119 transitions, 1110 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:06,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:06,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:27:06,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:08,279 INFO L124 PetriNetUnfolderBase]: 1665/2590 cut-off events. [2024-06-03 22:27:08,279 INFO L125 PetriNetUnfolderBase]: For 41932/41932 co-relation queries the response was YES. [2024-06-03 22:27:08,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13830 conditions, 2590 events. 1665/2590 cut-off events. For 41932/41932 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13125 event pairs, 445 based on Foata normal form. 2/2591 useless extension candidates. Maximal degree in co-relation 13779. Up to 2357 conditions per place. [2024-06-03 22:27:08,294 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 103 selfloop transitions, 41 changer transitions 0/148 dead transitions. [2024-06-03 22:27:08,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 1482 flow [2024-06-03 22:27:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-03 22:27:08,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44173441734417346 [2024-06-03 22:27:08,295 INFO L175 Difference]: Start difference. First operand has 107 places, 119 transitions, 1110 flow. Second operand 9 states and 163 transitions. [2024-06-03 22:27:08,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 1482 flow [2024-06-03 22:27:08,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 148 transitions, 1425 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 22:27:08,327 INFO L231 Difference]: Finished difference. Result has 113 places, 119 transitions, 1143 flow [2024-06-03 22:27:08,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1143, PETRI_PLACES=113, PETRI_TRANSITIONS=119} [2024-06-03 22:27:08,327 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-03 22:27:08,327 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 119 transitions, 1143 flow [2024-06-03 22:27:08,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:08,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:08,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:08,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:27:08,328 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:27:08,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1873220282, now seen corresponding path program 1 times [2024-06-03 22:27:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:08,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592217304] [2024-06-03 22:27:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592217304] [2024-06-03 22:27:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592217304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:27:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461691547] [2024-06-03 22:27:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:21,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:27:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:27:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:27:21,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:27:21,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 119 transitions, 1143 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:21,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:21,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:27:21,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:22,334 INFO L124 PetriNetUnfolderBase]: 1675/2605 cut-off events. [2024-06-03 22:27:22,335 INFO L125 PetriNetUnfolderBase]: For 44327/44327 co-relation queries the response was YES. [2024-06-03 22:27:22,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14048 conditions, 2605 events. 1675/2605 cut-off events. For 44327/44327 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13090 event pairs, 417 based on Foata normal form. 2/2607 useless extension candidates. Maximal degree in co-relation 13995. Up to 2501 conditions per place. [2024-06-03 22:27:22,348 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 121 selfloop transitions, 23 changer transitions 0/148 dead transitions. [2024-06-03 22:27:22,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 148 transitions, 1591 flow [2024-06-03 22:27:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:27:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:27:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 22:27:22,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-03 22:27:22,349 INFO L175 Difference]: Start difference. First operand has 113 places, 119 transitions, 1143 flow. Second operand 7 states and 127 transitions. [2024-06-03 22:27:22,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 148 transitions, 1591 flow [2024-06-03 22:27:22,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 1422 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:27:22,381 INFO L231 Difference]: Finished difference. Result has 112 places, 127 transitions, 1108 flow [2024-06-03 22:27:22,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1108, PETRI_PLACES=112, PETRI_TRANSITIONS=127} [2024-06-03 22:27:22,381 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2024-06-03 22:27:22,381 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 127 transitions, 1108 flow [2024-06-03 22:27:22,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:22,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:22,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:22,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:27:22,382 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-03 22:27:22,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1873070552, now seen corresponding path program 2 times [2024-06-03 22:27:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080903117] [2024-06-03 22:27:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:33,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:33,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080903117] [2024-06-03 22:27:33,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080903117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:33,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:33,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:27:33,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139532353] [2024-06-03 22:27:33,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:33,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:27:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:27:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:27:33,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:27:33,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 127 transitions, 1108 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:33,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:33,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:27:33,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:34,234 INFO L124 PetriNetUnfolderBase]: 1685/2619 cut-off events. [2024-06-03 22:27:34,234 INFO L125 PetriNetUnfolderBase]: For 48332/48332 co-relation queries the response was YES. [2024-06-03 22:27:34,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14241 conditions, 2619 events. 1685/2619 cut-off events. For 48332/48332 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13181 event pairs, 425 based on Foata normal form. 2/2621 useless extension candidates. Maximal degree in co-relation 14188. Up to 2537 conditions per place. [2024-06-03 22:27:34,249 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 124 selfloop transitions, 19 changer transitions 0/147 dead transitions. [2024-06-03 22:27:34,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 147 transitions, 1461 flow [2024-06-03 22:27:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:27:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:27:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 22:27:34,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-03 22:27:34,250 INFO L175 Difference]: Start difference. First operand has 112 places, 127 transitions, 1108 flow. Second operand 7 states and 122 transitions. [2024-06-03 22:27:34,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 147 transitions, 1461 flow [2024-06-03 22:27:34,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 147 transitions, 1423 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-03 22:27:34,290 INFO L231 Difference]: Finished difference. Result has 116 places, 130 transitions, 1147 flow [2024-06-03 22:27:34,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1147, PETRI_PLACES=116, PETRI_TRANSITIONS=130} [2024-06-03 22:27:34,290 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2024-06-03 22:27:34,290 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 130 transitions, 1147 flow [2024-06-03 22:27:34,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:34,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:34,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:34,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:27:34,291 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-03 22:27:34,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash 231045078, now seen corresponding path program 3 times [2024-06-03 22:27:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:34,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155819451] [2024-06-03 22:27:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:34,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155819451] [2024-06-03 22:27:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155819451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:44,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:27:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082780144] [2024-06-03 22:27:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:44,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:27:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:44,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:27:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:27:44,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:27:44,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 130 transitions, 1147 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:44,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:44,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:27:44,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:45,555 INFO L124 PetriNetUnfolderBase]: 1679/2611 cut-off events. [2024-06-03 22:27:45,555 INFO L125 PetriNetUnfolderBase]: For 50757/50757 co-relation queries the response was YES. [2024-06-03 22:27:45,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14342 conditions, 2611 events. 1679/2611 cut-off events. For 50757/50757 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13136 event pairs, 425 based on Foata normal form. 2/2613 useless extension candidates. Maximal degree in co-relation 14287. Up to 2544 conditions per place. [2024-06-03 22:27:45,572 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 126 selfloop transitions, 14 changer transitions 0/144 dead transitions. [2024-06-03 22:27:45,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 144 transitions, 1466 flow [2024-06-03 22:27:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:27:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:27:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 22:27:45,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-03 22:27:45,573 INFO L175 Difference]: Start difference. First operand has 116 places, 130 transitions, 1147 flow. Second operand 7 states and 116 transitions. [2024-06-03 22:27:45,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 144 transitions, 1466 flow [2024-06-03 22:27:45,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 144 transitions, 1416 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:27:45,616 INFO L231 Difference]: Finished difference. Result has 118 places, 131 transitions, 1142 flow [2024-06-03 22:27:45,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1142, PETRI_PLACES=118, PETRI_TRANSITIONS=131} [2024-06-03 22:27:45,617 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-03 22:27:45,617 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 131 transitions, 1142 flow [2024-06-03 22:27:45,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:45,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:45,617 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-03 22:27:45,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:27:45,617 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:27:45,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:45,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1641333711, now seen corresponding path program 1 times [2024-06-03 22:27:45,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:45,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317571421] [2024-06-03 22:27:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:45,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317571421] [2024-06-03 22:27:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317571421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:55,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565639343] [2024-06-03 22:27:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:55,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:55,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:55,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:55,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:27:55,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 131 transitions, 1142 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:55,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:55,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:27:55,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:56,731 INFO L124 PetriNetUnfolderBase]: 1737/2718 cut-off events. [2024-06-03 22:27:56,731 INFO L125 PetriNetUnfolderBase]: For 58378/58378 co-relation queries the response was YES. [2024-06-03 22:27:56,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14962 conditions, 2718 events. 1737/2718 cut-off events. For 58378/58378 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13886 event pairs, 417 based on Foata normal form. 16/2733 useless extension candidates. Maximal degree in co-relation 14906. Up to 2240 conditions per place. [2024-06-03 22:27:56,745 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 120 selfloop transitions, 43 changer transitions 0/167 dead transitions. [2024-06-03 22:27:56,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 167 transitions, 1622 flow [2024-06-03 22:27:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-03 22:27:56,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-03 22:27:56,747 INFO L175 Difference]: Start difference. First operand has 118 places, 131 transitions, 1142 flow. Second operand 9 states and 169 transitions. [2024-06-03 22:27:56,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 167 transitions, 1622 flow [2024-06-03 22:27:56,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 167 transitions, 1590 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:27:56,791 INFO L231 Difference]: Finished difference. Result has 122 places, 132 transitions, 1237 flow [2024-06-03 22:27:56,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1237, PETRI_PLACES=122, PETRI_TRANSITIONS=132} [2024-06-03 22:27:56,792 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2024-06-03 22:27:56,792 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 132 transitions, 1237 flow [2024-06-03 22:27:56,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:56,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:56,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:56,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:27:56,792 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-03 22:27:56,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1985336571, now seen corresponding path program 1 times [2024-06-03 22:27:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256382541] [2024-06-03 22:27:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256382541] [2024-06-03 22:28:05,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256382541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:05,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:05,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:28:05,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573382420] [2024-06-03 22:28:05,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:05,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:28:05,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:05,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:28:05,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:28:06,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:28:06,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 132 transitions, 1237 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:06,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:06,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:28:06,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:07,123 INFO L124 PetriNetUnfolderBase]: 1811/2827 cut-off events. [2024-06-03 22:28:07,123 INFO L125 PetriNetUnfolderBase]: For 62264/62264 co-relation queries the response was YES. [2024-06-03 22:28:07,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16065 conditions, 2827 events. 1811/2827 cut-off events. For 62264/62264 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14496 event pairs, 449 based on Foata normal form. 4/2830 useless extension candidates. Maximal degree in co-relation 16008. Up to 2620 conditions per place. [2024-06-03 22:28:07,140 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 121 selfloop transitions, 36 changer transitions 0/161 dead transitions. [2024-06-03 22:28:07,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 161 transitions, 1786 flow [2024-06-03 22:28:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:28:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:28:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 22:28:07,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-03 22:28:07,142 INFO L175 Difference]: Start difference. First operand has 122 places, 132 transitions, 1237 flow. Second operand 7 states and 129 transitions. [2024-06-03 22:28:07,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 161 transitions, 1786 flow [2024-06-03 22:28:07,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 161 transitions, 1685 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:28:07,200 INFO L231 Difference]: Finished difference. Result has 123 places, 141 transitions, 1362 flow [2024-06-03 22:28:07,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1362, PETRI_PLACES=123, PETRI_TRANSITIONS=141} [2024-06-03 22:28:07,201 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places. [2024-06-03 22:28:07,201 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 141 transitions, 1362 flow [2024-06-03 22:28:07,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:07,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:07,201 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-03 22:28:07,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:28:07,201 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:28:07,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1172335963, now seen corresponding path program 2 times [2024-06-03 22:28:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:07,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600175896] [2024-06-03 22:28:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:07,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600175896] [2024-06-03 22:28:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600175896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:28:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620048490] [2024-06-03 22:28:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:28:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:28:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:28:16,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:28:16,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 141 transitions, 1362 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:16,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:16,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:28:16,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:17,249 INFO L124 PetriNetUnfolderBase]: 1799/2811 cut-off events. [2024-06-03 22:28:17,249 INFO L125 PetriNetUnfolderBase]: For 64825/64825 co-relation queries the response was YES. [2024-06-03 22:28:17,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16186 conditions, 2811 events. 1799/2811 cut-off events. For 64825/64825 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14430 event pairs, 451 based on Foata normal form. 4/2814 useless extension candidates. Maximal degree in co-relation 16127. Up to 2672 conditions per place. [2024-06-03 22:28:17,266 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 129 selfloop transitions, 21 changer transitions 0/154 dead transitions. [2024-06-03 22:28:17,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 154 transitions, 1708 flow [2024-06-03 22:28:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:28:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:28:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 22:28:17,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:28:17,268 INFO L175 Difference]: Start difference. First operand has 123 places, 141 transitions, 1362 flow. Second operand 6 states and 108 transitions. [2024-06-03 22:28:17,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 154 transitions, 1708 flow [2024-06-03 22:28:17,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 154 transitions, 1645 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-03 22:28:17,325 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 1351 flow [2024-06-03 22:28:17,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1351, PETRI_PLACES=125, PETRI_TRANSITIONS=141} [2024-06-03 22:28:17,326 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-03 22:28:17,326 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 1351 flow [2024-06-03 22:28:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:17,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:17,327 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-03 22:28:17,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:28:17,327 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-03 22:28:17,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -289240857, now seen corresponding path program 2 times [2024-06-03 22:28:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018923282] [2024-06-03 22:28:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:26,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:26,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018923282] [2024-06-03 22:28:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018923282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028789662] [2024-06-03 22:28:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:26,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:26,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:28:26,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 1351 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:26,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:26,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:28:26,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:27,929 INFO L124 PetriNetUnfolderBase]: 1901/2985 cut-off events. [2024-06-03 22:28:27,929 INFO L125 PetriNetUnfolderBase]: For 72462/72462 co-relation queries the response was YES. [2024-06-03 22:28:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17348 conditions, 2985 events. 1901/2985 cut-off events. For 72462/72462 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15598 event pairs, 440 based on Foata normal form. 12/2996 useless extension candidates. Maximal degree in co-relation 17288. Up to 2126 conditions per place. [2024-06-03 22:28:27,948 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 120 selfloop transitions, 64 changer transitions 0/188 dead transitions. [2024-06-03 22:28:27,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 188 transitions, 2047 flow [2024-06-03 22:28:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-03 22:28:27,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585365853658537 [2024-06-03 22:28:27,951 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 1351 flow. Second operand 10 states and 188 transitions. [2024-06-03 22:28:27,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 188 transitions, 2047 flow [2024-06-03 22:28:28,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 188 transitions, 2007 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:28:28,031 INFO L231 Difference]: Finished difference. Result has 132 places, 144 transitions, 1536 flow [2024-06-03 22:28:28,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1536, PETRI_PLACES=132, PETRI_TRANSITIONS=144} [2024-06-03 22:28:28,032 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2024-06-03 22:28:28,032 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 144 transitions, 1536 flow [2024-06-03 22:28:28,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:28,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:28,033 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-03 22:28:28,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:28:28,033 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:28:28,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1958388665, now seen corresponding path program 3 times [2024-06-03 22:28:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257393812] [2024-06-03 22:28:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:38,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:38,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257393812] [2024-06-03 22:28:38,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257393812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:38,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:38,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:38,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160960436] [2024-06-03 22:28:38,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:38,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:38,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:38,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:38,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:28:38,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 1536 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:38,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:38,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:28:38,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:39,536 INFO L124 PetriNetUnfolderBase]: 1976/3110 cut-off events. [2024-06-03 22:28:39,536 INFO L125 PetriNetUnfolderBase]: For 81552/81552 co-relation queries the response was YES. [2024-06-03 22:28:39,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18583 conditions, 3110 events. 1976/3110 cut-off events. For 81552/81552 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16623 event pairs, 511 based on Foata normal form. 16/3125 useless extension candidates. Maximal degree in co-relation 18521. Up to 2670 conditions per place. [2024-06-03 22:28:39,556 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 119 selfloop transitions, 57 changer transitions 0/180 dead transitions. [2024-06-03 22:28:39,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 180 transitions, 2053 flow [2024-06-03 22:28:39,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:28:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:28:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-03 22:28:39,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-03 22:28:39,558 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 1536 flow. Second operand 9 states and 169 transitions. [2024-06-03 22:28:39,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 180 transitions, 2053 flow [2024-06-03 22:28:39,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 180 transitions, 1978 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 22:28:39,652 INFO L231 Difference]: Finished difference. Result has 136 places, 147 transitions, 1644 flow [2024-06-03 22:28:39,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1644, PETRI_PLACES=136, PETRI_TRANSITIONS=147} [2024-06-03 22:28:39,653 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-03 22:28:39,653 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 147 transitions, 1644 flow [2024-06-03 22:28:39,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:39,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:39,653 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-03 22:28:39,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:28:39,653 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-03 22:28:39,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:39,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1952132555, now seen corresponding path program 4 times [2024-06-03 22:28:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:39,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418241226] [2024-06-03 22:28:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418241226] [2024-06-03 22:28:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418241226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957484719] [2024-06-03 22:28:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:50,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:50,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 22:28:50,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 147 transitions, 1644 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:50,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:50,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 22:28:50,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:52,101 INFO L124 PetriNetUnfolderBase]: 1965/3093 cut-off events. [2024-06-03 22:28:52,101 INFO L125 PetriNetUnfolderBase]: For 80788/80788 co-relation queries the response was YES. [2024-06-03 22:28:52,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18338 conditions, 3093 events. 1965/3093 cut-off events. For 80788/80788 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16487 event pairs, 495 based on Foata normal form. 16/3108 useless extension candidates. Maximal degree in co-relation 18274. Up to 2712 conditions per place. [2024-06-03 22:28:52,123 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 132 selfloop transitions, 50 changer transitions 0/186 dead transitions. [2024-06-03 22:28:52,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 186 transitions, 2154 flow [2024-06-03 22:28:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-03 22:28:52,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682926829268293 [2024-06-03 22:28:52,125 INFO L175 Difference]: Start difference. First operand has 136 places, 147 transitions, 1644 flow. Second operand 10 states and 192 transitions. [2024-06-03 22:28:52,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 186 transitions, 2154 flow [2024-06-03 22:28:52,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 186 transitions, 2028 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 22:28:52,213 INFO L231 Difference]: Finished difference. Result has 140 places, 149 transitions, 1656 flow [2024-06-03 22:28:52,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1656, PETRI_PLACES=140, PETRI_TRANSITIONS=149} [2024-06-03 22:28:52,213 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2024-06-03 22:28:52,214 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 149 transitions, 1656 flow [2024-06-03 22:28:52,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:52,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:52,214 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-03 22:28:52,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:28:52,214 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:28:52,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:52,215 INFO L85 PathProgramCache]: Analyzing trace with hash -898141833, now seen corresponding path program 1 times [2024-06-03 22:28:52,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:52,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996353692] [2024-06-03 22:28:52,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:52,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:02,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:02,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996353692] [2024-06-03 22:29:02,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996353692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:02,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:02,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:29:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295596013] [2024-06-03 22:29:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:02,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:29:02,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:29:02,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:29:02,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:29:02,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 149 transitions, 1656 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:02,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:02,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:29:02,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:03,838 INFO L124 PetriNetUnfolderBase]: 2009/3161 cut-off events. [2024-06-03 22:29:03,838 INFO L125 PetriNetUnfolderBase]: For 83543/83543 co-relation queries the response was YES. [2024-06-03 22:29:03,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18623 conditions, 3161 events. 2009/3161 cut-off events. For 83543/83543 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16871 event pairs, 499 based on Foata normal form. 12/3172 useless extension candidates. Maximal degree in co-relation 18558. Up to 2992 conditions per place. [2024-06-03 22:29:03,861 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 145 selfloop transitions, 18 changer transitions 0/167 dead transitions. [2024-06-03 22:29:03,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 167 transitions, 2074 flow [2024-06-03 22:29:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:29:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:29:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-03 22:29:03,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-03 22:29:03,862 INFO L175 Difference]: Start difference. First operand has 140 places, 149 transitions, 1656 flow. Second operand 6 states and 110 transitions. [2024-06-03 22:29:03,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 167 transitions, 2074 flow [2024-06-03 22:29:03,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 167 transitions, 1970 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:29:03,938 INFO L231 Difference]: Finished difference. Result has 138 places, 150 transitions, 1612 flow [2024-06-03 22:29:03,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1612, PETRI_PLACES=138, PETRI_TRANSITIONS=150} [2024-06-03 22:29:03,939 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-03 22:29:03,939 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 150 transitions, 1612 flow [2024-06-03 22:29:03,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:03,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:03,939 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-03 22:29:03,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:29:03,939 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:29:03,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1763254405, now seen corresponding path program 3 times [2024-06-03 22:29:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:03,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943904815] [2024-06-03 22:29:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943904815] [2024-06-03 22:29:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943904815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:29:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001289668] [2024-06-03 22:29:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:13,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:29:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:29:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:29:13,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:29:13,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 150 transitions, 1612 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:13,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:13,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:29:13,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:14,857 INFO L124 PetriNetUnfolderBase]: 2029/3193 cut-off events. [2024-06-03 22:29:14,857 INFO L125 PetriNetUnfolderBase]: For 83724/83724 co-relation queries the response was YES. [2024-06-03 22:29:14,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18785 conditions, 3193 events. 2029/3193 cut-off events. For 83724/83724 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17193 event pairs, 510 based on Foata normal form. 4/3196 useless extension candidates. Maximal degree in co-relation 18719. Up to 3030 conditions per place. [2024-06-03 22:29:14,877 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 145 selfloop transitions, 24 changer transitions 0/173 dead transitions. [2024-06-03 22:29:14,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 173 transitions, 2062 flow [2024-06-03 22:29:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:29:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:29:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-03 22:29:14,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:29:14,878 INFO L175 Difference]: Start difference. First operand has 138 places, 150 transitions, 1612 flow. Second operand 7 states and 126 transitions. [2024-06-03 22:29:14,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 173 transitions, 2062 flow [2024-06-03 22:29:14,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 173 transitions, 2030 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-03 22:29:14,967 INFO L231 Difference]: Finished difference. Result has 141 places, 153 transitions, 1680 flow [2024-06-03 22:29:14,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1680, PETRI_PLACES=141, PETRI_TRANSITIONS=153} [2024-06-03 22:29:14,968 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2024-06-03 22:29:14,968 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 153 transitions, 1680 flow [2024-06-03 22:29:14,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:14,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:14,968 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-03 22:29:14,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:29:14,968 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:29:14,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash -647908987, now seen corresponding path program 4 times [2024-06-03 22:29:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465822335] [2024-06-03 22:29:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465822335] [2024-06-03 22:29:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465822335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:29:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477854634] [2024-06-03 22:29:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:24,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:29:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:29:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:29:24,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:29:24,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 153 transitions, 1680 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:24,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:24,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:29:24,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:25,565 INFO L124 PetriNetUnfolderBase]: 2049/3225 cut-off events. [2024-06-03 22:29:25,565 INFO L125 PetriNetUnfolderBase]: For 88724/88724 co-relation queries the response was YES. [2024-06-03 22:29:25,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19412 conditions, 3225 events. 2049/3225 cut-off events. For 88724/88724 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17394 event pairs, 494 based on Foata normal form. 4/3228 useless extension candidates. Maximal degree in co-relation 19345. Up to 2920 conditions per place. [2024-06-03 22:29:25,588 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 132 selfloop transitions, 45 changer transitions 0/181 dead transitions. [2024-06-03 22:29:25,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 181 transitions, 2274 flow [2024-06-03 22:29:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:29:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:29:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 22:29:25,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-03 22:29:25,589 INFO L175 Difference]: Start difference. First operand has 141 places, 153 transitions, 1680 flow. Second operand 7 states and 130 transitions. [2024-06-03 22:29:25,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 181 transitions, 2274 flow [2024-06-03 22:29:25,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 181 transitions, 2152 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 22:29:25,658 INFO L231 Difference]: Finished difference. Result has 142 places, 159 transitions, 1752 flow [2024-06-03 22:29:25,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1752, PETRI_PLACES=142, PETRI_TRANSITIONS=159} [2024-06-03 22:29:25,658 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2024-06-03 22:29:25,658 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 159 transitions, 1752 flow [2024-06-03 22:29:25,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:25,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:25,659 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-03 22:29:25,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:29:25,659 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-03 22:29:25,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1427543867, now seen corresponding path program 5 times [2024-06-03 22:29:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:25,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074295261] [2024-06-03 22:29:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074295261] [2024-06-03 22:29:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074295261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:29:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152051165] [2024-06-03 22:29:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:35,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:29:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:29:35,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:29:35,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:29:35,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 159 transitions, 1752 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:35,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:35,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:29:35,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:36,233 INFO L124 PetriNetUnfolderBase]: 2069/3255 cut-off events. [2024-06-03 22:29:36,234 INFO L125 PetriNetUnfolderBase]: For 94828/94828 co-relation queries the response was YES. [2024-06-03 22:29:36,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19942 conditions, 3255 events. 2069/3255 cut-off events. For 94828/94828 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17557 event pairs, 496 based on Foata normal form. 4/3258 useless extension candidates. Maximal degree in co-relation 19875. Up to 3046 conditions per place. [2024-06-03 22:29:36,259 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 146 selfloop transitions, 29 changer transitions 0/179 dead transitions. [2024-06-03 22:29:36,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 179 transitions, 2284 flow [2024-06-03 22:29:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:29:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:29:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:29:36,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:29:36,260 INFO L175 Difference]: Start difference. First operand has 142 places, 159 transitions, 1752 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:29:36,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 179 transitions, 2284 flow [2024-06-03 22:29:36,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 179 transitions, 2204 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-03 22:29:36,356 INFO L231 Difference]: Finished difference. Result has 145 places, 162 transitions, 1790 flow [2024-06-03 22:29:36,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1790, PETRI_PLACES=145, PETRI_TRANSITIONS=162} [2024-06-03 22:29:36,356 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2024-06-03 22:29:36,357 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 162 transitions, 1790 flow [2024-06-03 22:29:36,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:36,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:36,357 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-03 22:29:36,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:29:36,357 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-03 22:29:36,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1422994089, now seen corresponding path program 6 times [2024-06-03 22:29:36,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:36,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937870495] [2024-06-03 22:29:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:36,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937870495] [2024-06-03 22:29:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937870495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:29:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620959705] [2024-06-03 22:29:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:45,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:29:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:29:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:29:45,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:29:45,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 162 transitions, 1790 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:45,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:45,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:29:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:46,937 INFO L124 PetriNetUnfolderBase]: 2057/3239 cut-off events. [2024-06-03 22:29:46,937 INFO L125 PetriNetUnfolderBase]: For 90866/90866 co-relation queries the response was YES. [2024-06-03 22:29:46,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19460 conditions, 3239 events. 2057/3239 cut-off events. For 90866/90866 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17488 event pairs, 492 based on Foata normal form. 4/3242 useless extension candidates. Maximal degree in co-relation 19392. Up to 3082 conditions per place. [2024-06-03 22:29:46,957 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 153 selfloop transitions, 21 changer transitions 0/178 dead transitions. [2024-06-03 22:29:46,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 178 transitions, 2198 flow [2024-06-03 22:29:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:29:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:29:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 22:29:46,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250871080139373 [2024-06-03 22:29:46,959 INFO L175 Difference]: Start difference. First operand has 145 places, 162 transitions, 1790 flow. Second operand 7 states and 122 transitions. [2024-06-03 22:29:46,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 178 transitions, 2198 flow [2024-06-03 22:29:47,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 178 transitions, 2064 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-03 22:29:47,036 INFO L231 Difference]: Finished difference. Result has 147 places, 162 transitions, 1704 flow [2024-06-03 22:29:47,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1704, PETRI_PLACES=147, PETRI_TRANSITIONS=162} [2024-06-03 22:29:47,036 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-03 22:29:47,036 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 162 transitions, 1704 flow [2024-06-03 22:29:47,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:47,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:47,037 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-03 22:29:47,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:29:47,037 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:29:47,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash -425309209, now seen corresponding path program 2 times [2024-06-03 22:29:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:47,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499182328] [2024-06-03 22:29:47,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499182328] [2024-06-03 22:29:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499182328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:58,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:58,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:29:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032804077] [2024-06-03 22:29:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:58,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:29:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:29:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:29:58,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:29:58,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 162 transitions, 1704 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:58,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:58,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:29:58,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:59,560 INFO L124 PetriNetUnfolderBase]: 2101/3311 cut-off events. [2024-06-03 22:29:59,561 INFO L125 PetriNetUnfolderBase]: For 99995/99995 co-relation queries the response was YES. [2024-06-03 22:29:59,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19770 conditions, 3311 events. 2101/3311 cut-off events. For 99995/99995 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18014 event pairs, 498 based on Foata normal form. 12/3322 useless extension candidates. Maximal degree in co-relation 19701. Up to 3118 conditions per place. [2024-06-03 22:29:59,584 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 160 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2024-06-03 22:29:59,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 183 transitions, 2174 flow [2024-06-03 22:29:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:29:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:29:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:29:59,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:29:59,585 INFO L175 Difference]: Start difference. First operand has 147 places, 162 transitions, 1704 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:29:59,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 183 transitions, 2174 flow [2024-06-03 22:29:59,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 2088 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:29:59,676 INFO L231 Difference]: Finished difference. Result has 147 places, 163 transitions, 1679 flow [2024-06-03 22:29:59,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1679, PETRI_PLACES=147, PETRI_TRANSITIONS=163} [2024-06-03 22:29:59,676 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-03 22:29:59,677 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 163 transitions, 1679 flow [2024-06-03 22:29:59,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:59,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:59,677 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-03 22:29:59,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:29:59,677 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:29:59,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash -425295259, now seen corresponding path program 3 times [2024-06-03 22:29:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:59,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459562101] [2024-06-03 22:29:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459562101] [2024-06-03 22:30:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459562101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:10,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:30:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173391098] [2024-06-03 22:30:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:10,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:30:10,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:10,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:30:10,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:30:10,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:30:10,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 163 transitions, 1679 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:10,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:10,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:30:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:12,180 INFO L124 PetriNetUnfolderBase]: 2103/3319 cut-off events. [2024-06-03 22:30:12,180 INFO L125 PetriNetUnfolderBase]: For 99973/99973 co-relation queries the response was YES. [2024-06-03 22:30:12,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19693 conditions, 3319 events. 2103/3319 cut-off events. For 99973/99973 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18009 event pairs, 494 based on Foata normal form. 8/3326 useless extension candidates. Maximal degree in co-relation 19624. Up to 3034 conditions per place. [2024-06-03 22:30:12,206 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 160 selfloop transitions, 22 changer transitions 0/186 dead transitions. [2024-06-03 22:30:12,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 186 transitions, 2177 flow [2024-06-03 22:30:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:30:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:30:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 22:30:12,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 22:30:12,207 INFO L175 Difference]: Start difference. First operand has 147 places, 163 transitions, 1679 flow. Second operand 7 states and 125 transitions. [2024-06-03 22:30:12,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 186 transitions, 2177 flow [2024-06-03 22:30:12,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 186 transitions, 2136 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:30:12,310 INFO L231 Difference]: Finished difference. Result has 149 places, 164 transitions, 1706 flow [2024-06-03 22:30:12,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1706, PETRI_PLACES=149, PETRI_TRANSITIONS=164} [2024-06-03 22:30:12,310 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-03 22:30:12,310 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 164 transitions, 1706 flow [2024-06-03 22:30:12,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:12,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:12,311 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-03 22:30:12,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:30:12,311 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:30:12,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1758916451, now seen corresponding path program 1 times [2024-06-03 22:30:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10437547] [2024-06-03 22:30:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10437547] [2024-06-03 22:30:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10437547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:30:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338249324] [2024-06-03 22:30:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:25,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:30:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:30:25,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:30:25,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:30:25,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 164 transitions, 1706 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:25,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:25,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:30:25,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:27,079 INFO L124 PetriNetUnfolderBase]: 2133/3357 cut-off events. [2024-06-03 22:30:27,079 INFO L125 PetriNetUnfolderBase]: For 104523/104523 co-relation queries the response was YES. [2024-06-03 22:30:27,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20076 conditions, 3357 events. 2133/3357 cut-off events. For 104523/104523 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 18275 event pairs, 544 based on Foata normal form. 6/3362 useless extension candidates. Maximal degree in co-relation 20006. Up to 3090 conditions per place. [2024-06-03 22:30:27,109 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 147 selfloop transitions, 41 changer transitions 0/192 dead transitions. [2024-06-03 22:30:27,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 192 transitions, 2214 flow [2024-06-03 22:30:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:30:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:30:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-03 22:30:27,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-03 22:30:27,112 INFO L175 Difference]: Start difference. First operand has 149 places, 164 transitions, 1706 flow. Second operand 8 states and 146 transitions. [2024-06-03 22:30:27,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 192 transitions, 2214 flow [2024-06-03 22:30:27,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 192 transitions, 2164 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:30:27,279 INFO L231 Difference]: Finished difference. Result has 152 places, 169 transitions, 1819 flow [2024-06-03 22:30:27,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1819, PETRI_PLACES=152, PETRI_TRANSITIONS=169} [2024-06-03 22:30:27,280 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-03 22:30:27,280 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 169 transitions, 1819 flow [2024-06-03 22:30:27,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:27,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:27,281 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-03 22:30:27,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:30:27,281 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-03 22:30:27,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1759036421, now seen corresponding path program 2 times [2024-06-03 22:30:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150229712] [2024-06-03 22:30:27,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150229712] [2024-06-03 22:30:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150229712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:30:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123480641] [2024-06-03 22:30:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:39,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:30:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:30:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:30:39,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:30:39,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 169 transitions, 1819 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:39,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:39,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:30:39,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:40,494 INFO L124 PetriNetUnfolderBase]: 2169/3406 cut-off events. [2024-06-03 22:30:40,494 INFO L125 PetriNetUnfolderBase]: For 109754/109754 co-relation queries the response was YES. [2024-06-03 22:30:40,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21070 conditions, 3406 events. 2169/3406 cut-off events. For 109754/109754 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18486 event pairs, 503 based on Foata normal form. 4/3410 useless extension candidates. Maximal degree in co-relation 20999. Up to 3195 conditions per place. [2024-06-03 22:30:40,525 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 168 selfloop transitions, 38 changer transitions 0/210 dead transitions. [2024-06-03 22:30:40,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 210 transitions, 2647 flow [2024-06-03 22:30:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:30:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:30:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-03 22:30:40,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-03 22:30:40,529 INFO L175 Difference]: Start difference. First operand has 152 places, 169 transitions, 1819 flow. Second operand 8 states and 147 transitions. [2024-06-03 22:30:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 210 transitions, 2647 flow [2024-06-03 22:30:40,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 210 transitions, 2493 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-03 22:30:40,662 INFO L231 Difference]: Finished difference. Result has 156 places, 182 transitions, 1951 flow [2024-06-03 22:30:40,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1951, PETRI_PLACES=156, PETRI_TRANSITIONS=182} [2024-06-03 22:30:40,663 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-03 22:30:40,663 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 182 transitions, 1951 flow [2024-06-03 22:30:40,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:40,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:40,663 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-03 22:30:40,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:30:40,663 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-03 22:30:40,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1763684995, now seen corresponding path program 1 times [2024-06-03 22:30:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533914900] [2024-06-03 22:30:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:50,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533914900] [2024-06-03 22:30:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533914900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:30:50,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210615615] [2024-06-03 22:30:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:50,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:30:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:30:50,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:30:51,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:30:51,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 182 transitions, 1951 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:51,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:51,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:30:51,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:52,162 INFO L124 PetriNetUnfolderBase]: 2177/3418 cut-off events. [2024-06-03 22:30:52,162 INFO L125 PetriNetUnfolderBase]: For 114839/114839 co-relation queries the response was YES. [2024-06-03 22:30:52,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21494 conditions, 3418 events. 2177/3418 cut-off events. For 114839/114839 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18540 event pairs, 514 based on Foata normal form. 2/3420 useless extension candidates. Maximal degree in co-relation 21420. Up to 3313 conditions per place. [2024-06-03 22:30:52,186 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 179 selfloop transitions, 18 changer transitions 0/201 dead transitions. [2024-06-03 22:30:52,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 201 transitions, 2411 flow [2024-06-03 22:30:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:30:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:30:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-03 22:30:52,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-03 22:30:52,189 INFO L175 Difference]: Start difference. First operand has 156 places, 182 transitions, 1951 flow. Second operand 7 states and 121 transitions. [2024-06-03 22:30:52,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 201 transitions, 2411 flow [2024-06-03 22:30:52,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 201 transitions, 2357 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-03 22:30:52,318 INFO L231 Difference]: Finished difference. Result has 160 places, 184 transitions, 1968 flow [2024-06-03 22:30:52,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1968, PETRI_PLACES=160, PETRI_TRANSITIONS=184} [2024-06-03 22:30:52,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-03 22:30:52,319 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 184 transitions, 1968 flow [2024-06-03 22:30:52,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:52,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:52,319 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-03 22:30:52,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:30:52,319 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-03 22:30:52,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2064356275, now seen corresponding path program 3 times [2024-06-03 22:30:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614604663] [2024-06-03 22:30:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:05,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:05,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614604663] [2024-06-03 22:31:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614604663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:05,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:05,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:31:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170226316] [2024-06-03 22:31:05,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:05,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:31:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:05,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:31:05,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:31:05,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:05,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 184 transitions, 1968 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:05,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:05,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:05,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:06,381 INFO L124 PetriNetUnfolderBase]: 2187/3432 cut-off events. [2024-06-03 22:31:06,381 INFO L125 PetriNetUnfolderBase]: For 120206/120206 co-relation queries the response was YES. [2024-06-03 22:31:06,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21764 conditions, 3432 events. 2187/3432 cut-off events. For 120206/120206 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18651 event pairs, 507 based on Foata normal form. 2/3434 useless extension candidates. Maximal degree in co-relation 21688. Up to 3317 conditions per place. [2024-06-03 22:31:06,405 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 180 selfloop transitions, 22 changer transitions 0/206 dead transitions. [2024-06-03 22:31:06,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 206 transitions, 2456 flow [2024-06-03 22:31:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:31:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:31:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-03 22:31:06,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-03 22:31:06,406 INFO L175 Difference]: Start difference. First operand has 160 places, 184 transitions, 1968 flow. Second operand 8 states and 136 transitions. [2024-06-03 22:31:06,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 206 transitions, 2456 flow [2024-06-03 22:31:06,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 206 transitions, 2401 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 22:31:06,515 INFO L231 Difference]: Finished difference. Result has 163 places, 187 transitions, 2009 flow [2024-06-03 22:31:06,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2009, PETRI_PLACES=163, PETRI_TRANSITIONS=187} [2024-06-03 22:31:06,515 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2024-06-03 22:31:06,515 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 187 transitions, 2009 flow [2024-06-03 22:31:06,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:06,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:06,516 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-03 22:31:06,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:31:06,516 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-03 22:31:06,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -540718187, now seen corresponding path program 2 times [2024-06-03 22:31:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276410745] [2024-06-03 22:31:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276410745] [2024-06-03 22:31:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276410745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:31:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951278650] [2024-06-03 22:31:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:16,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:31:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:31:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:31:16,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:16,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 187 transitions, 2009 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:16,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:16,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:16,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:17,506 INFO L124 PetriNetUnfolderBase]: 2195/3446 cut-off events. [2024-06-03 22:31:17,506 INFO L125 PetriNetUnfolderBase]: For 125451/125451 co-relation queries the response was YES. [2024-06-03 22:31:17,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22063 conditions, 3446 events. 2195/3446 cut-off events. For 125451/125451 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18726 event pairs, 515 based on Foata normal form. 2/3448 useless extension candidates. Maximal degree in co-relation 21986. Up to 3354 conditions per place. [2024-06-03 22:31:17,532 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 185 selfloop transitions, 13 changer transitions 0/202 dead transitions. [2024-06-03 22:31:17,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 202 transitions, 2465 flow [2024-06-03 22:31:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-03 22:31:17,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40069686411149824 [2024-06-03 22:31:17,533 INFO L175 Difference]: Start difference. First operand has 163 places, 187 transitions, 2009 flow. Second operand 7 states and 115 transitions. [2024-06-03 22:31:17,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 202 transitions, 2465 flow [2024-06-03 22:31:17,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 202 transitions, 2397 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 22:31:17,668 INFO L231 Difference]: Finished difference. Result has 164 places, 189 transitions, 2006 flow [2024-06-03 22:31:17,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2006, PETRI_PLACES=164, PETRI_TRANSITIONS=189} [2024-06-03 22:31:17,668 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places. [2024-06-03 22:31:17,669 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 189 transitions, 2006 flow [2024-06-03 22:31:17,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:17,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:17,669 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-03 22:31:17,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:31:17,669 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-03 22:31:17,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1373214467, now seen corresponding path program 4 times [2024-06-03 22:31:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:17,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608164256] [2024-06-03 22:31:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:17,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:29,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:29,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608164256] [2024-06-03 22:31:29,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608164256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:29,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:31:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7043036] [2024-06-03 22:31:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:29,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:31:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:31:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:31:29,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:29,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 189 transitions, 2006 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:29,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:29,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:29,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:30,896 INFO L124 PetriNetUnfolderBase]: 2199/3452 cut-off events. [2024-06-03 22:31:30,896 INFO L125 PetriNetUnfolderBase]: For 131167/131167 co-relation queries the response was YES. [2024-06-03 22:31:30,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22176 conditions, 3452 events. 2199/3452 cut-off events. For 131167/131167 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 18768 event pairs, 515 based on Foata normal form. 4/3456 useless extension candidates. Maximal degree in co-relation 22098. Up to 3342 conditions per place. [2024-06-03 22:31:30,919 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 187 selfloop transitions, 17 changer transitions 0/208 dead transitions. [2024-06-03 22:31:30,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 208 transitions, 2503 flow [2024-06-03 22:31:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:31:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:31:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-03 22:31:30,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-03 22:31:30,920 INFO L175 Difference]: Start difference. First operand has 164 places, 189 transitions, 2006 flow. Second operand 8 states and 131 transitions. [2024-06-03 22:31:30,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 208 transitions, 2503 flow [2024-06-03 22:31:31,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 208 transitions, 2454 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 22:31:31,051 INFO L231 Difference]: Finished difference. Result has 167 places, 192 transitions, 2042 flow [2024-06-03 22:31:31,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2042, PETRI_PLACES=167, PETRI_TRANSITIONS=192} [2024-06-03 22:31:31,053 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-03 22:31:31,053 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 192 transitions, 2042 flow [2024-06-03 22:31:31,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:31,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:31,053 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-03 22:31:31,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:31:31,053 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-03 22:31:31,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash -411422077, now seen corresponding path program 3 times [2024-06-03 22:31:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834528434] [2024-06-03 22:31:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834528434] [2024-06-03 22:31:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834528434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:31:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107618598] [2024-06-03 22:31:40,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:40,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:31:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:40,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:31:40,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:31:41,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:41,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 192 transitions, 2042 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:41,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:41,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:41,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:42,140 INFO L124 PetriNetUnfolderBase]: 2194/3445 cut-off events. [2024-06-03 22:31:42,140 INFO L125 PetriNetUnfolderBase]: For 133404/133404 co-relation queries the response was YES. [2024-06-03 22:31:42,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22182 conditions, 3445 events. 2194/3445 cut-off events. For 133404/133404 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18663 event pairs, 504 based on Foata normal form. 2/3447 useless extension candidates. Maximal degree in co-relation 22103. Up to 3353 conditions per place. [2024-06-03 22:31:42,167 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 191 selfloop transitions, 12 changer transitions 0/207 dead transitions. [2024-06-03 22:31:42,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 207 transitions, 2512 flow [2024-06-03 22:31:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:31:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:31:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-03 22:31:42,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-03 22:31:42,168 INFO L175 Difference]: Start difference. First operand has 167 places, 192 transitions, 2042 flow. Second operand 7 states and 114 transitions. [2024-06-03 22:31:42,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 207 transitions, 2512 flow [2024-06-03 22:31:42,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 207 transitions, 2466 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:31:42,303 INFO L231 Difference]: Finished difference. Result has 168 places, 194 transitions, 2063 flow [2024-06-03 22:31:42,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2063, PETRI_PLACES=168, PETRI_TRANSITIONS=194} [2024-06-03 22:31:42,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places. [2024-06-03 22:31:42,303 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 194 transitions, 2063 flow [2024-06-03 22:31:42,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:42,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:42,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:42,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:31:42,304 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:31:42,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:42,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1192293065, now seen corresponding path program 1 times [2024-06-03 22:31:42,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:42,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712503206] [2024-06-03 22:31:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:42,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712503206] [2024-06-03 22:31:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712503206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:53,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771736491] [2024-06-03 22:31:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:53,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:53,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:31:53,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 194 transitions, 2063 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:53,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:53,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:31:53,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:55,144 INFO L124 PetriNetUnfolderBase]: 2252/3540 cut-off events. [2024-06-03 22:31:55,145 INFO L125 PetriNetUnfolderBase]: For 146061/146061 co-relation queries the response was YES. [2024-06-03 22:31:55,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22780 conditions, 3540 events. 2252/3540 cut-off events. For 146061/146061 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19401 event pairs, 553 based on Foata normal form. 12/3551 useless extension candidates. Maximal degree in co-relation 22700. Up to 3203 conditions per place. [2024-06-03 22:31:55,172 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 186 selfloop transitions, 40 changer transitions 0/230 dead transitions. [2024-06-03 22:31:55,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 230 transitions, 2664 flow [2024-06-03 22:31:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:31:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:31:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-03 22:31:55,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 22:31:55,175 INFO L175 Difference]: Start difference. First operand has 168 places, 194 transitions, 2063 flow. Second operand 9 states and 164 transitions. [2024-06-03 22:31:55,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 230 transitions, 2664 flow [2024-06-03 22:31:55,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 230 transitions, 2613 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 22:31:55,319 INFO L231 Difference]: Finished difference. Result has 173 places, 197 transitions, 2148 flow [2024-06-03 22:31:55,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2148, PETRI_PLACES=173, PETRI_TRANSITIONS=197} [2024-06-03 22:31:55,319 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places. [2024-06-03 22:31:55,319 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 197 transitions, 2148 flow [2024-06-03 22:31:55,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:55,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:55,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:55,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:31:55,320 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:31:55,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash -692646191, now seen corresponding path program 2 times [2024-06-03 22:31:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214838738] [2024-06-03 22:31:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:05,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214838738] [2024-06-03 22:32:05,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214838738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:05,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:05,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654697309] [2024-06-03 22:32:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:05,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:05,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:05,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:05,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:32:05,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 197 transitions, 2148 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:05,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:05,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:32:05,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:06,882 INFO L124 PetriNetUnfolderBase]: 2269/3569 cut-off events. [2024-06-03 22:32:06,882 INFO L125 PetriNetUnfolderBase]: For 147485/147485 co-relation queries the response was YES. [2024-06-03 22:32:06,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23229 conditions, 3569 events. 2269/3569 cut-off events. For 147485/147485 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19601 event pairs, 478 based on Foata normal form. 4/3572 useless extension candidates. Maximal degree in co-relation 23147. Up to 3048 conditions per place. [2024-06-03 22:32:06,911 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 178 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-03 22:32:06,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 235 transitions, 2870 flow [2024-06-03 22:32:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:32:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:32:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 22:32:06,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-03 22:32:06,914 INFO L175 Difference]: Start difference. First operand has 173 places, 197 transitions, 2148 flow. Second operand 8 states and 154 transitions. [2024-06-03 22:32:06,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 235 transitions, 2870 flow [2024-06-03 22:32:07,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 235 transitions, 2739 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-03 22:32:07,072 INFO L231 Difference]: Finished difference. Result has 176 places, 206 transitions, 2314 flow [2024-06-03 22:32:07,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2314, PETRI_PLACES=176, PETRI_TRANSITIONS=206} [2024-06-03 22:32:07,073 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2024-06-03 22:32:07,073 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 206 transitions, 2314 flow [2024-06-03 22:32:07,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:07,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:07,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:07,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:32:07,073 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-03 22:32:07,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash -849028249, now seen corresponding path program 1 times [2024-06-03 22:32:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266718459] [2024-06-03 22:32:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:21,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:21,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266718459] [2024-06-03 22:32:21,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266718459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:21,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:21,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:32:21,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298912452] [2024-06-03 22:32:21,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:21,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:32:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:32:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:32:21,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:32:21,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 206 transitions, 2314 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:21,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:21,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:32:21,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:23,382 INFO L124 PetriNetUnfolderBase]: 2271/3579 cut-off events. [2024-06-03 22:32:23,382 INFO L125 PetriNetUnfolderBase]: For 151864/151864 co-relation queries the response was YES. [2024-06-03 22:32:23,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23472 conditions, 3579 events. 2271/3579 cut-off events. For 151864/151864 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 19562 event pairs, 411 based on Foata normal form. 8/3586 useless extension candidates. Maximal degree in co-relation 23388. Up to 3336 conditions per place. [2024-06-03 22:32:23,414 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 206 selfloop transitions, 22 changer transitions 0/232 dead transitions. [2024-06-03 22:32:23,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 232 transitions, 2912 flow [2024-06-03 22:32:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:32:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:32:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 22:32:23,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-03 22:32:23,415 INFO L175 Difference]: Start difference. First operand has 176 places, 206 transitions, 2314 flow. Second operand 7 states and 129 transitions. [2024-06-03 22:32:23,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 232 transitions, 2912 flow [2024-06-03 22:32:23,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 232 transitions, 2783 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:23,590 INFO L231 Difference]: Finished difference. Result has 180 places, 208 transitions, 2273 flow [2024-06-03 22:32:23,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2273, PETRI_PLACES=180, PETRI_TRANSITIONS=208} [2024-06-03 22:32:23,591 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2024-06-03 22:32:23,591 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 208 transitions, 2273 flow [2024-06-03 22:32:23,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:23,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:23,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:23,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:32:23,591 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:32:23,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash -384155545, now seen corresponding path program 3 times [2024-06-03 22:32:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862945352] [2024-06-03 22:32:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862945352] [2024-06-03 22:32:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862945352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:32:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898205492] [2024-06-03 22:32:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:32:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:32:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:32:40,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-03 22:32:40,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 208 transitions, 2273 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:40,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:40,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-03 22:32:40,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:41,746 INFO L124 PetriNetUnfolderBase]: 2312/3650 cut-off events. [2024-06-03 22:32:41,746 INFO L125 PetriNetUnfolderBase]: For 157739/157739 co-relation queries the response was YES. [2024-06-03 22:32:41,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23819 conditions, 3650 events. 2312/3650 cut-off events. For 157739/157739 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20158 event pairs, 565 based on Foata normal form. 12/3661 useless extension candidates. Maximal degree in co-relation 23732. Up to 3125 conditions per place. [2024-06-03 22:32:41,777 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 181 selfloop transitions, 64 changer transitions 0/249 dead transitions. [2024-06-03 22:32:41,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 249 transitions, 2956 flow [2024-06-03 22:32:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-03 22:32:41,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-03 22:32:41,780 INFO L175 Difference]: Start difference. First operand has 180 places, 208 transitions, 2273 flow. Second operand 10 states and 175 transitions. [2024-06-03 22:32:41,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 249 transitions, 2956 flow [2024-06-03 22:32:41,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 249 transitions, 2884 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-03 22:32:41,973 INFO L231 Difference]: Finished difference. Result has 186 places, 209 transitions, 2373 flow [2024-06-03 22:32:41,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2373, PETRI_PLACES=186, PETRI_TRANSITIONS=209} [2024-06-03 22:32:41,974 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2024-06-03 22:32:41,974 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 209 transitions, 2373 flow [2024-06-03 22:32:41,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:41,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:41,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:41,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:32:41,974 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:32:41,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash -586083111, now seen corresponding path program 4 times [2024-06-03 22:32:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:41,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376503582] [2024-06-03 22:32:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:55,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376503582] [2024-06-03 22:32:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376503582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:55,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:32:55,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351526066] [2024-06-03 22:32:55,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:55,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:32:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:55,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:32:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:32:56,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:32:56,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 209 transitions, 2373 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:56,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:56,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:32:56,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:57,879 INFO L124 PetriNetUnfolderBase]: 2353/3721 cut-off events. [2024-06-03 22:32:57,880 INFO L125 PetriNetUnfolderBase]: For 165135/165135 co-relation queries the response was YES. [2024-06-03 22:32:57,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24362 conditions, 3721 events. 2353/3721 cut-off events. For 165135/165135 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20709 event pairs, 580 based on Foata normal form. 12/3732 useless extension candidates. Maximal degree in co-relation 24274. Up to 3356 conditions per place. [2024-06-03 22:32:57,913 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 197 selfloop transitions, 46 changer transitions 0/247 dead transitions. [2024-06-03 22:32:57,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 247 transitions, 3020 flow [2024-06-03 22:32:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-03 22:32:57,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:32:57,916 INFO L175 Difference]: Start difference. First operand has 186 places, 209 transitions, 2373 flow. Second operand 10 states and 180 transitions. [2024-06-03 22:32:57,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 247 transitions, 3020 flow [2024-06-03 22:32:58,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 247 transitions, 2846 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 22:32:58,120 INFO L231 Difference]: Finished difference. Result has 188 places, 210 transitions, 2337 flow [2024-06-03 22:32:58,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2337, PETRI_PLACES=188, PETRI_TRANSITIONS=210} [2024-06-03 22:32:58,120 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places. [2024-06-03 22:32:58,121 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 210 transitions, 2337 flow [2024-06-03 22:32:58,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:58,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:58,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:58,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:32:58,121 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 22:32:58,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -586227261, now seen corresponding path program 5 times [2024-06-03 22:32:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:58,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254723226] [2024-06-03 22:32:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:58,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254723226] [2024-06-03 22:33:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254723226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:19,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:33:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091948277] [2024-06-03 22:33:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:19,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:33:19,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:19,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:33:19,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:33:19,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:33:19,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 210 transitions, 2337 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:19,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:19,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:33:19,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:20,932 INFO L124 PetriNetUnfolderBase]: 2345/3709 cut-off events. [2024-06-03 22:33:20,932 INFO L125 PetriNetUnfolderBase]: For 160873/160873 co-relation queries the response was YES. [2024-06-03 22:33:20,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24003 conditions, 3709 events. 2345/3709 cut-off events. For 160873/160873 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 20672 event pairs, 573 based on Foata normal form. 4/3712 useless extension candidates. Maximal degree in co-relation 23914. Up to 3331 conditions per place. [2024-06-03 22:33:20,965 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 194 selfloop transitions, 52 changer transitions 0/250 dead transitions. [2024-06-03 22:33:20,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 250 transitions, 3018 flow [2024-06-03 22:33:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:33:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:33:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-03 22:33:20,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:33:20,968 INFO L175 Difference]: Start difference. First operand has 188 places, 210 transitions, 2337 flow. Second operand 10 states and 180 transitions. [2024-06-03 22:33:20,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 250 transitions, 3018 flow [2024-06-03 22:33:21,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 250 transitions, 2885 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 22:33:21,168 INFO L231 Difference]: Finished difference. Result has 192 places, 214 transitions, 2406 flow [2024-06-03 22:33:21,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2406, PETRI_PLACES=192, PETRI_TRANSITIONS=214} [2024-06-03 22:33:21,169 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2024-06-03 22:33:21,169 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 214 transitions, 2406 flow [2024-06-03 22:33:21,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:21,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:21,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:21,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:33:21,169 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-03 22:33:21,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:21,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2080225833, now seen corresponding path program 1 times [2024-06-03 22:33:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322894959] [2024-06-03 22:33:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322894959] [2024-06-03 22:33:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322894959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924562618] [2024-06-03 22:33:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:32,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:33,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:33:33,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 214 transitions, 2406 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:33,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:33,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:33:33,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:34,431 INFO L124 PetriNetUnfolderBase]: 2419/3811 cut-off events. [2024-06-03 22:33:34,431 INFO L125 PetriNetUnfolderBase]: For 173834/173834 co-relation queries the response was YES. [2024-06-03 22:33:34,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25109 conditions, 3811 events. 2419/3811 cut-off events. For 173834/173834 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21157 event pairs, 547 based on Foata normal form. 4/3814 useless extension candidates. Maximal degree in co-relation 25018. Up to 3496 conditions per place. [2024-06-03 22:33:34,462 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 186 selfloop transitions, 60 changer transitions 0/250 dead transitions. [2024-06-03 22:33:34,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 250 transitions, 3265 flow [2024-06-03 22:33:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 22:33:34,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-03 22:33:34,463 INFO L175 Difference]: Start difference. First operand has 192 places, 214 transitions, 2406 flow. Second operand 8 states and 149 transitions. [2024-06-03 22:33:34,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 250 transitions, 3265 flow [2024-06-03 22:33:34,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 250 transitions, 3044 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:34,646 INFO L231 Difference]: Finished difference. Result has 193 places, 226 transitions, 2549 flow [2024-06-03 22:33:34,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2191, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2549, PETRI_PLACES=193, PETRI_TRANSITIONS=226} [2024-06-03 22:33:34,646 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-06-03 22:33:34,646 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 226 transitions, 2549 flow [2024-06-03 22:33:34,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:34,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:34,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:34,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:33:34,647 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-03 22:33:34,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1216588555, now seen corresponding path program 2 times [2024-06-03 22:33:34,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:34,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148418362] [2024-06-03 22:33:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:45,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148418362] [2024-06-03 22:33:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148418362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:45,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:45,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:45,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927051696] [2024-06-03 22:33:45,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:45,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:45,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:45,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:45,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:46,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:33:46,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 226 transitions, 2549 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:46,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:46,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:33:46,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:47,472 INFO L124 PetriNetUnfolderBase]: 2439/3839 cut-off events. [2024-06-03 22:33:47,472 INFO L125 PetriNetUnfolderBase]: For 181545/181545 co-relation queries the response was YES. [2024-06-03 22:33:47,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25777 conditions, 3839 events. 2439/3839 cut-off events. For 181545/181545 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 21297 event pairs, 553 based on Foata normal form. 4/3842 useless extension candidates. Maximal degree in co-relation 25685. Up to 3602 conditions per place. [2024-06-03 22:33:47,512 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 204 selfloop transitions, 43 changer transitions 0/251 dead transitions. [2024-06-03 22:33:47,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 251 transitions, 3215 flow [2024-06-03 22:33:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:33:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:33:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 22:33:47,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:33:47,513 INFO L175 Difference]: Start difference. First operand has 193 places, 226 transitions, 2549 flow. Second operand 8 states and 144 transitions. [2024-06-03 22:33:47,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 251 transitions, 3215 flow [2024-06-03 22:33:47,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 251 transitions, 3085 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-03 22:33:47,744 INFO L231 Difference]: Finished difference. Result has 196 places, 230 transitions, 2600 flow [2024-06-03 22:33:47,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2433, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2600, PETRI_PLACES=196, PETRI_TRANSITIONS=230} [2024-06-03 22:33:47,744 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-03 22:33:47,744 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 230 transitions, 2600 flow [2024-06-03 22:33:47,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:47,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:47,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:47,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:33:47,745 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-03 22:33:47,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1209236905, now seen corresponding path program 3 times [2024-06-03 22:33:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:47,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831234872] [2024-06-03 22:33:47,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831234872] [2024-06-03 22:33:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831234872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:59,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:59,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:33:59,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381678470] [2024-06-03 22:33:59,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:59,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:33:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:33:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:33:59,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:33:59,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 230 transitions, 2600 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:59,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:59,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:33:59,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:00,996 INFO L124 PetriNetUnfolderBase]: 2427/3825 cut-off events. [2024-06-03 22:34:00,996 INFO L125 PetriNetUnfolderBase]: For 176260/176260 co-relation queries the response was YES. [2024-06-03 22:34:01,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25449 conditions, 3825 events. 2427/3825 cut-off events. For 176260/176260 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21237 event pairs, 563 based on Foata normal form. 4/3828 useless extension candidates. Maximal degree in co-relation 25356. Up to 3646 conditions per place. [2024-06-03 22:34:01,034 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 213 selfloop transitions, 28 changer transitions 0/245 dead transitions. [2024-06-03 22:34:01,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 245 transitions, 3148 flow [2024-06-03 22:34:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:34:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:34:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 22:34:01,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 22:34:01,035 INFO L175 Difference]: Start difference. First operand has 196 places, 230 transitions, 2600 flow. Second operand 7 states and 124 transitions. [2024-06-03 22:34:01,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 245 transitions, 3148 flow [2024-06-03 22:34:01,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 245 transitions, 3007 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-03 22:34:01,330 INFO L231 Difference]: Finished difference. Result has 197 places, 230 transitions, 2526 flow [2024-06-03 22:34:01,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2526, PETRI_PLACES=197, PETRI_TRANSITIONS=230} [2024-06-03 22:34:01,330 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-03 22:34:01,330 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 230 transitions, 2526 flow [2024-06-03 22:34:01,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:01,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:01,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:34:01,331 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-03 22:34:01,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -813644409, now seen corresponding path program 4 times [2024-06-03 22:34:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280027546] [2024-06-03 22:34:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:01,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:12,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280027546] [2024-06-03 22:34:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280027546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:12,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:12,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974039176] [2024-06-03 22:34:12,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:12,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:34:12,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 230 transitions, 2526 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:12,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:12,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:34:12,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:14,345 INFO L124 PetriNetUnfolderBase]: 2490/3913 cut-off events. [2024-06-03 22:34:14,345 INFO L125 PetriNetUnfolderBase]: For 188259/188259 co-relation queries the response was YES. [2024-06-03 22:34:14,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26244 conditions, 3913 events. 2490/3913 cut-off events. For 188259/188259 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 21737 event pairs, 595 based on Foata normal form. 4/3916 useless extension candidates. Maximal degree in co-relation 26150. Up to 3686 conditions per place. [2024-06-03 22:34:14,378 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 229 selfloop transitions, 36 changer transitions 0/269 dead transitions. [2024-06-03 22:34:14,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 269 transitions, 3461 flow [2024-06-03 22:34:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:34:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:34:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-03 22:34:14,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-03 22:34:14,379 INFO L175 Difference]: Start difference. First operand has 197 places, 230 transitions, 2526 flow. Second operand 9 states and 161 transitions. [2024-06-03 22:34:14,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 269 transitions, 3461 flow [2024-06-03 22:34:14,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 269 transitions, 3398 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:34:14,604 INFO L231 Difference]: Finished difference. Result has 202 places, 241 transitions, 2755 flow [2024-06-03 22:34:14,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2463, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2755, PETRI_PLACES=202, PETRI_TRANSITIONS=241} [2024-06-03 22:34:14,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-03 22:34:14,605 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 241 transitions, 2755 flow [2024-06-03 22:34:14,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:14,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:14,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:14,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:34:14,606 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-03 22:34:14,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash -585743259, now seen corresponding path program 5 times [2024-06-03 22:34:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:14,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498974005] [2024-06-03 22:34:14,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:14,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498974005] [2024-06-03 22:34:27,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498974005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:27,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:27,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717514049] [2024-06-03 22:34:27,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:27,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:27,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:27,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:34:27,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 241 transitions, 2755 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:27,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:27,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:34:27,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:29,375 INFO L124 PetriNetUnfolderBase]: 2521/3957 cut-off events. [2024-06-03 22:34:29,375 INFO L125 PetriNetUnfolderBase]: For 196223/196223 co-relation queries the response was YES. [2024-06-03 22:34:29,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27273 conditions, 3957 events. 2521/3957 cut-off events. For 196223/196223 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 21990 event pairs, 603 based on Foata normal form. 2/3958 useless extension candidates. Maximal degree in co-relation 27177. Up to 3663 conditions per place. [2024-06-03 22:34:29,407 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 219 selfloop transitions, 50 changer transitions 0/273 dead transitions. [2024-06-03 22:34:29,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 273 transitions, 3493 flow [2024-06-03 22:34:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-03 22:34:29,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-03 22:34:29,409 INFO L175 Difference]: Start difference. First operand has 202 places, 241 transitions, 2755 flow. Second operand 8 states and 145 transitions. [2024-06-03 22:34:29,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 273 transitions, 3493 flow [2024-06-03 22:34:29,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 273 transitions, 3361 flow, removed 51 selfloop flow, removed 5 redundant places. [2024-06-03 22:34:29,672 INFO L231 Difference]: Finished difference. Result has 206 places, 251 transitions, 2896 flow [2024-06-03 22:34:29,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2896, PETRI_PLACES=206, PETRI_TRANSITIONS=251} [2024-06-03 22:34:29,672 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2024-06-03 22:34:29,673 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 251 transitions, 2896 flow [2024-06-03 22:34:29,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:29,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:29,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:29,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:34:29,673 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-03 22:34:29,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash -573363099, now seen corresponding path program 6 times [2024-06-03 22:34:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709430885] [2024-06-03 22:34:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:41,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709430885] [2024-06-03 22:34:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709430885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:41,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:41,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405477413] [2024-06-03 22:34:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:41,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:41,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:41,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:34:41,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 251 transitions, 2896 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:41,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:41,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:34:41,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:43,026 INFO L124 PetriNetUnfolderBase]: 2547/3997 cut-off events. [2024-06-03 22:34:43,026 INFO L125 PetriNetUnfolderBase]: For 206274/206274 co-relation queries the response was YES. [2024-06-03 22:34:43,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28141 conditions, 3997 events. 2547/3997 cut-off events. For 206274/206274 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22199 event pairs, 547 based on Foata normal form. 2/3998 useless extension candidates. Maximal degree in co-relation 28042. Up to 3451 conditions per place. [2024-06-03 22:34:43,060 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 183 selfloop transitions, 96 changer transitions 0/283 dead transitions. [2024-06-03 22:34:43,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 283 transitions, 3818 flow [2024-06-03 22:34:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-03 22:34:43,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-03 22:34:43,061 INFO L175 Difference]: Start difference. First operand has 206 places, 251 transitions, 2896 flow. Second operand 8 states and 149 transitions. [2024-06-03 22:34:43,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 283 transitions, 3818 flow [2024-06-03 22:34:43,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 283 transitions, 3692 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-03 22:34:43,368 INFO L231 Difference]: Finished difference. Result has 211 places, 258 transitions, 3180 flow [2024-06-03 22:34:43,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3180, PETRI_PLACES=211, PETRI_TRANSITIONS=258} [2024-06-03 22:34:43,368 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 169 predicate places. [2024-06-03 22:34:43,368 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 258 transitions, 3180 flow [2024-06-03 22:34:43,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:43,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:43,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:43,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:34:43,369 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-03 22:34:43,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash -442596729, now seen corresponding path program 7 times [2024-06-03 22:34:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421212960] [2024-06-03 22:34:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:34:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:34:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:34:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421212960] [2024-06-03 22:34:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421212960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:34:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:34:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:34:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925272395] [2024-06-03 22:34:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:34:54,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:34:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:34:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:34:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:34:54,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:34:54,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 258 transitions, 3180 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:54,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:34:54,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:34:54,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:34:55,838 INFO L124 PetriNetUnfolderBase]: 2535/3977 cut-off events. [2024-06-03 22:34:55,838 INFO L125 PetriNetUnfolderBase]: For 214979/214979 co-relation queries the response was YES. [2024-06-03 22:34:55,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28811 conditions, 3977 events. 2535/3977 cut-off events. For 214979/214979 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 22118 event pairs, 602 based on Foata normal form. 4/3980 useless extension candidates. Maximal degree in co-relation 28710. Up to 3786 conditions per place. [2024-06-03 22:34:55,873 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 248 selfloop transitions, 28 changer transitions 0/280 dead transitions. [2024-06-03 22:34:55,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 280 transitions, 3862 flow [2024-06-03 22:34:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:34:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:34:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-03 22:34:55,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-03 22:34:55,874 INFO L175 Difference]: Start difference. First operand has 211 places, 258 transitions, 3180 flow. Second operand 8 states and 141 transitions. [2024-06-03 22:34:55,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 280 transitions, 3862 flow [2024-06-03 22:34:56,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 280 transitions, 3694 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-03 22:34:56,197 INFO L231 Difference]: Finished difference. Result has 214 places, 258 transitions, 3075 flow [2024-06-03 22:34:56,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3012, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3075, PETRI_PLACES=214, PETRI_TRANSITIONS=258} [2024-06-03 22:34:56,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places. [2024-06-03 22:34:56,198 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 258 transitions, 3075 flow [2024-06-03 22:34:56,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:34:56,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:34:56,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:34:56,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:34:56,198 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-03 22:34:56,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:34:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1160800071, now seen corresponding path program 8 times [2024-06-03 22:34:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:34:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658623748] [2024-06-03 22:34:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:34:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:34:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658623748] [2024-06-03 22:35:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658623748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276527173] [2024-06-03 22:35:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:10,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:10,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:35:10,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 258 transitions, 3075 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:10,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:10,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:35:10,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:11,444 INFO L124 PetriNetUnfolderBase]: 2555/4009 cut-off events. [2024-06-03 22:35:11,444 INFO L125 PetriNetUnfolderBase]: For 208038/208038 co-relation queries the response was YES. [2024-06-03 22:35:11,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28829 conditions, 4009 events. 2555/4009 cut-off events. For 208038/208038 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 22294 event pairs, 551 based on Foata normal form. 4/4012 useless extension candidates. Maximal degree in co-relation 28728. Up to 3672 conditions per place. [2024-06-03 22:35:11,481 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 229 selfloop transitions, 52 changer transitions 0/285 dead transitions. [2024-06-03 22:35:11,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 285 transitions, 3881 flow [2024-06-03 22:35:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 22:35:11,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:35:11,482 INFO L175 Difference]: Start difference. First operand has 214 places, 258 transitions, 3075 flow. Second operand 8 states and 144 transitions. [2024-06-03 22:35:11,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 285 transitions, 3881 flow [2024-06-03 22:35:11,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 285 transitions, 3802 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 22:35:11,731 INFO L231 Difference]: Finished difference. Result has 216 places, 262 transitions, 3219 flow [2024-06-03 22:35:11,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3012, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3219, PETRI_PLACES=216, PETRI_TRANSITIONS=262} [2024-06-03 22:35:11,731 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2024-06-03 22:35:11,731 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 262 transitions, 3219 flow [2024-06-03 22:35:11,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:11,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:11,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:11,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:35:11,732 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-03 22:35:11,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1160562921, now seen corresponding path program 9 times [2024-06-03 22:35:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:11,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905300948] [2024-06-03 22:35:11,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:11,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:24,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905300948] [2024-06-03 22:35:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905300948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44214346] [2024-06-03 22:35:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:24,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:24,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:35:24,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 262 transitions, 3219 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:24,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:24,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:35:24,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:25,608 INFO L124 PetriNetUnfolderBase]: 2565/4023 cut-off events. [2024-06-03 22:35:25,608 INFO L125 PetriNetUnfolderBase]: For 210258/210258 co-relation queries the response was YES. [2024-06-03 22:35:25,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29023 conditions, 4023 events. 2565/4023 cut-off events. For 210258/210258 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 22372 event pairs, 555 based on Foata normal form. 2/4024 useless extension candidates. Maximal degree in co-relation 28921. Up to 3638 conditions per place. [2024-06-03 22:35:25,647 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 218 selfloop transitions, 65 changer transitions 0/287 dead transitions. [2024-06-03 22:35:25,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 287 transitions, 3970 flow [2024-06-03 22:35:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 22:35:25,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:35:25,648 INFO L175 Difference]: Start difference. First operand has 216 places, 262 transitions, 3219 flow. Second operand 8 states and 144 transitions. [2024-06-03 22:35:25,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 287 transitions, 3970 flow [2024-06-03 22:35:26,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 287 transitions, 3803 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-03 22:35:26,022 INFO L231 Difference]: Finished difference. Result has 218 places, 265 transitions, 3263 flow [2024-06-03 22:35:26,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3052, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3263, PETRI_PLACES=218, PETRI_TRANSITIONS=265} [2024-06-03 22:35:26,022 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 176 predicate places. [2024-06-03 22:35:26,022 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 265 transitions, 3263 flow [2024-06-03 22:35:26,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:26,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:26,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:26,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:35:26,023 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-03 22:35:26,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash -355917153, now seen corresponding path program 10 times [2024-06-03 22:35:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356358807] [2024-06-03 22:35:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356358807] [2024-06-03 22:35:38,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356358807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:38,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:38,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:38,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495171100] [2024-06-03 22:35:38,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:38,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:38,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:38,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:38,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:38,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:35:38,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 265 transitions, 3263 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:38,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:38,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:35:38,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:40,285 INFO L124 PetriNetUnfolderBase]: 2585/4049 cut-off events. [2024-06-03 22:35:40,286 INFO L125 PetriNetUnfolderBase]: For 220141/220141 co-relation queries the response was YES. [2024-06-03 22:35:40,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29368 conditions, 4049 events. 2585/4049 cut-off events. For 220141/220141 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 22458 event pairs, 568 based on Foata normal form. 4/4052 useless extension candidates. Maximal degree in co-relation 29265. Up to 3868 conditions per place. [2024-06-03 22:35:40,324 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 258 selfloop transitions, 25 changer transitions 0/287 dead transitions. [2024-06-03 22:35:40,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 287 transitions, 4037 flow [2024-06-03 22:35:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-03 22:35:40,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-03 22:35:40,325 INFO L175 Difference]: Start difference. First operand has 218 places, 265 transitions, 3263 flow. Second operand 8 states and 137 transitions. [2024-06-03 22:35:40,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 287 transitions, 4037 flow [2024-06-03 22:35:40,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 287 transitions, 3857 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-03 22:35:40,596 INFO L231 Difference]: Finished difference. Result has 220 places, 269 transitions, 3250 flow [2024-06-03 22:35:40,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3083, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3250, PETRI_PLACES=220, PETRI_TRANSITIONS=269} [2024-06-03 22:35:40,597 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 178 predicate places. [2024-06-03 22:35:40,597 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 269 transitions, 3250 flow [2024-06-03 22:35:40,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:40,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:40,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:40,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:35:40,597 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-03 22:35:40,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash -135102697, now seen corresponding path program 11 times [2024-06-03 22:35:40,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:40,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526622688] [2024-06-03 22:35:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:35:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:35:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:35:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526622688] [2024-06-03 22:35:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526622688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:35:51,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:35:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:35:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283509659] [2024-06-03 22:35:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:35:51,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:35:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:35:51,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:35:51,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:35:51,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:35:51,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 269 transitions, 3250 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:51,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:35:51,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:35:51,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:35:53,188 INFO L124 PetriNetUnfolderBase]: 2595/4063 cut-off events. [2024-06-03 22:35:53,194 INFO L125 PetriNetUnfolderBase]: For 223738/223738 co-relation queries the response was YES. [2024-06-03 22:35:53,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29408 conditions, 4063 events. 2595/4063 cut-off events. For 223738/223738 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22562 event pairs, 572 based on Foata normal form. 2/4064 useless extension candidates. Maximal degree in co-relation 29304. Up to 3784 conditions per place. [2024-06-03 22:35:53,233 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 240 selfloop transitions, 46 changer transitions 0/290 dead transitions. [2024-06-03 22:35:53,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 290 transitions, 4101 flow [2024-06-03 22:35:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:35:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:35:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:35:53,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:35:53,234 INFO L175 Difference]: Start difference. First operand has 220 places, 269 transitions, 3250 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:35:53,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 290 transitions, 4101 flow [2024-06-03 22:35:53,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 290 transitions, 3974 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-03 22:35:53,530 INFO L231 Difference]: Finished difference. Result has 222 places, 272 transitions, 3302 flow [2024-06-03 22:35:53,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3123, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3302, PETRI_PLACES=222, PETRI_TRANSITIONS=272} [2024-06-03 22:35:53,531 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-03 22:35:53,531 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 272 transitions, 3302 flow [2024-06-03 22:35:53,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:35:53,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:35:53,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:35:53,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:35:53,531 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-03 22:35:53,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:35:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash -380269287, now seen corresponding path program 12 times [2024-06-03 22:35:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:35:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776759682] [2024-06-03 22:35:53,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:35:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:35:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776759682] [2024-06-03 22:36:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776759682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:36:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036466454] [2024-06-03 22:36:05,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:05,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:36:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:05,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:36:05,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:36:05,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:36:05,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 272 transitions, 3302 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:05,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:05,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:36:05,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:07,160 INFO L124 PetriNetUnfolderBase]: 2583/4047 cut-off events. [2024-06-03 22:36:07,160 INFO L125 PetriNetUnfolderBase]: For 226023/226023 co-relation queries the response was YES. [2024-06-03 22:36:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29055 conditions, 4047 events. 2583/4047 cut-off events. For 226023/226023 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22495 event pairs, 572 based on Foata normal form. 4/4050 useless extension candidates. Maximal degree in co-relation 28950. Up to 3822 conditions per place. [2024-06-03 22:36:07,204 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 253 selfloop transitions, 33 changer transitions 0/290 dead transitions. [2024-06-03 22:36:07,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 290 transitions, 3980 flow [2024-06-03 22:36:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:36:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:36:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 22:36:07,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 22:36:07,206 INFO L175 Difference]: Start difference. First operand has 222 places, 272 transitions, 3302 flow. Second operand 8 states and 138 transitions. [2024-06-03 22:36:07,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 290 transitions, 3980 flow [2024-06-03 22:36:07,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 290 transitions, 3715 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-06-03 22:36:07,618 INFO L231 Difference]: Finished difference. Result has 224 places, 272 transitions, 3110 flow [2024-06-03 22:36:07,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3037, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3110, PETRI_PLACES=224, PETRI_TRANSITIONS=272} [2024-06-03 22:36:07,618 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-03 22:36:07,618 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 272 transitions, 3110 flow [2024-06-03 22:36:07,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:07,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:07,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:07,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:36:07,619 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-03 22:36:07,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -577163451, now seen corresponding path program 1 times [2024-06-03 22:36:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:07,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988142149] [2024-06-03 22:36:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988142149] [2024-06-03 22:36:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988142149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:21,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:36:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175471952] [2024-06-03 22:36:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:21,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:36:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:36:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:36:21,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:36:21,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 272 transitions, 3110 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:21,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:21,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:36:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:23,349 INFO L124 PetriNetUnfolderBase]: 2608/4081 cut-off events. [2024-06-03 22:36:23,349 INFO L125 PetriNetUnfolderBase]: For 229941/229941 co-relation queries the response was YES. [2024-06-03 22:36:23,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29013 conditions, 4081 events. 2608/4081 cut-off events. For 229941/229941 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 22678 event pairs, 628 based on Foata normal form. 6/4086 useless extension candidates. Maximal degree in co-relation 28907. Up to 3696 conditions per place. [2024-06-03 22:36:23,391 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 231 selfloop transitions, 73 changer transitions 0/308 dead transitions. [2024-06-03 22:36:23,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 308 transitions, 3956 flow [2024-06-03 22:36:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:36:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:36:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-03 22:36:23,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 22:36:23,392 INFO L175 Difference]: Start difference. First operand has 224 places, 272 transitions, 3110 flow. Second operand 10 states and 180 transitions. [2024-06-03 22:36:23,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 308 transitions, 3956 flow [2024-06-03 22:36:23,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 308 transitions, 3844 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 22:36:23,738 INFO L231 Difference]: Finished difference. Result has 228 places, 280 transitions, 3335 flow [2024-06-03 22:36:23,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2998, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3335, PETRI_PLACES=228, PETRI_TRANSITIONS=280} [2024-06-03 22:36:23,738 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places. [2024-06-03 22:36:23,738 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 280 transitions, 3335 flow [2024-06-03 22:36:23,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:23,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:23,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:23,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:36:23,739 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-03 22:36:23,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1304438571, now seen corresponding path program 1 times [2024-06-03 22:36:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:23,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865176336] [2024-06-03 22:36:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:23,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:38,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:38,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865176336] [2024-06-03 22:36:38,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865176336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:38,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:38,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:36:38,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129744767] [2024-06-03 22:36:38,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:38,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:36:38,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:38,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:36:38,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:36:38,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:36:38,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 280 transitions, 3335 flow. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:38,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:38,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:36:38,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:39,612 INFO L124 PetriNetUnfolderBase]: 2616/4092 cut-off events. [2024-06-03 22:36:39,612 INFO L125 PetriNetUnfolderBase]: For 233236/233236 co-relation queries the response was YES. [2024-06-03 22:36:39,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29848 conditions, 4092 events. 2616/4092 cut-off events. For 233236/233236 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 22758 event pairs, 566 based on Foata normal form. 2/4094 useless extension candidates. Maximal degree in co-relation 29740. Up to 3952 conditions per place. [2024-06-03 22:36:39,655 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 271 selfloop transitions, 29 changer transitions 0/304 dead transitions. [2024-06-03 22:36:39,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 304 transitions, 4023 flow [2024-06-03 22:36:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:36:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:36:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 22:36:39,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 22:36:39,657 INFO L175 Difference]: Start difference. First operand has 228 places, 280 transitions, 3335 flow. Second operand 8 states and 139 transitions. [2024-06-03 22:36:39,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 304 transitions, 4023 flow [2024-06-03 22:36:39,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 304 transitions, 3789 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-03 22:36:39,968 INFO L231 Difference]: Finished difference. Result has 228 places, 282 transitions, 3204 flow [2024-06-03 22:36:39,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3101, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3204, PETRI_PLACES=228, PETRI_TRANSITIONS=282} [2024-06-03 22:36:39,969 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places. [2024-06-03 22:36:39,969 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 282 transitions, 3204 flow [2024-06-03 22:36:39,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:39,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:39,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:39,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:36:39,969 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-03 22:36:39,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1160346231, now seen corresponding path program 2 times [2024-06-03 22:36:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871593736] [2024-06-03 22:36:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:36:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:36:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:36:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871593736] [2024-06-03 22:36:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871593736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:36:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:36:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:36:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884777128] [2024-06-03 22:36:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:36:51,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:36:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:36:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:36:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:36:51,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:36:51,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 282 transitions, 3204 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:51,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:36:51,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:36:51,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:36:53,039 INFO L124 PetriNetUnfolderBase]: 2624/4104 cut-off events. [2024-06-03 22:36:53,039 INFO L125 PetriNetUnfolderBase]: For 240196/240196 co-relation queries the response was YES. [2024-06-03 22:36:53,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29758 conditions, 4104 events. 2624/4104 cut-off events. For 240196/240196 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 22810 event pairs, 572 based on Foata normal form. 2/4106 useless extension candidates. Maximal degree in co-relation 29649. Up to 3987 conditions per place. [2024-06-03 22:36:53,072 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 278 selfloop transitions, 21 changer transitions 0/303 dead transitions. [2024-06-03 22:36:53,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 303 transitions, 3886 flow [2024-06-03 22:36:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:36:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:36:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-03 22:36:53,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115853658536585 [2024-06-03 22:36:53,073 INFO L175 Difference]: Start difference. First operand has 228 places, 282 transitions, 3204 flow. Second operand 8 states and 135 transitions. [2024-06-03 22:36:53,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 303 transitions, 3886 flow [2024-06-03 22:36:53,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 303 transitions, 3799 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-03 22:36:53,388 INFO L231 Difference]: Finished difference. Result has 230 places, 284 transitions, 3208 flow [2024-06-03 22:36:53,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3208, PETRI_PLACES=230, PETRI_TRANSITIONS=284} [2024-06-03 22:36:53,388 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 188 predicate places. [2024-06-03 22:36:53,389 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 284 transitions, 3208 flow [2024-06-03 22:36:53,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:36:53,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:36:53,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:36:53,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:36:53,389 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-03 22:36:53,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:36:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1160553993, now seen corresponding path program 2 times [2024-06-03 22:36:53,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:36:53,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685423822] [2024-06-03 22:36:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:36:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:36:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:37:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:37:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:37:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685423822] [2024-06-03 22:37:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685423822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:37:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:37:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:37:05,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343244053] [2024-06-03 22:37:05,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:37:05,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:37:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:37:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:37:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:37:05,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-03 22:37:05,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 284 transitions, 3208 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:05,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:37:05,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-03 22:37:05,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:37:07,136 INFO L124 PetriNetUnfolderBase]: 2618/4096 cut-off events. [2024-06-03 22:37:07,136 INFO L125 PetriNetUnfolderBase]: For 243675/243675 co-relation queries the response was YES. [2024-06-03 22:37:07,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29728 conditions, 4096 events. 2618/4096 cut-off events. For 243675/243675 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 22766 event pairs, 569 based on Foata normal form. 2/4098 useless extension candidates. Maximal degree in co-relation 29618. Up to 3969 conditions per place. [2024-06-03 22:37:07,182 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 276 selfloop transitions, 25 changer transitions 0/305 dead transitions. [2024-06-03 22:37:07,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 305 transitions, 3858 flow [2024-06-03 22:37:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:37:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:37:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-03 22:37:07,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-03 22:37:07,183 INFO L175 Difference]: Start difference. First operand has 230 places, 284 transitions, 3208 flow. Second operand 9 states and 150 transitions. [2024-06-03 22:37:07,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 305 transitions, 3858 flow [2024-06-03 22:37:07,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 305 transitions, 3775 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 22:37:07,539 INFO L231 Difference]: Finished difference. Result has 233 places, 284 transitions, 3181 flow [2024-06-03 22:37:07,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3125, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3181, PETRI_PLACES=233, PETRI_TRANSITIONS=284} [2024-06-03 22:37:07,539 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 191 predicate places. [2024-06-03 22:37:07,539 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 284 transitions, 3181 flow [2024-06-03 22:37:07,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:37:07,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:37:07,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:37:07,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:37:07,540 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-03 22:37:07,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:37:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1160338791, now seen corresponding path program 3 times [2024-06-03 22:37:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:37:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879232602] [2024-06-03 22:37:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:37:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:37:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15