./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:32:49,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:32:49,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:32:49,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:32:49,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:32:49,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:32:49,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:32:49,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:32:49,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:32:49,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:32:49,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:32:49,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:32:49,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:32:49,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:32:49,852 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:32:49,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:32:49,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:32:49,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:32:49,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:32:49,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:32:49,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:32:49,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:32:49,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:32:49,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:32:49,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:32:49,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:32:49,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:32:49,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:32:49,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:32:49,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:32:49,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:32:49,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:32:49,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:32:49,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:32:49,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:32:49,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:32:49,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 11:32:50,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:32:50,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:32:50,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:32:50,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:32:50,146 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:32:50,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 11:32:51,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:32:51,408 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:32:51,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 11:32:51,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0391b3ba/d9b5e6a2f2084d7f86ad0feb776b63f4/FLAG0d67c944c [2024-05-12 11:32:51,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0391b3ba/d9b5e6a2f2084d7f86ad0feb776b63f4 [2024-05-12 11:32:51,436 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:32:51,437 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:32:51,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-05-12 11:32:51,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:32:51,566 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:32:51,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:32:51,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:32:51,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:32:51,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:32:51" (1/2) ... [2024-05-12 11:32:51,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276e86ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:32:51, skipping insertion in model container [2024-05-12 11:32:51,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:32:51" (1/2) ... [2024-05-12 11:32:51,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@21983383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:32:51, skipping insertion in model container [2024-05-12 11:32:51,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:32:51" (2/2) ... [2024-05-12 11:32:51,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276e86ab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:51, skipping insertion in model container [2024-05-12 11:32:51,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:32:51" (2/2) ... [2024-05-12 11:32:51,580 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:32:51,632 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:32:51,634 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__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_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__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_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__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_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 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_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 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_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p1_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 11:32:51,634 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__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_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__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_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__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_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 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_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 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_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p1_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 11:32:51,635 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:32:51,635 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-05-12 11:32:51,677 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:32:51,827 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2024-05-12 11:32:51,973 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:32:51,980 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:32:52,019 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:32:52,233 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:32:52,267 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:32:52,268 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52 WrapperNode [2024-05-12 11:32:52,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:32:52,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:32:52,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:32:52,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:32:52,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,351 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-05-12 11:32:52,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:32:52,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:32:52,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:32:52,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:32:52,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,414 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 11:32:52,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:32:52,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:32:52,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:32:52,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:32:52,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (1/1) ... [2024-05-12 11:32:52,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:32:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:32:52,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 11:32:52,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 11:32:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:32:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:32:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:32:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:32:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:32:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:32:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:32:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:32:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:32:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:32:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:32:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:32:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:32:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:32:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:32:52,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:32:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:32:52,584 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:32:52,704 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:32:52,706 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:32:53,348 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:32:53,348 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:32:53,502 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:32:53,503 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:32:53,505 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:32:53 BoogieIcfgContainer [2024-05-12 11:32:53,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:32:53,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:32:53,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:32:53,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:32:53,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:32:51" (1/4) ... [2024-05-12 11:32:53,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:32:53, skipping insertion in model container [2024-05-12 11:32:53,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:32:51" (2/4) ... [2024-05-12 11:32:53,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db057 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:32:53, skipping insertion in model container [2024-05-12 11:32:53,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:32:52" (3/4) ... [2024-05-12 11:32:53,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10db057 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:32:53, skipping insertion in model container [2024-05-12 11:32:53,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:32:53" (4/4) ... [2024-05-12 11:32:53,512 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 11:32:53,526 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:32:53,526 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 11:32:53,526 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:32:53,609 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:32:53,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-05-12 11:32:53,678 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-05-12 11:32:53,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:32:53,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-05-12 11:32:53,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-05-12 11:32:53,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-05-12 11:32:53,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:32:53,702 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;@56c05b67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:32:53,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 11:32:53,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:32:53,708 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:32:53,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:32:53,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:32:53,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:32:53,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:32:53,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:32:53,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1097637477, now seen corresponding path program 1 times [2024-05-12 11:32:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:32:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443369781] [2024-05-12 11:32:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:32:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:32:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:32:57,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-05-12 11:32:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:32:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443369781] [2024-05-12 11:32:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443369781] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:32:57,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:32:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:32:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981784787] [2024-05-12 11:32:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:32:57,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:32:57,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:32:57,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:32:57,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:32:57,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-05-12 11:32:57,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:32:57,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:32:57,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-05-12 11:32:57,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:32:57,850 INFO L124 PetriNetUnfolderBase]: 475/959 cut-off events. [2024-05-12 11:32:57,850 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 11:32:57,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 959 events. 475/959 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5383 event pairs, 334 based on Foata normal form. 36/897 useless extension candidates. Maximal degree in co-relation 1763. Up to 787 conditions per place. [2024-05-12 11:32:57,866 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 32 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-05-12 11:32:57,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 171 flow [2024-05-12 11:32:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:32:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:32:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-05-12 11:32:57,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2024-05-12 11:32:57,900 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 73 transitions. [2024-05-12 11:32:57,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 171 flow [2024-05-12 11:32:57,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:32:57,905 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 100 flow [2024-05-12 11:32:57,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-05-12 11:32:57,909 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-05-12 11:32:57,909 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 100 flow [2024-05-12 11:32:57,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:32:57,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:32:57,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:32:57,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:32:57,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:32:57,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:32:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1097638344, now seen corresponding path program 1 times [2024-05-12 11:32:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:32:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144720204] [2024-05-12 11:32:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:32:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:32:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:32:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:32:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:32:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144720204] [2024-05-12 11:32:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144720204] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:32:57,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:32:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:32:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381050024] [2024-05-12 11:32:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:32:57,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:32:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:32:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:32:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:32:58,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 37 [2024-05-12 11:32:58,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:32:58,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:32:58,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 37 [2024-05-12 11:32:58,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:32:58,121 INFO L124 PetriNetUnfolderBase]: 169/400 cut-off events. [2024-05-12 11:32:58,121 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-05-12 11:32:58,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 400 events. 169/400 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2112 event pairs, 96 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 756. Up to 256 conditions per place. [2024-05-12 11:32:58,123 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 25 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-05-12 11:32:58,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 175 flow [2024-05-12 11:32:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:32:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:32:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-05-12 11:32:58,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7297297297297297 [2024-05-12 11:32:58,126 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 100 flow. Second operand 3 states and 81 transitions. [2024-05-12 11:32:58,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 175 flow [2024-05-12 11:32:58,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:32:58,129 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 92 flow [2024-05-12 11:32:58,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-05-12 11:32:58,132 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-05-12 11:32:58,133 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 92 flow [2024-05-12 11:32:58,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:32:58,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:32:58,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:32:58,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:32:58,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:32:58,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:32:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1732301853, now seen corresponding path program 1 times [2024-05-12 11:32:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:32:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927873065] [2024-05-12 11:32:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:32:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:32:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927873065] [2024-05-12 11:33:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927873065] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:00,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:33:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64501760] [2024-05-12 11:33:00,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:00,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:33:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:33:00,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:33:00,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-05-12 11:33:00,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:00,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:00,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-05-12 11:33:00,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:00,984 INFO L124 PetriNetUnfolderBase]: 342/705 cut-off events. [2024-05-12 11:33:00,985 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-05-12 11:33:00,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 705 events. 342/705 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3684 event pairs, 164 based on Foata normal form. 2/676 useless extension candidates. Maximal degree in co-relation 1442. Up to 562 conditions per place. [2024-05-12 11:33:00,989 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 36 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-05-12 11:33:00,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 222 flow [2024-05-12 11:33:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:33:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:33:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-05-12 11:33:00,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-05-12 11:33:00,992 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 92 flow. Second operand 4 states and 86 transitions. [2024-05-12 11:33:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 222 flow [2024-05-12 11:33:00,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:33:00,995 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-05-12 11:33:00,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-05-12 11:33:00,996 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-05-12 11:33:00,997 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-05-12 11:33:00,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:00,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:00,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:00,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:33:00,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:00,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2133218670, now seen corresponding path program 1 times [2024-05-12 11:33:00,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215866431] [2024-05-12 11:33:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215866431] [2024-05-12 11:33:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215866431] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:03,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:33:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151229168] [2024-05-12 11:33:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:03,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:33:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:33:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:33:03,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 11:33:03,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:03,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:03,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 11:33:03,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:03,702 INFO L124 PetriNetUnfolderBase]: 418/832 cut-off events. [2024-05-12 11:33:03,702 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-05-12 11:33:03,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 832 events. 418/832 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4425 event pairs, 147 based on Foata normal form. 3/797 useless extension candidates. Maximal degree in co-relation 1865. Up to 629 conditions per place. [2024-05-12 11:33:03,707 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 48 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-05-12 11:33:03,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 345 flow [2024-05-12 11:33:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:33:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:33:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-05-12 11:33:03,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2024-05-12 11:33:03,708 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 135 flow. Second operand 5 states and 108 transitions. [2024-05-12 11:33:03,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 345 flow [2024-05-12 11:33:03,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 338 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 11:33:03,711 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 216 flow [2024-05-12 11:33:03,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-05-12 11:33:03,711 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-05-12 11:33:03,712 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 216 flow [2024-05-12 11:33:03,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:03,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:03,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:03,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:33:03,712 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:03,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1705270626, now seen corresponding path program 1 times [2024-05-12 11:33:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:03,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129398849] [2024-05-12 11:33:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129398849] [2024-05-12 11:33:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129398849] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:06,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:06,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:33:06,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802208043] [2024-05-12 11:33:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:06,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:33:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:33:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:33:06,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 11:33:06,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:06,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:06,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 11:33:06,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:07,000 INFO L124 PetriNetUnfolderBase]: 428/767 cut-off events. [2024-05-12 11:33:07,000 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2024-05-12 11:33:07,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 767 events. 428/767 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3813 event pairs, 77 based on Foata normal form. 3/759 useless extension candidates. Maximal degree in co-relation 2172. Up to 593 conditions per place. [2024-05-12 11:33:07,006 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 58 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2024-05-12 11:33:07,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 530 flow [2024-05-12 11:33:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:33:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:33:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-05-12 11:33:07,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-05-12 11:33:07,012 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 216 flow. Second operand 6 states and 129 transitions. [2024-05-12 11:33:07,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 530 flow [2024-05-12 11:33:07,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 526 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 11:33:07,019 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 364 flow [2024-05-12 11:33:07,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-05-12 11:33:07,021 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-05-12 11:33:07,021 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 364 flow [2024-05-12 11:33:07,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:07,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:07,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:07,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:33:07,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:07,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1256408285, now seen corresponding path program 1 times [2024-05-12 11:33:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522218821] [2024-05-12 11:33:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522218821] [2024-05-12 11:33:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522218821] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:09,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:33:09,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589297167] [2024-05-12 11:33:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:09,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:33:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:09,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:33:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:33:09,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 11:33:09,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:09,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:09,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 11:33:09,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:10,165 INFO L124 PetriNetUnfolderBase]: 438/785 cut-off events. [2024-05-12 11:33:10,166 INFO L125 PetriNetUnfolderBase]: For 1536/1536 co-relation queries the response was YES. [2024-05-12 11:33:10,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 785 events. 438/785 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3931 event pairs, 37 based on Foata normal form. 6/780 useless extension candidates. Maximal degree in co-relation 2652. Up to 561 conditions per place. [2024-05-12 11:33:10,170 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 61 selfloop transitions, 25 changer transitions 0/94 dead transitions. [2024-05-12 11:33:10,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 652 flow [2024-05-12 11:33:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:33:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:33:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-05-12 11:33:10,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555984555984556 [2024-05-12 11:33:10,172 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 364 flow. Second operand 7 states and 144 transitions. [2024-05-12 11:33:10,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 652 flow [2024-05-12 11:33:10,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 632 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-05-12 11:33:10,176 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 411 flow [2024-05-12 11:33:10,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-05-12 11:33:10,176 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-05-12 11:33:10,177 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 411 flow [2024-05-12 11:33:10,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:10,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:10,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:10,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:33:10,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:10,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 536142295, now seen corresponding path program 1 times [2024-05-12 11:33:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789077107] [2024-05-12 11:33:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:15,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789077107] [2024-05-12 11:33:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789077107] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:15,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:15,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:33:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982426320] [2024-05-12 11:33:15,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:15,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:33:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:15,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:33:15,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:33:15,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:15,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:15,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:15,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:15,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:15,767 INFO L124 PetriNetUnfolderBase]: 514/1026 cut-off events. [2024-05-12 11:33:15,767 INFO L125 PetriNetUnfolderBase]: For 2010/2010 co-relation queries the response was YES. [2024-05-12 11:33:15,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3277 conditions, 1026 events. 514/1026 cut-off events. For 2010/2010 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5580 event pairs, 156 based on Foata normal form. 1/985 useless extension candidates. Maximal degree in co-relation 3246. Up to 838 conditions per place. [2024-05-12 11:33:15,773 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-05-12 11:33:15,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 563 flow [2024-05-12 11:33:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:33:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:33:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-05-12 11:33:15,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2024-05-12 11:33:15,775 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 411 flow. Second operand 5 states and 87 transitions. [2024-05-12 11:33:15,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 563 flow [2024-05-12 11:33:15,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 504 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 11:33:15,779 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 380 flow [2024-05-12 11:33:15,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-05-12 11:33:15,780 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-05-12 11:33:15,780 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 380 flow [2024-05-12 11:33:15,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:15,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:15,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:15,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:33:15,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:15,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash -576091948, now seen corresponding path program 1 times [2024-05-12 11:33:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:15,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996088929] [2024-05-12 11:33:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:21,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996088929] [2024-05-12 11:33:21,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996088929] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:21,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:21,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:33:21,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691787470] [2024-05-12 11:33:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:21,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:33:21,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:21,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:33:21,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:33:21,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:21,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:21,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:21,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:21,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:22,409 INFO L124 PetriNetUnfolderBase]: 508/977 cut-off events. [2024-05-12 11:33:22,410 INFO L125 PetriNetUnfolderBase]: For 1854/1854 co-relation queries the response was YES. [2024-05-12 11:33:22,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 977 events. 508/977 cut-off events. For 1854/1854 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5188 event pairs, 151 based on Foata normal form. 3/948 useless extension candidates. Maximal degree in co-relation 3017. Up to 796 conditions per place. [2024-05-12 11:33:22,415 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 61 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-05-12 11:33:22,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 578 flow [2024-05-12 11:33:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:33:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:33:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-05-12 11:33:22,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-05-12 11:33:22,432 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 380 flow. Second operand 6 states and 105 transitions. [2024-05-12 11:33:22,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 578 flow [2024-05-12 11:33:22,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 553 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 11:33:22,436 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 399 flow [2024-05-12 11:33:22,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-05-12 11:33:22,436 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2024-05-12 11:33:22,436 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 399 flow [2024-05-12 11:33:22,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:22,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:22,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:22,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:33:22,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:22,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash -990947943, now seen corresponding path program 1 times [2024-05-12 11:33:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212155287] [2024-05-12 11:33:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:26,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:26,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212155287] [2024-05-12 11:33:26,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212155287] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:26,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:26,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:33:26,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427123801] [2024-05-12 11:33:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:26,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:33:26,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:33:26,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:33:26,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:26,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 399 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:26,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:26,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:26,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:26,521 INFO L124 PetriNetUnfolderBase]: 517/985 cut-off events. [2024-05-12 11:33:26,521 INFO L125 PetriNetUnfolderBase]: For 2032/2032 co-relation queries the response was YES. [2024-05-12 11:33:26,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3242 conditions, 985 events. 517/985 cut-off events. For 2032/2032 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5182 event pairs, 116 based on Foata normal form. 2/951 useless extension candidates. Maximal degree in co-relation 3209. Up to 767 conditions per place. [2024-05-12 11:33:26,529 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 62 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2024-05-12 11:33:26,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 639 flow [2024-05-12 11:33:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:33:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:33:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-05-12 11:33:26,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-05-12 11:33:26,530 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 399 flow. Second operand 6 states and 110 transitions. [2024-05-12 11:33:26,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 639 flow [2024-05-12 11:33:26,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 615 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 11:33:26,536 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 434 flow [2024-05-12 11:33:26,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-05-12 11:33:26,536 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2024-05-12 11:33:26,537 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 434 flow [2024-05-12 11:33:26,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:26,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:26,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:26,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:33:26,538 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:26,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -163306859, now seen corresponding path program 2 times [2024-05-12 11:33:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:26,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696285694] [2024-05-12 11:33:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696285694] [2024-05-12 11:33:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696285694] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:30,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:33:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295882714] [2024-05-12 11:33:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:30,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:33:30,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:33:30,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:33:30,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:30,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:30,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:30,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:30,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:30,959 INFO L124 PetriNetUnfolderBase]: 512/1002 cut-off events. [2024-05-12 11:33:30,959 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2024-05-12 11:33:30,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 1002 events. 512/1002 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5405 event pairs, 155 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 3244. Up to 830 conditions per place. [2024-05-12 11:33:30,965 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 61 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2024-05-12 11:33:30,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 610 flow [2024-05-12 11:33:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:33:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:33:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-05-12 11:33:30,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45495495495495497 [2024-05-12 11:33:30,967 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 434 flow. Second operand 6 states and 101 transitions. [2024-05-12 11:33:30,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 610 flow [2024-05-12 11:33:30,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 591 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-05-12 11:33:30,971 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 440 flow [2024-05-12 11:33:30,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-05-12 11:33:30,974 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-05-12 11:33:30,974 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 440 flow [2024-05-12 11:33:30,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:30,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:30,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:30,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:33:30,974 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:30,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:30,975 INFO L85 PathProgramCache]: Analyzing trace with hash -996512192, now seen corresponding path program 1 times [2024-05-12 11:33:30,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:30,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012422105] [2024-05-12 11:33:30,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:30,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:35,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:35,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012422105] [2024-05-12 11:33:35,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012422105] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:35,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:35,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:33:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064370232] [2024-05-12 11:33:35,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:35,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:33:35,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:33:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:33:35,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:35,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 440 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:35,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:35,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:35,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:36,000 INFO L124 PetriNetUnfolderBase]: 636/1173 cut-off events. [2024-05-12 11:33:36,001 INFO L125 PetriNetUnfolderBase]: For 2962/2962 co-relation queries the response was YES. [2024-05-12 11:33:36,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 1173 events. 636/1173 cut-off events. For 2962/2962 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6293 event pairs, 142 based on Foata normal form. 6/1144 useless extension candidates. Maximal degree in co-relation 3809. Up to 759 conditions per place. [2024-05-12 11:33:36,008 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 77 selfloop transitions, 21 changer transitions 0/105 dead transitions. [2024-05-12 11:33:36,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 776 flow [2024-05-12 11:33:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:33:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:33:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-05-12 11:33:36,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2024-05-12 11:33:36,010 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 440 flow. Second operand 8 states and 147 transitions. [2024-05-12 11:33:36,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 776 flow [2024-05-12 11:33:36,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 105 transitions, 734 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 11:33:36,019 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 498 flow [2024-05-12 11:33:36,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=498, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-05-12 11:33:36,020 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2024-05-12 11:33:36,020 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 498 flow [2024-05-12 11:33:36,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:36,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:36,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:33:36,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:36,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -757713302, now seen corresponding path program 2 times [2024-05-12 11:33:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:36,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224009230] [2024-05-12 11:33:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:36,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224009230] [2024-05-12 11:33:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224009230] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:40,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:40,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:33:40,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746158711] [2024-05-12 11:33:40,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:40,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:33:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:40,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:33:40,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:33:40,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:40,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:40,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:40,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:40,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:41,099 INFO L124 PetriNetUnfolderBase]: 669/1286 cut-off events. [2024-05-12 11:33:41,099 INFO L125 PetriNetUnfolderBase]: For 3659/3659 co-relation queries the response was YES. [2024-05-12 11:33:41,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 1286 events. 669/1286 cut-off events. For 3659/3659 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7247 event pairs, 189 based on Foata normal form. 3/1241 useless extension candidates. Maximal degree in co-relation 4470. Up to 997 conditions per place. [2024-05-12 11:33:41,106 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 79 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-05-12 11:33:41,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 103 transitions, 810 flow [2024-05-12 11:33:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:33:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:33:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-05-12 11:33:41,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2024-05-12 11:33:41,108 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 498 flow. Second operand 8 states and 138 transitions. [2024-05-12 11:33:41,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 103 transitions, 810 flow [2024-05-12 11:33:41,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 103 transitions, 783 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-05-12 11:33:41,113 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 542 flow [2024-05-12 11:33:41,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=542, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2024-05-12 11:33:41,114 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2024-05-12 11:33:41,114 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 542 flow [2024-05-12 11:33:41,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:41,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:41,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:41,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:33:41,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:41,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash -649966020, now seen corresponding path program 3 times [2024-05-12 11:33:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:41,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852834131] [2024-05-12 11:33:41,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:45,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852834131] [2024-05-12 11:33:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852834131] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:33:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720188469] [2024-05-12 11:33:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:45,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:33:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:33:45,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:33:45,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:45,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:45,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:45,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:45,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:46,250 INFO L124 PetriNetUnfolderBase]: 663/1280 cut-off events. [2024-05-12 11:33:46,251 INFO L125 PetriNetUnfolderBase]: For 4000/4000 co-relation queries the response was YES. [2024-05-12 11:33:46,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 1280 events. 663/1280 cut-off events. For 4000/4000 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7229 event pairs, 191 based on Foata normal form. 3/1235 useless extension candidates. Maximal degree in co-relation 4511. Up to 1035 conditions per place. [2024-05-12 11:33:46,258 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 75 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2024-05-12 11:33:46,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 95 transitions, 766 flow [2024-05-12 11:33:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:33:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:33:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-05-12 11:33:46,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2024-05-12 11:33:46,260 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 542 flow. Second operand 7 states and 118 transitions. [2024-05-12 11:33:46,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 95 transitions, 766 flow [2024-05-12 11:33:46,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 95 transitions, 738 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 11:33:46,267 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 545 flow [2024-05-12 11:33:46,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2024-05-12 11:33:46,268 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2024-05-12 11:33:46,268 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 545 flow [2024-05-12 11:33:46,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:46,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:46,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:46,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:33:46,268 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:46,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1759939470, now seen corresponding path program 1 times [2024-05-12 11:33:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155560653] [2024-05-12 11:33:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:51,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:51,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155560653] [2024-05-12 11:33:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155560653] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:51,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:33:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806838304] [2024-05-12 11:33:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:51,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:33:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:51,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:33:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:33:51,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:51,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 545 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:51,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:51,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:51,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:51,870 INFO L124 PetriNetUnfolderBase]: 683/1268 cut-off events. [2024-05-12 11:33:51,871 INFO L125 PetriNetUnfolderBase]: For 4065/4065 co-relation queries the response was YES. [2024-05-12 11:33:51,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4617 conditions, 1268 events. 683/1268 cut-off events. For 4065/4065 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7030 event pairs, 146 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 4577. Up to 974 conditions per place. [2024-05-12 11:33:51,919 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 85 selfloop transitions, 19 changer transitions 0/111 dead transitions. [2024-05-12 11:33:51,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 111 transitions, 894 flow [2024-05-12 11:33:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:33:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:33:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-05-12 11:33:51,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2024-05-12 11:33:51,922 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 545 flow. Second operand 7 states and 129 transitions. [2024-05-12 11:33:51,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 111 transitions, 894 flow [2024-05-12 11:33:51,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 863 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-05-12 11:33:51,929 INFO L231 Difference]: Finished difference. Result has 85 places, 83 transitions, 611 flow [2024-05-12 11:33:51,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=85, PETRI_TRANSITIONS=83} [2024-05-12 11:33:51,929 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2024-05-12 11:33:51,930 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 83 transitions, 611 flow [2024-05-12 11:33:51,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:51,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:51,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:51,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:33:51,930 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:51,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1178073530, now seen corresponding path program 2 times [2024-05-12 11:33:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77252695] [2024-05-12 11:33:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:51,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77252695] [2024-05-12 11:33:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77252695] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:33:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291857421] [2024-05-12 11:33:56,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:56,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:33:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:56,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:33:56,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:33:56,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:33:56,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 83 transitions, 611 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:56,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:56,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:33:56,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:57,304 INFO L124 PetriNetUnfolderBase]: 687/1204 cut-off events. [2024-05-12 11:33:57,304 INFO L125 PetriNetUnfolderBase]: For 4446/4446 co-relation queries the response was YES. [2024-05-12 11:33:57,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4750 conditions, 1204 events. 687/1204 cut-off events. For 4446/4446 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6287 event pairs, 104 based on Foata normal form. 1/1185 useless extension candidates. Maximal degree in co-relation 4708. Up to 992 conditions per place. [2024-05-12 11:33:57,311 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 77 selfloop transitions, 28 changer transitions 0/112 dead transitions. [2024-05-12 11:33:57,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 112 transitions, 924 flow [2024-05-12 11:33:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:33:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:33:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-05-12 11:33:57,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 11:33:57,313 INFO L175 Difference]: Start difference. First operand has 85 places, 83 transitions, 611 flow. Second operand 7 states and 126 transitions. [2024-05-12 11:33:57,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 112 transitions, 924 flow [2024-05-12 11:33:57,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 112 transitions, 901 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 11:33:57,320 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 699 flow [2024-05-12 11:33:57,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=699, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2024-05-12 11:33:57,321 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2024-05-12 11:33:57,321 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 699 flow [2024-05-12 11:33:57,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:33:57,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:57,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:33:57,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:33:57,321 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:33:57,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1181792755, now seen corresponding path program 1 times [2024-05-12 11:33:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762309478] [2024-05-12 11:33:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:02,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-05-12 11:34:02,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762309478] [2024-05-12 11:34:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762309478] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:02,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:02,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:34:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975801267] [2024-05-12 11:34:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:02,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:34:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:02,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:34:02,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:34:02,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:02,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 699 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:02,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:02,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:02,624 INFO L124 PetriNetUnfolderBase]: 720/1314 cut-off events. [2024-05-12 11:34:02,624 INFO L125 PetriNetUnfolderBase]: For 5316/5316 co-relation queries the response was YES. [2024-05-12 11:34:02,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5203 conditions, 1314 events. 720/1314 cut-off events. For 5316/5316 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7252 event pairs, 154 based on Foata normal form. 3/1280 useless extension candidates. Maximal degree in co-relation 5158. Up to 827 conditions per place. [2024-05-12 11:34:02,632 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 91 selfloop transitions, 28 changer transitions 0/126 dead transitions. [2024-05-12 11:34:02,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 126 transitions, 1083 flow [2024-05-12 11:34:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-05-12 11:34:02,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-05-12 11:34:02,634 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 699 flow. Second operand 8 states and 152 transitions. [2024-05-12 11:34:02,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 126 transitions, 1083 flow [2024-05-12 11:34:02,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 126 transitions, 1041 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 11:34:02,643 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 732 flow [2024-05-12 11:34:02,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=732, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2024-05-12 11:34:02,644 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2024-05-12 11:34:02,644 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 732 flow [2024-05-12 11:34:02,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:02,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:02,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:02,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:34:02,644 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:02,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1756124455, now seen corresponding path program 2 times [2024-05-12 11:34:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544364243] [2024-05-12 11:34:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544364243] [2024-05-12 11:34:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544364243] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738887293] [2024-05-12 11:34:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:07,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:07,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:07,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 732 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:07,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:07,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:07,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:08,304 INFO L124 PetriNetUnfolderBase]: 753/1365 cut-off events. [2024-05-12 11:34:08,304 INFO L125 PetriNetUnfolderBase]: For 6241/6241 co-relation queries the response was YES. [2024-05-12 11:34:08,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 1365 events. 753/1365 cut-off events. For 6241/6241 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7529 event pairs, 168 based on Foata normal form. 3/1331 useless extension candidates. Maximal degree in co-relation 5536. Up to 851 conditions per place. [2024-05-12 11:34:08,311 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 96 selfloop transitions, 27 changer transitions 0/130 dead transitions. [2024-05-12 11:34:08,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 130 transitions, 1138 flow [2024-05-12 11:34:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:34:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:34:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 11:34:08,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-05-12 11:34:08,312 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 732 flow. Second operand 9 states and 165 transitions. [2024-05-12 11:34:08,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 130 transitions, 1138 flow [2024-05-12 11:34:08,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 130 transitions, 1068 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 11:34:08,323 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 739 flow [2024-05-12 11:34:08,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=739, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2024-05-12 11:34:08,323 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2024-05-12 11:34:08,323 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 739 flow [2024-05-12 11:34:08,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:08,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:08,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:08,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:34:08,324 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:08,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1975930299, now seen corresponding path program 3 times [2024-05-12 11:34:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984144813] [2024-05-12 11:34:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:12,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984144813] [2024-05-12 11:34:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984144813] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617898855] [2024-05-12 11:34:12,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:12,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:12,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:12,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 739 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:12,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:12,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:12,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:12,677 INFO L124 PetriNetUnfolderBase]: 786/1464 cut-off events. [2024-05-12 11:34:12,677 INFO L125 PetriNetUnfolderBase]: For 6814/6814 co-relation queries the response was YES. [2024-05-12 11:34:12,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5834 conditions, 1464 events. 786/1464 cut-off events. For 6814/6814 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8401 event pairs, 213 based on Foata normal form. 3/1421 useless extension candidates. Maximal degree in co-relation 5787. Up to 1140 conditions per place. [2024-05-12 11:34:12,684 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 98 selfloop transitions, 18 changer transitions 0/123 dead transitions. [2024-05-12 11:34:12,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 123 transitions, 1073 flow [2024-05-12 11:34:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-05-12 11:34:12,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2024-05-12 11:34:12,686 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 739 flow. Second operand 8 states and 141 transitions. [2024-05-12 11:34:12,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 123 transitions, 1073 flow [2024-05-12 11:34:12,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 123 transitions, 1029 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 11:34:12,696 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 756 flow [2024-05-12 11:34:12,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=756, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2024-05-12 11:34:12,696 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-05-12 11:34:12,696 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 756 flow [2024-05-12 11:34:12,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:12,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:12,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:12,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:34:12,696 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:12,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1449242546, now seen corresponding path program 1 times [2024-05-12 11:34:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700600733] [2024-05-12 11:34:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:16,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:16,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700600733] [2024-05-12 11:34:16,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700600733] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:16,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408558427] [2024-05-12 11:34:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:16,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:16,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:16,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:16,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:16,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 756 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:16,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:16,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:16,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:17,276 INFO L124 PetriNetUnfolderBase]: 788/1468 cut-off events. [2024-05-12 11:34:17,276 INFO L125 PetriNetUnfolderBase]: For 7079/7079 co-relation queries the response was YES. [2024-05-12 11:34:17,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1468 events. 788/1468 cut-off events. For 7079/7079 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8438 event pairs, 218 based on Foata normal form. 2/1423 useless extension candidates. Maximal degree in co-relation 5741. Up to 1202 conditions per place. [2024-05-12 11:34:17,283 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 99 selfloop transitions, 18 changer transitions 0/124 dead transitions. [2024-05-12 11:34:17,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 124 transitions, 1086 flow [2024-05-12 11:34:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-05-12 11:34:17,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46283783783783783 [2024-05-12 11:34:17,285 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 756 flow. Second operand 8 states and 137 transitions. [2024-05-12 11:34:17,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 124 transitions, 1086 flow [2024-05-12 11:34:17,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 124 transitions, 1049 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-05-12 11:34:17,295 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 800 flow [2024-05-12 11:34:17,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=800, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2024-05-12 11:34:17,295 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2024-05-12 11:34:17,295 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 800 flow [2024-05-12 11:34:17,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:17,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:17,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:34:17,296 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:17,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1612032115, now seen corresponding path program 4 times [2024-05-12 11:34:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830509542] [2024-05-12 11:34:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:21,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830509542] [2024-05-12 11:34:21,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830509542] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:21,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:21,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211565751] [2024-05-12 11:34:21,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:21,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:21,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:21,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:21,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:21,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 800 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:21,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:21,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:21,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:22,369 INFO L124 PetriNetUnfolderBase]: 782/1471 cut-off events. [2024-05-12 11:34:22,370 INFO L125 PetriNetUnfolderBase]: For 7315/7315 co-relation queries the response was YES. [2024-05-12 11:34:22,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 1471 events. 782/1471 cut-off events. For 7315/7315 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8556 event pairs, 230 based on Foata normal form. 3/1425 useless extension candidates. Maximal degree in co-relation 5808. Up to 1177 conditions per place. [2024-05-12 11:34:22,377 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 101 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2024-05-12 11:34:22,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 123 transitions, 1106 flow [2024-05-12 11:34:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-05-12 11:34:22,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-05-12 11:34:22,385 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 800 flow. Second operand 8 states and 136 transitions. [2024-05-12 11:34:22,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 123 transitions, 1106 flow [2024-05-12 11:34:22,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 123 transitions, 1061 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 11:34:22,397 INFO L231 Difference]: Finished difference. Result has 106 places, 97 transitions, 790 flow [2024-05-12 11:34:22,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=106, PETRI_TRANSITIONS=97} [2024-05-12 11:34:22,398 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-05-12 11:34:22,398 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 97 transitions, 790 flow [2024-05-12 11:34:22,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:22,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:22,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:34:22,398 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:22,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1449231665, now seen corresponding path program 1 times [2024-05-12 11:34:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344033797] [2024-05-12 11:34:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344033797] [2024-05-12 11:34:29,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344033797] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:29,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:29,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:34:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180742629] [2024-05-12 11:34:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:29,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:34:29,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:29,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:34:29,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:34:29,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:29,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 97 transitions, 790 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:29,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:29,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:29,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:30,110 INFO L124 PetriNetUnfolderBase]: 779/1450 cut-off events. [2024-05-12 11:34:30,110 INFO L125 PetriNetUnfolderBase]: For 7358/7358 co-relation queries the response was YES. [2024-05-12 11:34:30,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1450 events. 779/1450 cut-off events. For 7358/7358 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8343 event pairs, 217 based on Foata normal form. 2/1406 useless extension candidates. Maximal degree in co-relation 5738. Up to 1194 conditions per place. [2024-05-12 11:34:30,117 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 100 selfloop transitions, 17 changer transitions 0/124 dead transitions. [2024-05-12 11:34:30,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 124 transitions, 1092 flow [2024-05-12 11:34:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 11:34:30,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560810810810811 [2024-05-12 11:34:30,121 INFO L175 Difference]: Start difference. First operand has 106 places, 97 transitions, 790 flow. Second operand 8 states and 135 transitions. [2024-05-12 11:34:30,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 124 transitions, 1092 flow [2024-05-12 11:34:30,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 124 transitions, 1029 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-05-12 11:34:30,135 INFO L231 Difference]: Finished difference. Result has 106 places, 97 transitions, 765 flow [2024-05-12 11:34:30,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=765, PETRI_PLACES=106, PETRI_TRANSITIONS=97} [2024-05-12 11:34:30,135 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-05-12 11:34:30,135 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 97 transitions, 765 flow [2024-05-12 11:34:30,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:30,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:30,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:34:30,136 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:30,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2137282317, now seen corresponding path program 1 times [2024-05-12 11:34:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:30,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157145022] [2024-05-12 11:34:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157145022] [2024-05-12 11:34:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157145022] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:35,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991297787] [2024-05-12 11:34:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:35,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:35,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:35,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 97 transitions, 765 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:35,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:35,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:35,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:35,894 INFO L124 PetriNetUnfolderBase]: 795/1395 cut-off events. [2024-05-12 11:34:35,894 INFO L125 PetriNetUnfolderBase]: For 7495/7495 co-relation queries the response was YES. [2024-05-12 11:34:35,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5723 conditions, 1395 events. 795/1395 cut-off events. For 7495/7495 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7577 event pairs, 103 based on Foata normal form. 2/1373 useless extension candidates. Maximal degree in co-relation 5671. Up to 992 conditions per place. [2024-05-12 11:34:35,901 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 95 selfloop transitions, 34 changer transitions 0/136 dead transitions. [2024-05-12 11:34:35,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 1193 flow [2024-05-12 11:34:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 11:34:35,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-05-12 11:34:35,902 INFO L175 Difference]: Start difference. First operand has 106 places, 97 transitions, 765 flow. Second operand 8 states and 145 transitions. [2024-05-12 11:34:35,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 1193 flow [2024-05-12 11:34:35,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 136 transitions, 1148 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 11:34:35,916 INFO L231 Difference]: Finished difference. Result has 108 places, 100 transitions, 838 flow [2024-05-12 11:34:35,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=838, PETRI_PLACES=108, PETRI_TRANSITIONS=100} [2024-05-12 11:34:35,917 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2024-05-12 11:34:35,917 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 100 transitions, 838 flow [2024-05-12 11:34:35,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:35,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:35,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:35,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:34:35,917 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:35,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2137221867, now seen corresponding path program 2 times [2024-05-12 11:34:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136409866] [2024-05-12 11:34:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136409866] [2024-05-12 11:34:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136409866] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:41,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:41,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787607554] [2024-05-12 11:34:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:41,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:41,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:41,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 100 transitions, 838 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:41,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:41,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:41,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:41,709 INFO L124 PetriNetUnfolderBase]: 811/1423 cut-off events. [2024-05-12 11:34:41,709 INFO L125 PetriNetUnfolderBase]: For 8411/8411 co-relation queries the response was YES. [2024-05-12 11:34:41,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6044 conditions, 1423 events. 811/1423 cut-off events. For 8411/8411 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7772 event pairs, 144 based on Foata normal form. 2/1401 useless extension candidates. Maximal degree in co-relation 5991. Up to 1119 conditions per place. [2024-05-12 11:34:41,716 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 95 selfloop transitions, 33 changer transitions 0/135 dead transitions. [2024-05-12 11:34:41,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 135 transitions, 1204 flow [2024-05-12 11:34:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-05-12 11:34:41,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2024-05-12 11:34:41,723 INFO L175 Difference]: Start difference. First operand has 108 places, 100 transitions, 838 flow. Second operand 8 states and 145 transitions. [2024-05-12 11:34:41,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 135 transitions, 1204 flow [2024-05-12 11:34:41,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 135 transitions, 1144 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 11:34:41,742 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 863 flow [2024-05-12 11:34:41,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=863, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2024-05-12 11:34:41,743 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2024-05-12 11:34:41,743 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 863 flow [2024-05-12 11:34:41,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:41,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:41,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:34:41,744 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:41,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2137221743, now seen corresponding path program 1 times [2024-05-12 11:34:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043749666] [2024-05-12 11:34:41,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043749666] [2024-05-12 11:34:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043749666] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:46,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979614514] [2024-05-12 11:34:46,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:46,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:47,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:47,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 101 transitions, 863 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:47,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:47,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:47,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:47,708 INFO L124 PetriNetUnfolderBase]: 822/1451 cut-off events. [2024-05-12 11:34:47,708 INFO L125 PetriNetUnfolderBase]: For 8768/8768 co-relation queries the response was YES. [2024-05-12 11:34:47,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6108 conditions, 1451 events. 822/1451 cut-off events. For 8768/8768 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8051 event pairs, 108 based on Foata normal form. 1/1425 useless extension candidates. Maximal degree in co-relation 6054. Up to 982 conditions per place. [2024-05-12 11:34:47,716 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 110 selfloop transitions, 37 changer transitions 0/154 dead transitions. [2024-05-12 11:34:47,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 154 transitions, 1408 flow [2024-05-12 11:34:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:34:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:34:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 11:34:47,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-05-12 11:34:47,727 INFO L175 Difference]: Start difference. First operand has 112 places, 101 transitions, 863 flow. Second operand 9 states and 164 transitions. [2024-05-12 11:34:47,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 154 transitions, 1408 flow [2024-05-12 11:34:47,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 154 transitions, 1323 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 11:34:47,742 INFO L231 Difference]: Finished difference. Result has 116 places, 112 transitions, 960 flow [2024-05-12 11:34:47,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=960, PETRI_PLACES=116, PETRI_TRANSITIONS=112} [2024-05-12 11:34:47,742 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-05-12 11:34:47,743 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 112 transitions, 960 flow [2024-05-12 11:34:47,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:47,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:47,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:47,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:34:47,744 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:47,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2134420583, now seen corresponding path program 2 times [2024-05-12 11:34:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971893404] [2024-05-12 11:34:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:52,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971893404] [2024-05-12 11:34:52,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971893404] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:52,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:52,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:52,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160767781] [2024-05-12 11:34:52,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:52,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:52,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:52,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:52,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:52,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:52,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 960 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:52,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:52,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:52,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:52,936 INFO L124 PetriNetUnfolderBase]: 855/1565 cut-off events. [2024-05-12 11:34:52,936 INFO L125 PetriNetUnfolderBase]: For 10363/10363 co-relation queries the response was YES. [2024-05-12 11:34:52,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6705 conditions, 1565 events. 855/1565 cut-off events. For 10363/10363 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9033 event pairs, 193 based on Foata normal form. 3/1521 useless extension candidates. Maximal degree in co-relation 6649. Up to 955 conditions per place. [2024-05-12 11:34:52,944 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 106 selfloop transitions, 37 changer transitions 0/150 dead transitions. [2024-05-12 11:34:52,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 150 transitions, 1396 flow [2024-05-12 11:34:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-05-12 11:34:52,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-05-12 11:34:52,953 INFO L175 Difference]: Start difference. First operand has 116 places, 112 transitions, 960 flow. Second operand 8 states and 150 transitions. [2024-05-12 11:34:52,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 150 transitions, 1396 flow [2024-05-12 11:34:52,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 150 transitions, 1339 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 11:34:52,975 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 1037 flow [2024-05-12 11:34:52,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1037, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2024-05-12 11:34:52,976 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2024-05-12 11:34:52,976 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 1037 flow [2024-05-12 11:34:52,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:52,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:52,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:52,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:34:52,977 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:52,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1279248789, now seen corresponding path program 3 times [2024-05-12 11:34:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719758236] [2024-05-12 11:34:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719758236] [2024-05-12 11:34:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719758236] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:58,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341085110] [2024-05-12 11:34:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:58,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:58,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:58,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:58,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:34:58,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 1037 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:58,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:58,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:34:58,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:59,056 INFO L124 PetriNetUnfolderBase]: 875/1518 cut-off events. [2024-05-12 11:34:59,056 INFO L125 PetriNetUnfolderBase]: For 10334/10334 co-relation queries the response was YES. [2024-05-12 11:34:59,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6965 conditions, 1518 events. 875/1518 cut-off events. For 10334/10334 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8409 event pairs, 112 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 6908. Up to 1149 conditions per place. [2024-05-12 11:34:59,067 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 111 selfloop transitions, 43 changer transitions 0/161 dead transitions. [2024-05-12 11:34:59,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 161 transitions, 1547 flow [2024-05-12 11:34:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:34:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:34:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 11:34:59,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-05-12 11:34:59,068 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 1037 flow. Second operand 9 states and 161 transitions. [2024-05-12 11:34:59,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 161 transitions, 1547 flow [2024-05-12 11:34:59,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 161 transitions, 1459 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 11:34:59,090 INFO L231 Difference]: Finished difference. Result has 123 places, 124 transitions, 1142 flow [2024-05-12 11:34:59,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1142, PETRI_PLACES=123, PETRI_TRANSITIONS=124} [2024-05-12 11:34:59,091 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 82 predicate places. [2024-05-12 11:34:59,091 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 124 transitions, 1142 flow [2024-05-12 11:34:59,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:34:59,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:59,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:34:59,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:34:59,091 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:34:59,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2134425357, now seen corresponding path program 3 times [2024-05-12 11:34:59,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:59,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267521352] [2024-05-12 11:34:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267521352] [2024-05-12 11:35:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267521352] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:35:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384226211] [2024-05-12 11:35:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:04,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:35:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:35:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:35:04,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:04,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 124 transitions, 1142 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:04,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:04,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:04,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:05,031 INFO L124 PetriNetUnfolderBase]: 872/1510 cut-off events. [2024-05-12 11:35:05,031 INFO L125 PetriNetUnfolderBase]: For 10750/10750 co-relation queries the response was YES. [2024-05-12 11:35:05,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6946 conditions, 1510 events. 872/1510 cut-off events. For 10750/10750 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8221 event pairs, 132 based on Foata normal form. 2/1489 useless extension candidates. Maximal degree in co-relation 6887. Up to 1262 conditions per place. [2024-05-12 11:35:05,039 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 119 selfloop transitions, 29 changer transitions 0/155 dead transitions. [2024-05-12 11:35:05,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 1528 flow [2024-05-12 11:35:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:35:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:35:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 11:35:05,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2024-05-12 11:35:05,041 INFO L175 Difference]: Start difference. First operand has 123 places, 124 transitions, 1142 flow. Second operand 8 states and 142 transitions. [2024-05-12 11:35:05,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 1528 flow [2024-05-12 11:35:05,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 155 transitions, 1472 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 11:35:05,064 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 1149 flow [2024-05-12 11:35:05,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1149, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2024-05-12 11:35:05,065 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2024-05-12 11:35:05,065 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 1149 flow [2024-05-12 11:35:05,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:05,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:05,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:05,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:35:05,065 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:05,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1394539959, now seen corresponding path program 4 times [2024-05-12 11:35:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491536917] [2024-05-12 11:35:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:10,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491536917] [2024-05-12 11:35:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491536917] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:10,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:35:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155498243] [2024-05-12 11:35:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:35:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:10,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:35:10,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:35:10,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:10,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 1149 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:10,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:10,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:10,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:11,064 INFO L124 PetriNetUnfolderBase]: 912/1637 cut-off events. [2024-05-12 11:35:11,065 INFO L125 PetriNetUnfolderBase]: For 11751/11751 co-relation queries the response was YES. [2024-05-12 11:35:11,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7452 conditions, 1637 events. 912/1637 cut-off events. For 11751/11751 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9429 event pairs, 155 based on Foata normal form. 1/1595 useless extension candidates. Maximal degree in co-relation 7391. Up to 947 conditions per place. [2024-05-12 11:35:11,075 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 122 selfloop transitions, 46 changer transitions 0/175 dead transitions. [2024-05-12 11:35:11,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 175 transitions, 1750 flow [2024-05-12 11:35:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:35:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:35:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-05-12 11:35:11,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195195195195195 [2024-05-12 11:35:11,076 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 1149 flow. Second operand 9 states and 173 transitions. [2024-05-12 11:35:11,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 175 transitions, 1750 flow [2024-05-12 11:35:11,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 175 transitions, 1681 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 11:35:11,102 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 1273 flow [2024-05-12 11:35:11,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1273, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2024-05-12 11:35:11,102 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2024-05-12 11:35:11,102 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 1273 flow [2024-05-12 11:35:11,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:11,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:11,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:11,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:35:11,103 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:11,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1394544609, now seen corresponding path program 5 times [2024-05-12 11:35:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611848386] [2024-05-12 11:35:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611848386] [2024-05-12 11:35:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611848386] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:35:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449071124] [2024-05-12 11:35:16,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:16,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:35:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:35:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:35:16,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:16,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 1273 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:16,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:16,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:16,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:17,320 INFO L124 PetriNetUnfolderBase]: 929/1594 cut-off events. [2024-05-12 11:35:17,320 INFO L125 PetriNetUnfolderBase]: For 12894/12894 co-relation queries the response was YES. [2024-05-12 11:35:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7891 conditions, 1594 events. 929/1594 cut-off events. For 12894/12894 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8796 event pairs, 119 based on Foata normal form. 1/1574 useless extension candidates. Maximal degree in co-relation 7828. Up to 1259 conditions per place. [2024-05-12 11:35:17,330 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 124 selfloop transitions, 46 changer transitions 0/177 dead transitions. [2024-05-12 11:35:17,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 177 transitions, 1837 flow [2024-05-12 11:35:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:35:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:35:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 11:35:17,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894894894894895 [2024-05-12 11:35:17,331 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 1273 flow. Second operand 9 states and 163 transitions. [2024-05-12 11:35:17,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 177 transitions, 1837 flow [2024-05-12 11:35:17,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 177 transitions, 1757 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:35:17,361 INFO L231 Difference]: Finished difference. Result has 135 places, 140 transitions, 1451 flow [2024-05-12 11:35:17,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1451, PETRI_PLACES=135, PETRI_TRANSITIONS=140} [2024-05-12 11:35:17,362 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-05-12 11:35:17,362 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 140 transitions, 1451 flow [2024-05-12 11:35:17,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:17,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:17,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:17,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:35:17,363 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:17,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1394717589, now seen corresponding path program 6 times [2024-05-12 11:35:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574286557] [2024-05-12 11:35:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:23,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:23,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574286557] [2024-05-12 11:35:23,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574286557] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:23,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:23,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:35:23,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714100269] [2024-05-12 11:35:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:23,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:35:23,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:23,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:35:23,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:35:23,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:23,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 140 transitions, 1451 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:23,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:23,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:23,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:24,067 INFO L124 PetriNetUnfolderBase]: 962/1732 cut-off events. [2024-05-12 11:35:24,067 INFO L125 PetriNetUnfolderBase]: For 15132/15132 co-relation queries the response was YES. [2024-05-12 11:35:24,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8532 conditions, 1732 events. 962/1732 cut-off events. For 15132/15132 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10050 event pairs, 175 based on Foata normal form. 3/1686 useless extension candidates. Maximal degree in co-relation 8466. Up to 1122 conditions per place. [2024-05-12 11:35:24,078 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 144 selfloop transitions, 39 changer transitions 0/190 dead transitions. [2024-05-12 11:35:24,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 190 transitions, 2042 flow [2024-05-12 11:35:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:35:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:35:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-05-12 11:35:24,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918918918918919 [2024-05-12 11:35:24,079 INFO L175 Difference]: Start difference. First operand has 135 places, 140 transitions, 1451 flow. Second operand 10 states and 182 transitions. [2024-05-12 11:35:24,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 190 transitions, 2042 flow [2024-05-12 11:35:24,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 190 transitions, 1967 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-05-12 11:35:24,116 INFO L231 Difference]: Finished difference. Result has 141 places, 144 transitions, 1531 flow [2024-05-12 11:35:24,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1531, PETRI_PLACES=141, PETRI_TRANSITIONS=144} [2024-05-12 11:35:24,116 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 100 predicate places. [2024-05-12 11:35:24,116 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 144 transitions, 1531 flow [2024-05-12 11:35:24,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:24,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:24,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:24,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:35:24,117 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:24,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -203952529, now seen corresponding path program 7 times [2024-05-12 11:35:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074053902] [2024-05-12 11:35:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074053902] [2024-05-12 11:35:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074053902] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:28,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:28,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:35:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316597026] [2024-05-12 11:35:28,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:28,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:35:28,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:28,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:35:28,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:35:28,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:28,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 144 transitions, 1531 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:28,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:28,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:28,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:29,720 INFO L124 PetriNetUnfolderBase]: 982/1804 cut-off events. [2024-05-12 11:35:29,721 INFO L125 PetriNetUnfolderBase]: For 15912/15912 co-relation queries the response was YES. [2024-05-12 11:35:29,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8950 conditions, 1804 events. 982/1804 cut-off events. For 15912/15912 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10826 event pairs, 243 based on Foata normal form. 1/1751 useless extension candidates. Maximal degree in co-relation 8883. Up to 1495 conditions per place. [2024-05-12 11:35:29,732 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 150 selfloop transitions, 31 changer transitions 0/188 dead transitions. [2024-05-12 11:35:29,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 188 transitions, 2119 flow [2024-05-12 11:35:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:35:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:35:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-05-12 11:35:29,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2024-05-12 11:35:29,734 INFO L175 Difference]: Start difference. First operand has 141 places, 144 transitions, 1531 flow. Second operand 10 states and 168 transitions. [2024-05-12 11:35:29,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 188 transitions, 2119 flow [2024-05-12 11:35:29,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 188 transitions, 2019 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 11:35:29,772 INFO L231 Difference]: Finished difference. Result has 145 places, 153 transitions, 1661 flow [2024-05-12 11:35:29,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1661, PETRI_PLACES=145, PETRI_TRANSITIONS=153} [2024-05-12 11:35:29,773 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 104 predicate places. [2024-05-12 11:35:29,773 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 153 transitions, 1661 flow [2024-05-12 11:35:29,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:29,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:29,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:29,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:35:29,774 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:29,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1986019787, now seen corresponding path program 8 times [2024-05-12 11:35:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278906233] [2024-05-12 11:35:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:35,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-05-12 11:35:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278906233] [2024-05-12 11:35:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278906233] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:35,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:35,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:35:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61397391] [2024-05-12 11:35:35,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:35,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:35:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:35,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:35:35,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:35:35,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:35,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 153 transitions, 1661 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:35,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:35,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:35,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:35,926 INFO L124 PetriNetUnfolderBase]: 1002/1816 cut-off events. [2024-05-12 11:35:35,927 INFO L125 PetriNetUnfolderBase]: For 16712/16712 co-relation queries the response was YES. [2024-05-12 11:35:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8968 conditions, 1816 events. 1002/1816 cut-off events. For 16712/16712 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10794 event pairs, 267 based on Foata normal form. 3/1771 useless extension candidates. Maximal degree in co-relation 8898. Up to 1487 conditions per place. [2024-05-12 11:35:35,939 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 159 selfloop transitions, 21 changer transitions 0/187 dead transitions. [2024-05-12 11:35:35,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 187 transitions, 2153 flow [2024-05-12 11:35:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:35:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:35:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 11:35:35,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-05-12 11:35:35,940 INFO L175 Difference]: Start difference. First operand has 145 places, 153 transitions, 1661 flow. Second operand 9 states and 154 transitions. [2024-05-12 11:35:35,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 187 transitions, 2153 flow [2024-05-12 11:35:35,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 187 transitions, 1999 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-05-12 11:35:35,987 INFO L231 Difference]: Finished difference. Result has 147 places, 155 transitions, 1593 flow [2024-05-12 11:35:35,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1593, PETRI_PLACES=147, PETRI_TRANSITIONS=155} [2024-05-12 11:35:35,987 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 106 predicate places. [2024-05-12 11:35:35,988 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 155 transitions, 1593 flow [2024-05-12 11:35:35,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:35,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:35,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:35,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:35:35,988 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:35,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379069, now seen corresponding path program 1 times [2024-05-12 11:35:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:35,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196758694] [2024-05-12 11:35:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196758694] [2024-05-12 11:35:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196758694] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:35:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661000942] [2024-05-12 11:35:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:40,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:35:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:35:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:35:40,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 11:35:40,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 155 transitions, 1593 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:40,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:40,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 11:35:40,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:40,828 INFO L124 PetriNetUnfolderBase]: 842/1562 cut-off events. [2024-05-12 11:35:40,828 INFO L125 PetriNetUnfolderBase]: For 15032/15032 co-relation queries the response was YES. [2024-05-12 11:35:40,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7718 conditions, 1562 events. 842/1562 cut-off events. For 15032/15032 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9513 event pairs, 303 based on Foata normal form. 2/1517 useless extension candidates. Maximal degree in co-relation 7647. Up to 1286 conditions per place. [2024-05-12 11:35:40,838 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 157 selfloop transitions, 19 changer transitions 0/184 dead transitions. [2024-05-12 11:35:40,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 184 transitions, 2039 flow [2024-05-12 11:35:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:35:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:35:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 11:35:40,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2024-05-12 11:35:40,839 INFO L175 Difference]: Start difference. First operand has 147 places, 155 transitions, 1593 flow. Second operand 8 states and 146 transitions. [2024-05-12 11:35:40,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 184 transitions, 2039 flow [2024-05-12 11:35:40,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 184 transitions, 1963 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-05-12 11:35:40,878 INFO L231 Difference]: Finished difference. Result has 148 places, 157 transitions, 1584 flow [2024-05-12 11:35:40,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1584, PETRI_PLACES=148, PETRI_TRANSITIONS=157} [2024-05-12 11:35:40,879 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places. [2024-05-12 11:35:40,879 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 157 transitions, 1584 flow [2024-05-12 11:35:40,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:40,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:40,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:40,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:35:40,880 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:40,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1670199867, now seen corresponding path program 1 times [2024-05-12 11:35:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250095066] [2024-05-12 11:35:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:41,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250095066] [2024-05-12 11:35:41,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250095066] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:41,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:41,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:35:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004437687] [2024-05-12 11:35:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:41,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:35:41,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:35:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:35:41,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-05-12 11:35:41,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 157 transitions, 1584 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:41,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:41,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-05-12 11:35:41,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:41,797 INFO L124 PetriNetUnfolderBase]: 2037/3617 cut-off events. [2024-05-12 11:35:41,797 INFO L125 PetriNetUnfolderBase]: For 22884/22936 co-relation queries the response was YES. [2024-05-12 11:35:41,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16413 conditions, 3617 events. 2037/3617 cut-off events. For 22884/22936 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23982 event pairs, 384 based on Foata normal form. 25/3489 useless extension candidates. Maximal degree in co-relation 16342. Up to 1213 conditions per place. [2024-05-12 11:35:41,819 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 171 selfloop transitions, 81 changer transitions 155/451 dead transitions. [2024-05-12 11:35:41,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 451 transitions, 5352 flow [2024-05-12 11:35:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:35:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:35:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-05-12 11:35:41,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5735735735735735 [2024-05-12 11:35:41,821 INFO L175 Difference]: Start difference. First operand has 148 places, 157 transitions, 1584 flow. Second operand 9 states and 191 transitions. [2024-05-12 11:35:41,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 451 transitions, 5352 flow [2024-05-12 11:35:41,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 451 transitions, 5239 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 11:35:41,890 INFO L231 Difference]: Finished difference. Result has 157 places, 202 transitions, 2297 flow [2024-05-12 11:35:41,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2297, PETRI_PLACES=157, PETRI_TRANSITIONS=202} [2024-05-12 11:35:41,891 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 116 predicate places. [2024-05-12 11:35:41,891 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 202 transitions, 2297 flow [2024-05-12 11:35:41,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:41,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:41,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:41,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:35:41,891 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:41,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2107528278, now seen corresponding path program 1 times [2024-05-12 11:35:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:41,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580284387] [2024-05-12 11:35:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:48,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580284387] [2024-05-12 11:35:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580284387] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:35:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124557906] [2024-05-12 11:35:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:35:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:35:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:35:48,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:48,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 202 transitions, 2297 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:48,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:48,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:48,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:49,869 INFO L124 PetriNetUnfolderBase]: 1942/3687 cut-off events. [2024-05-12 11:35:49,870 INFO L125 PetriNetUnfolderBase]: For 37782/37852 co-relation queries the response was YES. [2024-05-12 11:35:49,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19526 conditions, 3687 events. 1942/3687 cut-off events. For 37782/37852 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25919 event pairs, 423 based on Foata normal form. 65/3733 useless extension candidates. Maximal degree in co-relation 19448. Up to 2381 conditions per place. [2024-05-12 11:35:49,899 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 247 selfloop transitions, 76 changer transitions 17/349 dead transitions. [2024-05-12 11:35:49,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 349 transitions, 4499 flow [2024-05-12 11:35:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:35:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:35:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 11:35:49,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2024-05-12 11:35:49,901 INFO L175 Difference]: Start difference. First operand has 157 places, 202 transitions, 2297 flow. Second operand 10 states and 186 transitions. [2024-05-12 11:35:49,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 349 transitions, 4499 flow [2024-05-12 11:35:50,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 349 transitions, 4457 flow, removed 21 selfloop flow, removed 0 redundant places. [2024-05-12 11:35:50,020 INFO L231 Difference]: Finished difference. Result has 171 places, 252 transitions, 3178 flow [2024-05-12 11:35:50,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3178, PETRI_PLACES=171, PETRI_TRANSITIONS=252} [2024-05-12 11:35:50,020 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 130 predicate places. [2024-05-12 11:35:50,020 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 252 transitions, 3178 flow [2024-05-12 11:35:50,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:50,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:50,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:50,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:35:50,021 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:50,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 913438192, now seen corresponding path program 2 times [2024-05-12 11:35:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68061548] [2024-05-12 11:35:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:35:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:55,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68061548] [2024-05-12 11:35:55,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68061548] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:55,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:35:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515978961] [2024-05-12 11:35:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:55,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:35:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:35:55,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:35:56,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:35:56,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 252 transitions, 3178 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:56,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:56,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:35:56,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:57,274 INFO L124 PetriNetUnfolderBase]: 2054/3747 cut-off events. [2024-05-12 11:35:57,275 INFO L125 PetriNetUnfolderBase]: For 52800/52927 co-relation queries the response was YES. [2024-05-12 11:35:57,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21722 conditions, 3747 events. 2054/3747 cut-off events. For 52800/52927 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25642 event pairs, 371 based on Foata normal form. 114/3824 useless extension candidates. Maximal degree in co-relation 21636. Up to 1235 conditions per place. [2024-05-12 11:35:57,306 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 203 selfloop transitions, 105 changer transitions 3/320 dead transitions. [2024-05-12 11:35:57,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 320 transitions, 4335 flow [2024-05-12 11:35:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:35:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:35:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 11:35:57,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-05-12 11:35:57,307 INFO L175 Difference]: Start difference. First operand has 171 places, 252 transitions, 3178 flow. Second operand 10 states and 189 transitions. [2024-05-12 11:35:57,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 320 transitions, 4335 flow [2024-05-12 11:35:57,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 320 transitions, 4231 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-05-12 11:35:57,457 INFO L231 Difference]: Finished difference. Result has 178 places, 258 transitions, 3496 flow [2024-05-12 11:35:57,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3091, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3496, PETRI_PLACES=178, PETRI_TRANSITIONS=258} [2024-05-12 11:35:57,458 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 137 predicate places. [2024-05-12 11:35:57,458 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 258 transitions, 3496 flow [2024-05-12 11:35:57,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:35:57,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:57,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:35:57,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:35:57,458 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:35:57,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1829367436, now seen corresponding path program 3 times [2024-05-12 11:35:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997312123] [2024-05-12 11:35:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:36:02,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:02,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997312123] [2024-05-12 11:36:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997312123] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:02,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:02,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889661172] [2024-05-12 11:36:02,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:02,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:02,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:02,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:02,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:02,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:36:02,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 258 transitions, 3496 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:02,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:02,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:36:02,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:04,287 INFO L124 PetriNetUnfolderBase]: 2297/4220 cut-off events. [2024-05-12 11:36:04,287 INFO L125 PetriNetUnfolderBase]: For 74483/74633 co-relation queries the response was YES. [2024-05-12 11:36:04,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25644 conditions, 4220 events. 2297/4220 cut-off events. For 74483/74633 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29701 event pairs, 491 based on Foata normal form. 118/4289 useless extension candidates. Maximal degree in co-relation 25555. Up to 2114 conditions per place. [2024-05-12 11:36:04,325 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 208 selfloop transitions, 111 changer transitions 0/328 dead transitions. [2024-05-12 11:36:04,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 328 transitions, 4697 flow [2024-05-12 11:36:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:36:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:36:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-05-12 11:36:04,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378378378378378 [2024-05-12 11:36:04,327 INFO L175 Difference]: Start difference. First operand has 178 places, 258 transitions, 3496 flow. Second operand 10 states and 199 transitions. [2024-05-12 11:36:04,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 328 transitions, 4697 flow [2024-05-12 11:36:04,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 328 transitions, 4623 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 11:36:04,620 INFO L231 Difference]: Finished difference. Result has 184 places, 266 transitions, 3799 flow [2024-05-12 11:36:04,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3799, PETRI_PLACES=184, PETRI_TRANSITIONS=266} [2024-05-12 11:36:04,621 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 143 predicate places. [2024-05-12 11:36:04,621 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 266 transitions, 3799 flow [2024-05-12 11:36:04,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:04,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:04,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:04,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:36:04,622 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:04,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash 915315862, now seen corresponding path program 4 times [2024-05-12 11:36:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:04,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987820949] [2024-05-12 11:36:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:36:10,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:10,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987820949] [2024-05-12 11:36:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987820949] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:10,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:10,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785578231] [2024-05-12 11:36:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:10,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:36:10,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 266 transitions, 3799 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:10,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:10,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:36:10,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:11,595 INFO L124 PetriNetUnfolderBase]: 2345/4432 cut-off events. [2024-05-12 11:36:11,595 INFO L125 PetriNetUnfolderBase]: For 79035/79153 co-relation queries the response was YES. [2024-05-12 11:36:11,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27521 conditions, 4432 events. 2345/4432 cut-off events. For 79035/79153 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 32260 event pairs, 645 based on Foata normal form. 104/4491 useless extension candidates. Maximal degree in co-relation 27430. Up to 3150 conditions per place. [2024-05-12 11:36:11,635 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 170 selfloop transitions, 132 changer transitions 0/311 dead transitions. [2024-05-12 11:36:11,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 311 transitions, 4640 flow [2024-05-12 11:36:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:36:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:36:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-05-12 11:36:11,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837837837837838 [2024-05-12 11:36:11,636 INFO L175 Difference]: Start difference. First operand has 184 places, 266 transitions, 3799 flow. Second operand 10 states and 179 transitions. [2024-05-12 11:36:11,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 311 transitions, 4640 flow [2024-05-12 11:36:11,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 311 transitions, 4420 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-05-12 11:36:11,874 INFO L231 Difference]: Finished difference. Result has 188 places, 269 transitions, 3918 flow [2024-05-12 11:36:11,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3583, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3918, PETRI_PLACES=188, PETRI_TRANSITIONS=269} [2024-05-12 11:36:11,875 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 147 predicate places. [2024-05-12 11:36:11,875 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 269 transitions, 3918 flow [2024-05-12 11:36:11,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:11,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:11,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:11,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:36:11,875 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:11,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 138963731, now seen corresponding path program 1 times [2024-05-12 11:36:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361100406] [2024-05-12 11:36:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:18,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-05-12 11:36:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:18,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361100406] [2024-05-12 11:36:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361100406] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:18,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:36:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002737274] [2024-05-12 11:36:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:18,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:36:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:36:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:36:18,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 11:36:18,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 269 transitions, 3918 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:18,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:18,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 11:36:18,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:19,329 INFO L124 PetriNetUnfolderBase]: 2199/4221 cut-off events. [2024-05-12 11:36:19,329 INFO L125 PetriNetUnfolderBase]: For 77362/77502 co-relation queries the response was YES. [2024-05-12 11:36:19,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26457 conditions, 4221 events. 2199/4221 cut-off events. For 77362/77502 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 31339 event pairs, 548 based on Foata normal form. 125/4287 useless extension candidates. Maximal degree in co-relation 26364. Up to 2505 conditions per place. [2024-05-12 11:36:19,366 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 221 selfloop transitions, 97 changer transitions 0/329 dead transitions. [2024-05-12 11:36:19,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 329 transitions, 4969 flow [2024-05-12 11:36:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:36:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:36:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2024-05-12 11:36:19,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2024-05-12 11:36:19,368 INFO L175 Difference]: Start difference. First operand has 188 places, 269 transitions, 3918 flow. Second operand 12 states and 225 transitions. [2024-05-12 11:36:19,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 329 transitions, 4969 flow [2024-05-12 11:36:19,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 329 transitions, 4775 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 11:36:19,563 INFO L231 Difference]: Finished difference. Result has 194 places, 274 transitions, 4018 flow [2024-05-12 11:36:19,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3736, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4018, PETRI_PLACES=194, PETRI_TRANSITIONS=274} [2024-05-12 11:36:19,563 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 153 predicate places. [2024-05-12 11:36:19,563 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 274 transitions, 4018 flow [2024-05-12 11:36:19,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:19,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:19,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:19,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:36:19,564 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:19,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1002151822, now seen corresponding path program 5 times [2024-05-12 11:36:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050167744] [2024-05-12 11:36:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:25,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-05-12 11:36:25,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:25,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050167744] [2024-05-12 11:36:25,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050167744] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:25,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722528431] [2024-05-12 11:36:25,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:25,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:25,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:25,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:25,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:36:25,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 274 transitions, 4018 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:25,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:25,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:36:25,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:26,738 INFO L124 PetriNetUnfolderBase]: 2424/4575 cut-off events. [2024-05-12 11:36:26,738 INFO L125 PetriNetUnfolderBase]: For 87077/87212 co-relation queries the response was YES. [2024-05-12 11:36:26,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29279 conditions, 4575 events. 2424/4575 cut-off events. For 87077/87212 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 33372 event pairs, 669 based on Foata normal form. 123/4650 useless extension candidates. Maximal degree in co-relation 29184. Up to 3563 conditions per place. [2024-05-12 11:36:26,778 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 224 selfloop transitions, 87 changer transitions 0/320 dead transitions. [2024-05-12 11:36:26,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 320 transitions, 4889 flow [2024-05-12 11:36:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:36:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:36:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 11:36:26,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-05-12 11:36:26,779 INFO L175 Difference]: Start difference. First operand has 194 places, 274 transitions, 4018 flow. Second operand 10 states and 176 transitions. [2024-05-12 11:36:26,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 320 transitions, 4889 flow [2024-05-12 11:36:27,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 320 transitions, 4765 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 11:36:27,029 INFO L231 Difference]: Finished difference. Result has 198 places, 277 transitions, 4145 flow [2024-05-12 11:36:27,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3894, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4145, PETRI_PLACES=198, PETRI_TRANSITIONS=277} [2024-05-12 11:36:27,029 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 157 predicate places. [2024-05-12 11:36:27,029 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 277 transitions, 4145 flow [2024-05-12 11:36:27,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:27,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:27,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:27,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:36:27,030 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:27,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1002007672, now seen corresponding path program 6 times [2024-05-12 11:36:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086593925] [2024-05-12 11:36:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:36:32,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086593925] [2024-05-12 11:36:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086593925] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:32,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:32,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711660029] [2024-05-12 11:36:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:32,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:32,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:32,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:32,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:36:32,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 277 transitions, 4145 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:32,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:32,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:36:32,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:34,432 INFO L124 PetriNetUnfolderBase]: 2426/4555 cut-off events. [2024-05-12 11:36:34,432 INFO L125 PetriNetUnfolderBase]: For 86029/86172 co-relation queries the response was YES. [2024-05-12 11:36:34,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29239 conditions, 4555 events. 2426/4555 cut-off events. For 86029/86172 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 32946 event pairs, 670 based on Foata normal form. 113/4610 useless extension candidates. Maximal degree in co-relation 29142. Up to 3515 conditions per place. [2024-05-12 11:36:34,470 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 214 selfloop transitions, 96 changer transitions 0/319 dead transitions. [2024-05-12 11:36:34,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 319 transitions, 4963 flow [2024-05-12 11:36:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:36:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:36:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-05-12 11:36:34,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2024-05-12 11:36:34,471 INFO L175 Difference]: Start difference. First operand has 198 places, 277 transitions, 4145 flow. Second operand 10 states and 177 transitions. [2024-05-12 11:36:34,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 319 transitions, 4963 flow [2024-05-12 11:36:34,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 319 transitions, 4724 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 11:36:34,712 INFO L231 Difference]: Finished difference. Result has 199 places, 278 transitions, 4130 flow [2024-05-12 11:36:34,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3906, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4130, PETRI_PLACES=199, PETRI_TRANSITIONS=278} [2024-05-12 11:36:34,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 158 predicate places. [2024-05-12 11:36:34,712 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 278 transitions, 4130 flow [2024-05-12 11:36:34,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:34,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:34,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:34,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:36:34,713 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:34,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1831350644, now seen corresponding path program 7 times [2024-05-12 11:36:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:34,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655285069] [2024-05-12 11:36:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:34,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:36:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655285069] [2024-05-12 11:36:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655285069] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:40,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:40,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577665786] [2024-05-12 11:36:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:40,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:40,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:36:40,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 278 transitions, 4130 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:40,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:40,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:36:40,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:41,764 INFO L124 PetriNetUnfolderBase]: 2491/4628 cut-off events. [2024-05-12 11:36:41,764 INFO L125 PetriNetUnfolderBase]: For 89507/89643 co-relation queries the response was YES. [2024-05-12 11:36:41,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29955 conditions, 4628 events. 2491/4628 cut-off events. For 89507/89643 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33319 event pairs, 570 based on Foata normal form. 116/4667 useless extension candidates. Maximal degree in co-relation 29858. Up to 3224 conditions per place. [2024-05-12 11:36:41,810 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 180 selfloop transitions, 142 changer transitions 0/331 dead transitions. [2024-05-12 11:36:41,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 331 transitions, 5140 flow [2024-05-12 11:36:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:36:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:36:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 11:36:41,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027027027027027 [2024-05-12 11:36:41,812 INFO L175 Difference]: Start difference. First operand has 199 places, 278 transitions, 4130 flow. Second operand 10 states and 186 transitions. [2024-05-12 11:36:41,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 331 transitions, 5140 flow [2024-05-12 11:36:42,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 331 transitions, 4936 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-05-12 11:36:42,187 INFO L231 Difference]: Finished difference. Result has 201 places, 282 transitions, 4307 flow [2024-05-12 11:36:42,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3926, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4307, PETRI_PLACES=201, PETRI_TRANSITIONS=282} [2024-05-12 11:36:42,188 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 160 predicate places. [2024-05-12 11:36:42,188 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 282 transitions, 4307 flow [2024-05-12 11:36:42,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:42,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:42,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:42,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:36:42,189 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:42,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1831354364, now seen corresponding path program 8 times [2024-05-12 11:36:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578408510] [2024-05-12 11:36:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:36:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578408510] [2024-05-12 11:36:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578408510] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382875700] [2024-05-12 11:36:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:47,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:47,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:36:47,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 282 transitions, 4307 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:47,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:47,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:36:47,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:49,131 INFO L124 PetriNetUnfolderBase]: 2539/4710 cut-off events. [2024-05-12 11:36:49,131 INFO L125 PetriNetUnfolderBase]: For 94370/94508 co-relation queries the response was YES. [2024-05-12 11:36:49,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30942 conditions, 4710 events. 2539/4710 cut-off events. For 94370/94508 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 34010 event pairs, 638 based on Foata normal form. 116/4738 useless extension candidates. Maximal degree in co-relation 30844. Up to 3592 conditions per place. [2024-05-12 11:36:49,176 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 187 selfloop transitions, 137 changer transitions 0/333 dead transitions. [2024-05-12 11:36:49,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 333 transitions, 5248 flow [2024-05-12 11:36:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:36:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:36:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-05-12 11:36:49,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-05-12 11:36:49,177 INFO L175 Difference]: Start difference. First operand has 201 places, 282 transitions, 4307 flow. Second operand 10 states and 184 transitions. [2024-05-12 11:36:49,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 333 transitions, 5248 flow [2024-05-12 11:36:49,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 333 transitions, 4772 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-05-12 11:36:49,513 INFO L231 Difference]: Finished difference. Result has 202 places, 286 transitions, 4215 flow [2024-05-12 11:36:49,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3847, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4215, PETRI_PLACES=202, PETRI_TRANSITIONS=286} [2024-05-12 11:36:49,513 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 161 predicate places. [2024-05-12 11:36:49,514 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 286 transitions, 4215 flow [2024-05-12 11:36:49,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:49,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:49,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:49,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:36:49,514 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:49,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash 281066801, now seen corresponding path program 2 times [2024-05-12 11:36:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:49,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778572134] [2024-05-12 11:36:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:49,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:36:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778572134] [2024-05-12 11:36:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778572134] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550611359] [2024-05-12 11:36:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:54,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:54,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:54,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:36:54,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 286 transitions, 4215 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:54,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:54,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:36:54,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:56,463 INFO L124 PetriNetUnfolderBase]: 2583/4768 cut-off events. [2024-05-12 11:36:56,463 INFO L125 PetriNetUnfolderBase]: For 96670/96817 co-relation queries the response was YES. [2024-05-12 11:36:56,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30774 conditions, 4768 events. 2583/4768 cut-off events. For 96670/96817 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 34495 event pairs, 544 based on Foata normal form. 127/4807 useless extension candidates. Maximal degree in co-relation 30676. Up to 3152 conditions per place. [2024-05-12 11:36:56,511 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 251 selfloop transitions, 96 changer transitions 0/356 dead transitions. [2024-05-12 11:36:56,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 356 transitions, 5456 flow [2024-05-12 11:36:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:36:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:36:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-05-12 11:36:56,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208845208845209 [2024-05-12 11:36:56,512 INFO L175 Difference]: Start difference. First operand has 202 places, 286 transitions, 4215 flow. Second operand 11 states and 212 transitions. [2024-05-12 11:36:56,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 356 transitions, 5456 flow [2024-05-12 11:36:56,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 356 transitions, 5158 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-05-12 11:36:56,854 INFO L231 Difference]: Finished difference. Result has 207 places, 291 transitions, 4216 flow [2024-05-12 11:36:56,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3927, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4216, PETRI_PLACES=207, PETRI_TRANSITIONS=291} [2024-05-12 11:36:56,855 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 166 predicate places. [2024-05-12 11:36:56,855 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 291 transitions, 4216 flow [2024-05-12 11:36:56,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:36:56,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:56,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:36:56,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:36:56,856 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:36:56,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash 281216531, now seen corresponding path program 3 times [2024-05-12 11:36:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979981953] [2024-05-12 11:36:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:02,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:02,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979981953] [2024-05-12 11:37:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979981953] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:02,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:37:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637845575] [2024-05-12 11:37:02,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:02,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:37:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:37:02,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:37:02,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:02,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 291 transitions, 4216 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:02,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:02,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:02,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:03,784 INFO L124 PetriNetUnfolderBase]: 2574/4865 cut-off events. [2024-05-12 11:37:03,784 INFO L125 PetriNetUnfolderBase]: For 100798/100884 co-relation queries the response was YES. [2024-05-12 11:37:03,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31008 conditions, 4865 events. 2574/4865 cut-off events. For 100798/100884 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 36184 event pairs, 621 based on Foata normal form. 73/4862 useless extension candidates. Maximal degree in co-relation 30908. Up to 3588 conditions per place. [2024-05-12 11:37:03,833 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 263 selfloop transitions, 67 changer transitions 0/339 dead transitions. [2024-05-12 11:37:03,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 339 transitions, 5108 flow [2024-05-12 11:37:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:37:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:37:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-05-12 11:37:03,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075075075075075 [2024-05-12 11:37:03,835 INFO L175 Difference]: Start difference. First operand has 207 places, 291 transitions, 4216 flow. Second operand 9 states and 169 transitions. [2024-05-12 11:37:03,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 339 transitions, 5108 flow [2024-05-12 11:37:04,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 339 transitions, 4892 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-05-12 11:37:04,187 INFO L231 Difference]: Finished difference. Result has 209 places, 291 transitions, 4139 flow [2024-05-12 11:37:04,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4000, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4139, PETRI_PLACES=209, PETRI_TRANSITIONS=291} [2024-05-12 11:37:04,187 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places. [2024-05-12 11:37:04,188 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 291 transitions, 4139 flow [2024-05-12 11:37:04,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:04,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:04,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:04,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:37:04,188 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:04,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2030273024, now seen corresponding path program 9 times [2024-05-12 11:37:04,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:04,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649364936] [2024-05-12 11:37:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:04,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649364936] [2024-05-12 11:37:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649364936] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:09,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:09,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:37:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369461054] [2024-05-12 11:37:09,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:09,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:37:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:37:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:37:10,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:10,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 291 transitions, 4139 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-05-12 11:37:10,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:10,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:10,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:11,706 INFO L124 PetriNetUnfolderBase]: 2614/4883 cut-off events. [2024-05-12 11:37:11,706 INFO L125 PetriNetUnfolderBase]: For 103028/103190 co-relation queries the response was YES. [2024-05-12 11:37:11,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30993 conditions, 4883 events. 2614/4883 cut-off events. For 103028/103190 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 35737 event pairs, 680 based on Foata normal form. 147/4954 useless extension candidates. Maximal degree in co-relation 30892. Up to 3861 conditions per place. [2024-05-12 11:37:11,757 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 247 selfloop transitions, 98 changer transitions 0/354 dead transitions. [2024-05-12 11:37:11,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 354 transitions, 5234 flow [2024-05-12 11:37:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:37:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:37:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-05-12 11:37:11,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47174447174447176 [2024-05-12 11:37:11,758 INFO L175 Difference]: Start difference. First operand has 209 places, 291 transitions, 4139 flow. Second operand 11 states and 192 transitions. [2024-05-12 11:37:11,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 354 transitions, 5234 flow [2024-05-12 11:37:12,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 354 transitions, 5101 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 11:37:12,062 INFO L231 Difference]: Finished difference. Result has 214 places, 304 transitions, 4420 flow [2024-05-12 11:37:12,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4006, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4420, PETRI_PLACES=214, PETRI_TRANSITIONS=304} [2024-05-12 11:37:12,063 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 173 predicate places. [2024-05-12 11:37:12,063 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 304 transitions, 4420 flow [2024-05-12 11:37:12,063 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-05-12 11:37:12,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:12,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:12,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:37:12,063 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:12,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 281210796, now seen corresponding path program 10 times [2024-05-12 11:37:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101124577] [2024-05-12 11:37:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101124577] [2024-05-12 11:37:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101124577] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:37:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611486843] [2024-05-12 11:37:17,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:17,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:37:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:17,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:37:17,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:37:17,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:17,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 304 transitions, 4420 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:17,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:17,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:17,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:19,100 INFO L124 PetriNetUnfolderBase]: 2608/4870 cut-off events. [2024-05-12 11:37:19,101 INFO L125 PetriNetUnfolderBase]: For 101866/102011 co-relation queries the response was YES. [2024-05-12 11:37:19,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30909 conditions, 4870 events. 2608/4870 cut-off events. For 101866/102011 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35661 event pairs, 670 based on Foata normal form. 128/4922 useless extension candidates. Maximal degree in co-relation 30806. Up to 3863 conditions per place. [2024-05-12 11:37:19,147 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 231 selfloop transitions, 110 changer transitions 0/350 dead transitions. [2024-05-12 11:37:19,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 350 transitions, 5299 flow [2024-05-12 11:37:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:37:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:37:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-05-12 11:37:19,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837837837837838 [2024-05-12 11:37:19,148 INFO L175 Difference]: Start difference. First operand has 214 places, 304 transitions, 4420 flow. Second operand 10 states and 179 transitions. [2024-05-12 11:37:19,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 350 transitions, 5299 flow [2024-05-12 11:37:19,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 350 transitions, 5154 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 11:37:19,527 INFO L231 Difference]: Finished difference. Result has 218 places, 304 transitions, 4503 flow [2024-05-12 11:37:19,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4275, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4503, PETRI_PLACES=218, PETRI_TRANSITIONS=304} [2024-05-12 11:37:19,528 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 177 predicate places. [2024-05-12 11:37:19,528 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 304 transitions, 4503 flow [2024-05-12 11:37:19,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:19,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:19,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:19,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:37:19,528 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:19,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2030057543, now seen corresponding path program 1 times [2024-05-12 11:37:19,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:19,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115257956] [2024-05-12 11:37:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115257956] [2024-05-12 11:37:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115257956] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:25,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:25,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:37:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661894285] [2024-05-12 11:37:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:25,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:37:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:37:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:37:25,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:25,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 304 transitions, 4503 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:25,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:25,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:25,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:26,588 INFO L124 PetriNetUnfolderBase]: 2602/4955 cut-off events. [2024-05-12 11:37:26,588 INFO L125 PetriNetUnfolderBase]: For 105007/105109 co-relation queries the response was YES. [2024-05-12 11:37:26,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31054 conditions, 4955 events. 2602/4955 cut-off events. For 105007/105109 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 37310 event pairs, 669 based on Foata normal form. 90/4976 useless extension candidates. Maximal degree in co-relation 30950. Up to 3629 conditions per place. [2024-05-12 11:37:26,638 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 284 selfloop transitions, 57 changer transitions 0/350 dead transitions. [2024-05-12 11:37:26,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 350 transitions, 5441 flow [2024-05-12 11:37:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:37:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:37:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 11:37:26,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2024-05-12 11:37:26,639 INFO L175 Difference]: Start difference. First operand has 218 places, 304 transitions, 4503 flow. Second operand 9 states and 165 transitions. [2024-05-12 11:37:26,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 350 transitions, 5441 flow [2024-05-12 11:37:26,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 350 transitions, 5199 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-05-12 11:37:26,946 INFO L231 Difference]: Finished difference. Result has 219 places, 305 transitions, 4403 flow [2024-05-12 11:37:26,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4271, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4403, PETRI_PLACES=219, PETRI_TRANSITIONS=305} [2024-05-12 11:37:26,946 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2024-05-12 11:37:26,946 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 305 transitions, 4403 flow [2024-05-12 11:37:26,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:37:26,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:26,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:26,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 11:37:26,947 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:26,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 286573331, now seen corresponding path program 4 times [2024-05-12 11:37:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:26,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768099129] [2024-05-12 11:37:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768099129] [2024-05-12 11:37:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768099129] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:37:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877562226] [2024-05-12 11:37:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:32,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:37:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:32,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:37:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:37:32,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:32,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 305 transitions, 4403 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-05-12 11:37:32,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:32,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:32,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:34,144 INFO L124 PetriNetUnfolderBase]: 2690/4921 cut-off events. [2024-05-12 11:37:34,144 INFO L125 PetriNetUnfolderBase]: For 104455/104572 co-relation queries the response was YES. [2024-05-12 11:37:34,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31557 conditions, 4921 events. 2690/4921 cut-off events. For 104455/104572 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 35672 event pairs, 486 based on Foata normal form. 109/4947 useless extension candidates. Maximal degree in co-relation 31452. Up to 3438 conditions per place. [2024-05-12 11:37:34,192 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 267 selfloop transitions, 93 changer transitions 4/373 dead transitions. [2024-05-12 11:37:34,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 373 transitions, 5579 flow [2024-05-12 11:37:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:37:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:37:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-05-12 11:37:34,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-05-12 11:37:34,193 INFO L175 Difference]: Start difference. First operand has 219 places, 305 transitions, 4403 flow. Second operand 10 states and 188 transitions. [2024-05-12 11:37:34,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 373 transitions, 5579 flow [2024-05-12 11:37:34,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 373 transitions, 5451 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-05-12 11:37:34,608 INFO L231 Difference]: Finished difference. Result has 223 places, 316 transitions, 4653 flow [2024-05-12 11:37:34,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4275, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4653, PETRI_PLACES=223, PETRI_TRANSITIONS=316} [2024-05-12 11:37:34,609 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places. [2024-05-12 11:37:34,609 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 316 transitions, 4653 flow [2024-05-12 11:37:34,609 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-05-12 11:37:34,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:34,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:34,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 11:37:34,610 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:34,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash -172624802, now seen corresponding path program 11 times [2024-05-12 11:37:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:34,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114674116] [2024-05-12 11:37:34,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:40,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114674116] [2024-05-12 11:37:40,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114674116] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:40,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:40,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:37:40,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957174755] [2024-05-12 11:37:40,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:40,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:37:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:37:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:37:40,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:40,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 316 transitions, 4653 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-05-12 11:37:40,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:40,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:40,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:41,915 INFO L124 PetriNetUnfolderBase]: 2703/5022 cut-off events. [2024-05-12 11:37:41,916 INFO L125 PetriNetUnfolderBase]: For 111524/111703 co-relation queries the response was YES. [2024-05-12 11:37:41,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32520 conditions, 5022 events. 2703/5022 cut-off events. For 111524/111703 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 37031 event pairs, 944 based on Foata normal form. 92/5008 useless extension candidates. Maximal degree in co-relation 32413. Up to 4360 conditions per place. [2024-05-12 11:37:41,967 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 302 selfloop transitions, 43 changer transitions 2/356 dead transitions. [2024-05-12 11:37:41,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 356 transitions, 5549 flow [2024-05-12 11:37:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:37:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:37:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-05-12 11:37:41,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2024-05-12 11:37:41,968 INFO L175 Difference]: Start difference. First operand has 223 places, 316 transitions, 4653 flow. Second operand 10 states and 166 transitions. [2024-05-12 11:37:41,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 356 transitions, 5549 flow [2024-05-12 11:37:42,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 356 transitions, 5422 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-05-12 11:37:42,416 INFO L231 Difference]: Finished difference. Result has 230 places, 317 transitions, 4649 flow [2024-05-12 11:37:42,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4526, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4649, PETRI_PLACES=230, PETRI_TRANSITIONS=317} [2024-05-12 11:37:42,417 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 189 predicate places. [2024-05-12 11:37:42,417 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 317 transitions, 4649 flow [2024-05-12 11:37:42,417 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-05-12 11:37:42,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:42,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 11:37:42,417 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:42,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -369021067, now seen corresponding path program 2 times [2024-05-12 11:37:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674764727] [2024-05-12 11:37:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:47,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:47,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674764727] [2024-05-12 11:37:47,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674764727] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:47,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:47,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:37:47,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921512479] [2024-05-12 11:37:47,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:47,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:37:47,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:47,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:37:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:37:47,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:47,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 317 transitions, 4649 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-05-12 11:37:47,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:47,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:47,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:48,914 INFO L124 PetriNetUnfolderBase]: 2715/4994 cut-off events. [2024-05-12 11:37:48,914 INFO L125 PetriNetUnfolderBase]: For 113788/113968 co-relation queries the response was YES. [2024-05-12 11:37:48,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32345 conditions, 4994 events. 2715/4994 cut-off events. For 113788/113968 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 36525 event pairs, 968 based on Foata normal form. 90/4976 useless extension candidates. Maximal degree in co-relation 32236. Up to 4437 conditions per place. [2024-05-12 11:37:48,963 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 320 selfloop transitions, 20 changer transitions 0/349 dead transitions. [2024-05-12 11:37:48,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 349 transitions, 5478 flow [2024-05-12 11:37:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:37:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:37:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-05-12 11:37:48,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44744744744744747 [2024-05-12 11:37:48,969 INFO L175 Difference]: Start difference. First operand has 230 places, 317 transitions, 4649 flow. Second operand 9 states and 149 transitions. [2024-05-12 11:37:48,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 349 transitions, 5478 flow [2024-05-12 11:37:49,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 349 transitions, 5122 flow, removed 29 selfloop flow, removed 13 redundant places. [2024-05-12 11:37:49,372 INFO L231 Difference]: Finished difference. Result has 226 places, 319 transitions, 4386 flow [2024-05-12 11:37:49,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4301, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4386, PETRI_PLACES=226, PETRI_TRANSITIONS=319} [2024-05-12 11:37:49,372 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 185 predicate places. [2024-05-12 11:37:49,372 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 319 transitions, 4386 flow [2024-05-12 11:37:49,372 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-05-12 11:37:49,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:49,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:49,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 11:37:49,373 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:49,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -369236393, now seen corresponding path program 5 times [2024-05-12 11:37:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:49,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843686689] [2024-05-12 11:37:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843686689] [2024-05-12 11:37:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843686689] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:54,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:37:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893966475] [2024-05-12 11:37:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:54,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:37:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:54,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:37:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:37:54,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:37:54,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 319 transitions, 4386 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-05-12 11:37:54,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:54,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:37:54,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:56,434 INFO L124 PetriNetUnfolderBase]: 2737/5039 cut-off events. [2024-05-12 11:37:56,434 INFO L125 PetriNetUnfolderBase]: For 114587/114759 co-relation queries the response was YES. [2024-05-12 11:37:56,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31749 conditions, 5039 events. 2737/5039 cut-off events. For 114587/114759 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 36966 event pairs, 946 based on Foata normal form. 86/5018 useless extension candidates. Maximal degree in co-relation 31643. Up to 4299 conditions per place. [2024-05-12 11:37:56,483 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 322 selfloop transitions, 31 changer transitions 0/362 dead transitions. [2024-05-12 11:37:56,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 362 transitions, 5286 flow [2024-05-12 11:37:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:37:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:37:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 11:37:56,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-05-12 11:37:56,484 INFO L175 Difference]: Start difference. First operand has 226 places, 319 transitions, 4386 flow. Second operand 10 states and 171 transitions. [2024-05-12 11:37:56,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 362 transitions, 5286 flow [2024-05-12 11:37:56,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 362 transitions, 5236 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 11:37:56,812 INFO L231 Difference]: Finished difference. Result has 230 places, 321 transitions, 4442 flow [2024-05-12 11:37:56,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4336, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4442, PETRI_PLACES=230, PETRI_TRANSITIONS=321} [2024-05-12 11:37:56,813 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 189 predicate places. [2024-05-12 11:37:56,813 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 321 transitions, 4442 flow [2024-05-12 11:37:56,813 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-05-12 11:37:56,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:56,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:37:56,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 11:37:56,814 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:37:56,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1142558255, now seen corresponding path program 3 times [2024-05-12 11:37:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627248723] [2024-05-12 11:37:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:01,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627248723] [2024-05-12 11:38:01,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627248723] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:01,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:38:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481126052] [2024-05-12 11:38:01,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:01,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:38:01,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:38:01,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:38:01,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:01,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 321 transitions, 4442 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-05-12 11:38:01,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:01,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:01,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:03,453 INFO L124 PetriNetUnfolderBase]: 2755/5065 cut-off events. [2024-05-12 11:38:03,453 INFO L125 PetriNetUnfolderBase]: For 118760/118929 co-relation queries the response was YES. [2024-05-12 11:38:03,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32059 conditions, 5065 events. 2755/5065 cut-off events. For 118760/118929 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 36985 event pairs, 927 based on Foata normal form. 86/5029 useless extension candidates. Maximal degree in co-relation 31952. Up to 4481 conditions per place. [2024-05-12 11:38:03,501 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 325 selfloop transitions, 20 changer transitions 0/354 dead transitions. [2024-05-12 11:38:03,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 354 transitions, 5267 flow [2024-05-12 11:38:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:38:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:38:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-05-12 11:38:03,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45645645645645644 [2024-05-12 11:38:03,502 INFO L175 Difference]: Start difference. First operand has 230 places, 321 transitions, 4442 flow. Second operand 9 states and 152 transitions. [2024-05-12 11:38:03,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 354 transitions, 5267 flow [2024-05-12 11:38:03,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 354 transitions, 5187 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-05-12 11:38:03,834 INFO L231 Difference]: Finished difference. Result has 231 places, 322 transitions, 4429 flow [2024-05-12 11:38:03,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4362, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4429, PETRI_PLACES=231, PETRI_TRANSITIONS=322} [2024-05-12 11:38:03,835 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 190 predicate places. [2024-05-12 11:38:03,835 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 322 transitions, 4429 flow [2024-05-12 11:38:03,835 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-05-12 11:38:03,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:03,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:03,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 11:38:03,835 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:03,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash 297103345, now seen corresponding path program 4 times [2024-05-12 11:38:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989274303] [2024-05-12 11:38:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989274303] [2024-05-12 11:38:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989274303] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:38:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571977160] [2024-05-12 11:38:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:09,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:38:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:09,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:38:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:38:09,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:09,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 322 transitions, 4429 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:38:09,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:09,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:09,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:10,864 INFO L124 PetriNetUnfolderBase]: 2791/5117 cut-off events. [2024-05-12 11:38:10,865 INFO L125 PetriNetUnfolderBase]: For 123260/123443 co-relation queries the response was YES. [2024-05-12 11:38:10,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32284 conditions, 5117 events. 2791/5117 cut-off events. For 123260/123443 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 37445 event pairs, 940 based on Foata normal form. 100/5101 useless extension candidates. Maximal degree in co-relation 32176. Up to 4474 conditions per place. [2024-05-12 11:38:10,913 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 324 selfloop transitions, 32 changer transitions 0/365 dead transitions. [2024-05-12 11:38:10,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 365 transitions, 5366 flow [2024-05-12 11:38:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:38:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:38:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-05-12 11:38:10,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2024-05-12 11:38:10,914 INFO L175 Difference]: Start difference. First operand has 231 places, 322 transitions, 4429 flow. Second operand 9 states and 155 transitions. [2024-05-12 11:38:10,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 365 transitions, 5366 flow [2024-05-12 11:38:11,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 365 transitions, 5305 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-05-12 11:38:11,280 INFO L231 Difference]: Finished difference. Result has 236 places, 330 transitions, 4569 flow [2024-05-12 11:38:11,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4375, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4569, PETRI_PLACES=236, PETRI_TRANSITIONS=330} [2024-05-12 11:38:11,281 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 195 predicate places. [2024-05-12 11:38:11,281 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 330 transitions, 4569 flow [2024-05-12 11:38:11,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:38:11,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:11,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 11:38:11,281 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:11,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1152656691, now seen corresponding path program 6 times [2024-05-12 11:38:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795686348] [2024-05-12 11:38:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:16,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:16,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795686348] [2024-05-12 11:38:16,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795686348] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:16,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:16,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:38:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57455403] [2024-05-12 11:38:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:16,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:38:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:38:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:38:16,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:16,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 330 transitions, 4569 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-05-12 11:38:16,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:16,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:16,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:18,018 INFO L124 PetriNetUnfolderBase]: 2826/5168 cut-off events. [2024-05-12 11:38:18,018 INFO L125 PetriNetUnfolderBase]: For 125458/125627 co-relation queries the response was YES. [2024-05-12 11:38:18,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33223 conditions, 5168 events. 2826/5168 cut-off events. For 125458/125627 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 37844 event pairs, 969 based on Foata normal form. 84/5127 useless extension candidates. Maximal degree in co-relation 33111. Up to 4546 conditions per place. [2024-05-12 11:38:18,066 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 334 selfloop transitions, 28 changer transitions 6/377 dead transitions. [2024-05-12 11:38:18,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 377 transitions, 5563 flow [2024-05-12 11:38:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:38:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:38:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-05-12 11:38:18,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44226044226044225 [2024-05-12 11:38:18,067 INFO L175 Difference]: Start difference. First operand has 236 places, 330 transitions, 4569 flow. Second operand 11 states and 180 transitions. [2024-05-12 11:38:18,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 377 transitions, 5563 flow [2024-05-12 11:38:18,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 377 transitions, 5505 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:38:18,469 INFO L231 Difference]: Finished difference. Result has 246 places, 342 transitions, 4737 flow [2024-05-12 11:38:18,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4511, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4737, PETRI_PLACES=246, PETRI_TRANSITIONS=342} [2024-05-12 11:38:18,470 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 205 predicate places. [2024-05-12 11:38:18,470 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 342 transitions, 4737 flow [2024-05-12 11:38:18,470 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-05-12 11:38:18,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:18,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:18,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 11:38:18,470 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:18,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash -74369167, now seen corresponding path program 5 times [2024-05-12 11:38:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125118080] [2024-05-12 11:38:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:23,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:23,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125118080] [2024-05-12 11:38:23,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125118080] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:23,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:38:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644712288] [2024-05-12 11:38:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:23,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:38:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:38:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:38:23,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:23,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 342 transitions, 4737 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-05-12 11:38:23,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:23,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:23,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:25,059 INFO L124 PetriNetUnfolderBase]: 2832/5210 cut-off events. [2024-05-12 11:38:25,059 INFO L125 PetriNetUnfolderBase]: For 128229/128402 co-relation queries the response was YES. [2024-05-12 11:38:25,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33713 conditions, 5210 events. 2832/5210 cut-off events. For 128229/128402 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 38381 event pairs, 975 based on Foata normal form. 89/5172 useless extension candidates. Maximal degree in co-relation 33597. Up to 4600 conditions per place. [2024-05-12 11:38:25,116 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 342 selfloop transitions, 24 changer transitions 0/375 dead transitions. [2024-05-12 11:38:25,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 375 transitions, 5614 flow [2024-05-12 11:38:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:38:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:38:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 11:38:25,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45345345345345345 [2024-05-12 11:38:25,117 INFO L175 Difference]: Start difference. First operand has 246 places, 342 transitions, 4737 flow. Second operand 9 states and 151 transitions. [2024-05-12 11:38:25,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 375 transitions, 5614 flow [2024-05-12 11:38:25,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 375 transitions, 5554 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-05-12 11:38:25,523 INFO L231 Difference]: Finished difference. Result has 252 places, 345 transitions, 4785 flow [2024-05-12 11:38:25,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4677, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4785, PETRI_PLACES=252, PETRI_TRANSITIONS=345} [2024-05-12 11:38:25,523 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 211 predicate places. [2024-05-12 11:38:25,523 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 345 transitions, 4785 flow [2024-05-12 11:38:25,523 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-05-12 11:38:25,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:25,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:25,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 11:38:25,524 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:25,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash -770940229, now seen corresponding path program 7 times [2024-05-12 11:38:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942167621] [2024-05-12 11:38:25,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942167621] [2024-05-12 11:38:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942167621] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:38:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268051578] [2024-05-12 11:38:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:31,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:38:31,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:31,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:38:31,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:38:31,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:31,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 345 transitions, 4785 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-05-12 11:38:31,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:31,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:31,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:33,091 INFO L124 PetriNetUnfolderBase]: 2829/5207 cut-off events. [2024-05-12 11:38:33,091 INFO L125 PetriNetUnfolderBase]: For 131427/131623 co-relation queries the response was YES. [2024-05-12 11:38:33,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33857 conditions, 5207 events. 2829/5207 cut-off events. For 131427/131623 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 38399 event pairs, 918 based on Foata normal form. 105/5193 useless extension candidates. Maximal degree in co-relation 33738. Up to 4478 conditions per place. [2024-05-12 11:38:33,144 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 348 selfloop transitions, 37 changer transitions 1/395 dead transitions. [2024-05-12 11:38:33,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 395 transitions, 5850 flow [2024-05-12 11:38:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:38:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:38:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 11:38:33,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-05-12 11:38:33,146 INFO L175 Difference]: Start difference. First operand has 252 places, 345 transitions, 4785 flow. Second operand 10 states and 175 transitions. [2024-05-12 11:38:33,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 395 transitions, 5850 flow [2024-05-12 11:38:33,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 395 transitions, 5773 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 11:38:33,669 INFO L231 Difference]: Finished difference. Result has 257 places, 350 transitions, 4884 flow [2024-05-12 11:38:33,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4708, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4884, PETRI_PLACES=257, PETRI_TRANSITIONS=350} [2024-05-12 11:38:33,669 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 216 predicate places. [2024-05-12 11:38:33,669 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 350 transitions, 4884 flow [2024-05-12 11:38:33,669 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-05-12 11:38:33,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:33,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 11:38:33,669 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:33,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 296888019, now seen corresponding path program 8 times [2024-05-12 11:38:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875491126] [2024-05-12 11:38:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:38,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:38,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875491126] [2024-05-12 11:38:38,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875491126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:38,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:38,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:38:38,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433386200] [2024-05-12 11:38:38,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:38,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:38:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:38:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:38:39,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:39,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 350 transitions, 4884 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-05-12 11:38:39,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:39,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:39,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:40,987 INFO L124 PetriNetUnfolderBase]: 2871/5262 cut-off events. [2024-05-12 11:38:40,987 INFO L125 PetriNetUnfolderBase]: For 132335/132522 co-relation queries the response was YES. [2024-05-12 11:38:41,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34335 conditions, 5262 events. 2871/5262 cut-off events. For 132335/132522 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 38661 event pairs, 858 based on Foata normal form. 108/5252 useless extension candidates. Maximal degree in co-relation 34214. Up to 4310 conditions per place. [2024-05-12 11:38:41,041 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 320 selfloop transitions, 79 changer transitions 0/408 dead transitions. [2024-05-12 11:38:41,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 408 transitions, 6182 flow [2024-05-12 11:38:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:38:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:38:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-05-12 11:38:41,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 11:38:41,043 INFO L175 Difference]: Start difference. First operand has 257 places, 350 transitions, 4884 flow. Second operand 10 states and 180 transitions. [2024-05-12 11:38:41,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 408 transitions, 6182 flow [2024-05-12 11:38:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 408 transitions, 6095 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-05-12 11:38:41,611 INFO L231 Difference]: Finished difference. Result has 261 places, 360 transitions, 5160 flow [2024-05-12 11:38:41,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4797, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5160, PETRI_PLACES=261, PETRI_TRANSITIONS=360} [2024-05-12 11:38:41,611 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 220 predicate places. [2024-05-12 11:38:41,611 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 360 transitions, 5160 flow [2024-05-12 11:38:41,611 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-05-12 11:38:41,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:41,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:41,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 11:38:41,612 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:41,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 296887864, now seen corresponding path program 12 times [2024-05-12 11:38:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:41,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732334329] [2024-05-12 11:38:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:47,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:47,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732334329] [2024-05-12 11:38:47,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732334329] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:47,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:47,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:38:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768220577] [2024-05-12 11:38:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:47,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:38:47,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:38:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:38:47,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:47,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 360 transitions, 5160 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-05-12 11:38:47,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:47,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:47,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:49,540 INFO L124 PetriNetUnfolderBase]: 3105/5727 cut-off events. [2024-05-12 11:38:49,541 INFO L125 PetriNetUnfolderBase]: For 190000/190199 co-relation queries the response was YES. [2024-05-12 11:38:49,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36520 conditions, 5727 events. 3105/5727 cut-off events. For 190000/190199 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 43260 event pairs, 1019 based on Foata normal form. 158/5762 useless extension candidates. Maximal degree in co-relation 36397. Up to 4388 conditions per place. [2024-05-12 11:38:49,605 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 361 selfloop transitions, 43 changer transitions 0/413 dead transitions. [2024-05-12 11:38:49,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 413 transitions, 6242 flow [2024-05-12 11:38:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:38:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:38:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 11:38:49,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47911547911547914 [2024-05-12 11:38:49,606 INFO L175 Difference]: Start difference. First operand has 261 places, 360 transitions, 5160 flow. Second operand 11 states and 195 transitions. [2024-05-12 11:38:49,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 413 transitions, 6242 flow [2024-05-12 11:38:50,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 413 transitions, 6021 flow, removed 72 selfloop flow, removed 4 redundant places. [2024-05-12 11:38:50,325 INFO L231 Difference]: Finished difference. Result has 269 places, 360 transitions, 5054 flow [2024-05-12 11:38:50,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4939, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5054, PETRI_PLACES=269, PETRI_TRANSITIONS=360} [2024-05-12 11:38:50,325 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 228 predicate places. [2024-05-12 11:38:50,326 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 360 transitions, 5054 flow [2024-05-12 11:38:50,326 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-05-12 11:38:50,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:50,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:50,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 11:38:50,327 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:50,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash -555974256, now seen corresponding path program 1 times [2024-05-12 11:38:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:50,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706507527] [2024-05-12 11:38:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:38:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706507527] [2024-05-12 11:38:55,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706507527] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:55,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:55,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:38:55,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119745508] [2024-05-12 11:38:55,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:55,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:38:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:38:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:38:56,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:38:56,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 360 transitions, 5054 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:38:56,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:56,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:38:56,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:58,110 INFO L124 PetriNetUnfolderBase]: 3257/5927 cut-off events. [2024-05-12 11:38:58,110 INFO L125 PetriNetUnfolderBase]: For 168700/168861 co-relation queries the response was YES. [2024-05-12 11:38:58,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37954 conditions, 5927 events. 3257/5927 cut-off events. For 168700/168861 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 44456 event pairs, 537 based on Foata normal form. 161/5974 useless extension candidates. Maximal degree in co-relation 37829. Up to 2591 conditions per place. [2024-05-12 11:38:58,174 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 257 selfloop transitions, 150 changer transitions 2/418 dead transitions. [2024-05-12 11:38:58,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 418 transitions, 6320 flow [2024-05-12 11:38:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:38:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:38:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-05-12 11:38:58,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-05-12 11:38:58,175 INFO L175 Difference]: Start difference. First operand has 269 places, 360 transitions, 5054 flow. Second operand 10 states and 190 transitions. [2024-05-12 11:38:58,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 418 transitions, 6320 flow [2024-05-12 11:38:58,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 418 transitions, 6247 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 11:38:58,956 INFO L231 Difference]: Finished difference. Result has 273 places, 361 transitions, 5444 flow [2024-05-12 11:38:58,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4983, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5444, PETRI_PLACES=273, PETRI_TRANSITIONS=361} [2024-05-12 11:38:58,957 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places. [2024-05-12 11:38:58,957 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 361 transitions, 5444 flow [2024-05-12 11:38:58,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:38:58,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:58,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:38:58,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 11:38:58,958 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:38:58,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1690093638, now seen corresponding path program 2 times [2024-05-12 11:38:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:58,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529676533] [2024-05-12 11:38:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529676533] [2024-05-12 11:39:04,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529676533] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:04,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:04,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:39:04,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292914226] [2024-05-12 11:39:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:04,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:39:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:04,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:39:04,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:39:05,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:39:05,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 361 transitions, 5444 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:05,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:05,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:39:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:07,228 INFO L124 PetriNetUnfolderBase]: 3432/6552 cut-off events. [2024-05-12 11:39:07,228 INFO L125 PetriNetUnfolderBase]: For 192560/192716 co-relation queries the response was YES. [2024-05-12 11:39:07,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42150 conditions, 6552 events. 3432/6552 cut-off events. For 192560/192716 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 52390 event pairs, 896 based on Foata normal form. 146/6593 useless extension candidates. Maximal degree in co-relation 42022. Up to 4006 conditions per place. [2024-05-12 11:39:07,302 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 319 selfloop transitions, 94 changer transitions 0/422 dead transitions. [2024-05-12 11:39:07,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 422 transitions, 6753 flow [2024-05-12 11:39:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:39:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:39:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-05-12 11:39:07,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2024-05-12 11:39:07,310 INFO L175 Difference]: Start difference. First operand has 273 places, 361 transitions, 5444 flow. Second operand 10 states and 194 transitions. [2024-05-12 11:39:07,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 422 transitions, 6753 flow [2024-05-12 11:39:08,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 422 transitions, 6549 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 11:39:08,027 INFO L231 Difference]: Finished difference. Result has 278 places, 365 transitions, 5490 flow [2024-05-12 11:39:08,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5242, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5490, PETRI_PLACES=278, PETRI_TRANSITIONS=365} [2024-05-12 11:39:08,027 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 237 predicate places. [2024-05-12 11:39:08,027 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 365 transitions, 5490 flow [2024-05-12 11:39:08,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:08,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:08,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:08,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 11:39:08,028 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:08,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash -875699316, now seen corresponding path program 3 times [2024-05-12 11:39:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662144943] [2024-05-12 11:39:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:13,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662144943] [2024-05-12 11:39:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662144943] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:13,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:13,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:39:13,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141585551] [2024-05-12 11:39:13,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:13,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:39:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:13,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:39:13,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:39:13,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:39:13,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 365 transitions, 5490 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:13,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:13,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:39:13,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:15,304 INFO L124 PetriNetUnfolderBase]: 3397/6469 cut-off events. [2024-05-12 11:39:15,304 INFO L125 PetriNetUnfolderBase]: For 177744/177890 co-relation queries the response was YES. [2024-05-12 11:39:15,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41248 conditions, 6469 events. 3397/6469 cut-off events. For 177744/177890 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 51536 event pairs, 849 based on Foata normal form. 136/6496 useless extension candidates. Maximal degree in co-relation 41118. Up to 4061 conditions per place. [2024-05-12 11:39:15,374 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 318 selfloop transitions, 94 changer transitions 0/421 dead transitions. [2024-05-12 11:39:15,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 421 transitions, 6746 flow [2024-05-12 11:39:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:39:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:39:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-05-12 11:39:15,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518918918918919 [2024-05-12 11:39:15,375 INFO L175 Difference]: Start difference. First operand has 278 places, 365 transitions, 5490 flow. Second operand 10 states and 192 transitions. [2024-05-12 11:39:15,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 421 transitions, 6746 flow [2024-05-12 11:39:16,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 421 transitions, 6645 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 11:39:16,011 INFO L231 Difference]: Finished difference. Result has 284 places, 365 transitions, 5581 flow [2024-05-12 11:39:16,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5389, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5581, PETRI_PLACES=284, PETRI_TRANSITIONS=365} [2024-05-12 11:39:16,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 243 predicate places. [2024-05-12 11:39:16,012 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 365 transitions, 5581 flow [2024-05-12 11:39:16,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:16,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:16,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 11:39:16,013 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:16,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash -497761836, now seen corresponding path program 4 times [2024-05-12 11:39:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:16,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048386447] [2024-05-12 11:39:16,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048386447] [2024-05-12 11:39:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048386447] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:39:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494388835] [2024-05-12 11:39:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:21,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:39:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:39:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:39:21,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:39:21,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 365 transitions, 5581 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:21,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:21,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:39:21,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:23,797 INFO L124 PetriNetUnfolderBase]: 3407/6215 cut-off events. [2024-05-12 11:39:23,798 INFO L125 PetriNetUnfolderBase]: For 169526/169683 co-relation queries the response was YES. [2024-05-12 11:39:23,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40686 conditions, 6215 events. 3407/6215 cut-off events. For 169526/169683 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 47589 event pairs, 652 based on Foata normal form. 151/6247 useless extension candidates. Maximal degree in co-relation 40555. Up to 3798 conditions per place. [2024-05-12 11:39:23,870 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 257 selfloop transitions, 152 changer transitions 0/418 dead transitions. [2024-05-12 11:39:23,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 418 transitions, 6703 flow [2024-05-12 11:39:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:39:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:39:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-05-12 11:39:23,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-05-12 11:39:23,871 INFO L175 Difference]: Start difference. First operand has 284 places, 365 transitions, 5581 flow. Second operand 10 states and 190 transitions. [2024-05-12 11:39:23,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 418 transitions, 6703 flow [2024-05-12 11:39:24,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 418 transitions, 6521 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 11:39:24,718 INFO L231 Difference]: Finished difference. Result has 287 places, 367 transitions, 5743 flow [2024-05-12 11:39:24,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5399, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5743, PETRI_PLACES=287, PETRI_TRANSITIONS=367} [2024-05-12 11:39:24,718 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 246 predicate places. [2024-05-12 11:39:24,718 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 367 transitions, 5743 flow [2024-05-12 11:39:24,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:24,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:24,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:24,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 11:39:24,719 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:24,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2100641392, now seen corresponding path program 5 times [2024-05-12 11:39:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:24,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344170960] [2024-05-12 11:39:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:30,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:30,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344170960] [2024-05-12 11:39:30,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344170960] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:30,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:30,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:39:30,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53618815] [2024-05-12 11:39:30,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:30,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:39:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:30,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:39:30,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:39:30,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:39:30,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 367 transitions, 5743 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:30,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:30,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:39:30,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:32,661 INFO L124 PetriNetUnfolderBase]: 3395/6568 cut-off events. [2024-05-12 11:39:32,661 INFO L125 PetriNetUnfolderBase]: For 159576/159705 co-relation queries the response was YES. [2024-05-12 11:39:32,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41059 conditions, 6568 events. 3395/6568 cut-off events. For 159576/159705 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 53202 event pairs, 997 based on Foata normal form. 119/6593 useless extension candidates. Maximal degree in co-relation 40927. Up to 4951 conditions per place. [2024-05-12 11:39:32,740 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 352 selfloop transitions, 58 changer transitions 0/419 dead transitions. [2024-05-12 11:39:32,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 419 transitions, 6859 flow [2024-05-12 11:39:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:39:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:39:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-05-12 11:39:32,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-05-12 11:39:32,741 INFO L175 Difference]: Start difference. First operand has 287 places, 367 transitions, 5743 flow. Second operand 10 states and 184 transitions. [2024-05-12 11:39:32,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 419 transitions, 6859 flow [2024-05-12 11:39:33,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 419 transitions, 6536 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-05-12 11:39:33,693 INFO L231 Difference]: Finished difference. Result has 290 places, 367 transitions, 5540 flow [2024-05-12 11:39:33,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5420, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5540, PETRI_PLACES=290, PETRI_TRANSITIONS=367} [2024-05-12 11:39:33,694 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 249 predicate places. [2024-05-12 11:39:33,694 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 367 transitions, 5540 flow [2024-05-12 11:39:33,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:33,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:33,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:33,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 11:39:33,694 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:33,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2100819022, now seen corresponding path program 6 times [2024-05-12 11:39:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:33,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13266286] [2024-05-12 11:39:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:33,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13266286] [2024-05-12 11:39:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13266286] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:39:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489039573] [2024-05-12 11:39:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:39,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:39:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:39:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:39:39,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:39:39,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 367 transitions, 5540 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:39,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:39,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:39:39,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:41,701 INFO L124 PetriNetUnfolderBase]: 3557/6827 cut-off events. [2024-05-12 11:39:41,702 INFO L125 PetriNetUnfolderBase]: For 177355/177505 co-relation queries the response was YES. [2024-05-12 11:39:41,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42346 conditions, 6827 events. 3557/6827 cut-off events. For 177355/177505 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 55480 event pairs, 1005 based on Foata normal form. 138/6867 useless extension candidates. Maximal degree in co-relation 42213. Up to 4711 conditions per place. [2024-05-12 11:39:41,770 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 355 selfloop transitions, 62 changer transitions 0/426 dead transitions. [2024-05-12 11:39:41,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 426 transitions, 6838 flow [2024-05-12 11:39:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:39:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:39:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-05-12 11:39:41,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162162162162162 [2024-05-12 11:39:41,771 INFO L175 Difference]: Start difference. First operand has 290 places, 367 transitions, 5540 flow. Second operand 10 states and 191 transitions. [2024-05-12 11:39:41,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 426 transitions, 6838 flow [2024-05-12 11:39:42,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 426 transitions, 6725 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 11:39:42,566 INFO L231 Difference]: Finished difference. Result has 294 places, 369 transitions, 5585 flow [2024-05-12 11:39:42,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5427, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5585, PETRI_PLACES=294, PETRI_TRANSITIONS=369} [2024-05-12 11:39:42,566 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places. [2024-05-12 11:39:42,566 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 369 transitions, 5585 flow [2024-05-12 11:39:42,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:42,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:42,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:42,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 11:39:42,567 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:42,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash -794679876, now seen corresponding path program 7 times [2024-05-12 11:39:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766195493] [2024-05-12 11:39:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766195493] [2024-05-12 11:39:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766195493] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:47,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:47,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:39:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572091847] [2024-05-12 11:39:47,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:47,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:39:47,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:47,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:39:47,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:39:47,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:39:47,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 369 transitions, 5585 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:47,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:47,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:39:47,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:50,284 INFO L124 PetriNetUnfolderBase]: 3576/6731 cut-off events. [2024-05-12 11:39:50,284 INFO L125 PetriNetUnfolderBase]: For 166527/166690 co-relation queries the response was YES. [2024-05-12 11:39:50,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41888 conditions, 6731 events. 3576/6731 cut-off events. For 166527/166690 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 53328 event pairs, 843 based on Foata normal form. 157/6782 useless extension candidates. Maximal degree in co-relation 41753. Up to 4907 conditions per place. [2024-05-12 11:39:50,355 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 312 selfloop transitions, 105 changer transitions 0/426 dead transitions. [2024-05-12 11:39:50,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 426 transitions, 6771 flow [2024-05-12 11:39:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:39:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:39:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 11:39:50,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108108108108108 [2024-05-12 11:39:50,356 INFO L175 Difference]: Start difference. First operand has 294 places, 369 transitions, 5585 flow. Second operand 10 states and 189 transitions. [2024-05-12 11:39:50,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 426 transitions, 6771 flow [2024-05-12 11:39:51,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 426 transitions, 6669 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 11:39:51,236 INFO L231 Difference]: Finished difference. Result has 298 places, 373 transitions, 5771 flow [2024-05-12 11:39:51,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5483, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5771, PETRI_PLACES=298, PETRI_TRANSITIONS=373} [2024-05-12 11:39:51,237 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places. [2024-05-12 11:39:51,237 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 373 transitions, 5771 flow [2024-05-12 11:39:51,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:51,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:51,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:39:51,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 11:39:51,238 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:39:51,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash 997467792, now seen corresponding path program 8 times [2024-05-12 11:39:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171024855] [2024-05-12 11:39:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:39:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171024855] [2024-05-12 11:39:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171024855] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:57,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:39:57,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016312022] [2024-05-12 11:39:57,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:57,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:39:57,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:57,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:39:57,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:39:57,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:39:57,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 373 transitions, 5771 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:39:57,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:57,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:39:57,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:59,713 INFO L124 PetriNetUnfolderBase]: 3715/6988 cut-off events. [2024-05-12 11:39:59,713 INFO L125 PetriNetUnfolderBase]: For 188504/188673 co-relation queries the response was YES. [2024-05-12 11:39:59,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43974 conditions, 6988 events. 3715/6988 cut-off events. For 188504/188673 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 55776 event pairs, 892 based on Foata normal form. 147/7021 useless extension candidates. Maximal degree in co-relation 43838. Up to 4907 conditions per place. [2024-05-12 11:39:59,805 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 307 selfloop transitions, 115 changer transitions 0/431 dead transitions. [2024-05-12 11:39:59,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 431 transitions, 7083 flow [2024-05-12 11:39:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:39:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:39:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-05-12 11:39:59,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-05-12 11:39:59,807 INFO L175 Difference]: Start difference. First operand has 298 places, 373 transitions, 5771 flow. Second operand 10 states and 195 transitions. [2024-05-12 11:39:59,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 431 transitions, 7083 flow [2024-05-12 11:40:00,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 431 transitions, 6926 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-05-12 11:40:00,897 INFO L231 Difference]: Finished difference. Result has 304 places, 375 transitions, 5900 flow [2024-05-12 11:40:00,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5614, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5900, PETRI_PLACES=304, PETRI_TRANSITIONS=375} [2024-05-12 11:40:00,898 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 263 predicate places. [2024-05-12 11:40:00,898 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 375 transitions, 5900 flow [2024-05-12 11:40:00,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:00,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:00,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:00,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-05-12 11:40:00,898 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:00,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 997472442, now seen corresponding path program 9 times [2024-05-12 11:40:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:00,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412020665] [2024-05-12 11:40:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412020665] [2024-05-12 11:40:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412020665] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:06,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:40:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491915508] [2024-05-12 11:40:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:06,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:40:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:40:06,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:40:06,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:40:06,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 375 transitions, 5900 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:06,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:06,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:40:06,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:08,641 INFO L124 PetriNetUnfolderBase]: 3722/7236 cut-off events. [2024-05-12 11:40:08,641 INFO L125 PetriNetUnfolderBase]: For 179643/179784 co-relation queries the response was YES. [2024-05-12 11:40:08,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44496 conditions, 7236 events. 3722/7236 cut-off events. For 179643/179784 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 60039 event pairs, 1190 based on Foata normal form. 115/7254 useless extension candidates. Maximal degree in co-relation 44357. Up to 5452 conditions per place. [2024-05-12 11:40:08,728 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 350 selfloop transitions, 67 changer transitions 0/426 dead transitions. [2024-05-12 11:40:08,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 426 transitions, 7024 flow [2024-05-12 11:40:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:40:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:40:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 11:40:08,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-05-12 11:40:08,729 INFO L175 Difference]: Start difference. First operand has 304 places, 375 transitions, 5900 flow. Second operand 10 states and 187 transitions. [2024-05-12 11:40:08,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 426 transitions, 7024 flow [2024-05-12 11:40:09,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 426 transitions, 6768 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 11:40:09,888 INFO L231 Difference]: Finished difference. Result has 306 places, 375 transitions, 5782 flow [2024-05-12 11:40:09,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5644, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5782, PETRI_PLACES=306, PETRI_TRANSITIONS=375} [2024-05-12 11:40:09,888 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 265 predicate places. [2024-05-12 11:40:09,888 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 375 transitions, 5782 flow [2024-05-12 11:40:09,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:09,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:09,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:09,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-05-12 11:40:09,889 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:09,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash 997352472, now seen corresponding path program 10 times [2024-05-12 11:40:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970961085] [2024-05-12 11:40:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:09,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970961085] [2024-05-12 11:40:15,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970961085] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:15,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:15,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:40:15,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787247687] [2024-05-12 11:40:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:15,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:40:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:15,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:40:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:40:15,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:40:15,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 375 transitions, 5782 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:15,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:15,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:40:15,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:17,926 INFO L124 PetriNetUnfolderBase]: 3786/7065 cut-off events. [2024-05-12 11:40:17,927 INFO L125 PetriNetUnfolderBase]: For 177417/177590 co-relation queries the response was YES. [2024-05-12 11:40:17,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44268 conditions, 7065 events. 3786/7065 cut-off events. For 177417/177590 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 56287 event pairs, 851 based on Foata normal form. 151/7094 useless extension candidates. Maximal degree in co-relation 44129. Up to 4225 conditions per place. [2024-05-12 11:40:18,010 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 307 selfloop transitions, 115 changer transitions 0/431 dead transitions. [2024-05-12 11:40:18,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 431 transitions, 6954 flow [2024-05-12 11:40:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:40:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:40:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-05-12 11:40:18,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216216216216216 [2024-05-12 11:40:18,011 INFO L175 Difference]: Start difference. First operand has 306 places, 375 transitions, 5782 flow. Second operand 10 states and 193 transitions. [2024-05-12 11:40:18,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 431 transitions, 6954 flow [2024-05-12 11:40:19,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 431 transitions, 6777 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 11:40:19,162 INFO L231 Difference]: Finished difference. Result has 311 places, 376 transitions, 5875 flow [2024-05-12 11:40:19,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5605, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5875, PETRI_PLACES=311, PETRI_TRANSITIONS=376} [2024-05-12 11:40:19,163 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 270 predicate places. [2024-05-12 11:40:19,163 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 376 transitions, 5875 flow [2024-05-12 11:40:19,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:19,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:19,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:19,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-12 11:40:19,163 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:19,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash 123017146, now seen corresponding path program 11 times [2024-05-12 11:40:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790643514] [2024-05-12 11:40:19,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790643514] [2024-05-12 11:40:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790643514] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:24,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:40:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506248153] [2024-05-12 11:40:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:24,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:40:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:40:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:40:24,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:40:24,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 376 transitions, 5875 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:24,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:24,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:40:24,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:27,106 INFO L124 PetriNetUnfolderBase]: 3933/7287 cut-off events. [2024-05-12 11:40:27,106 INFO L125 PetriNetUnfolderBase]: For 208000/208166 co-relation queries the response was YES. [2024-05-12 11:40:27,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46354 conditions, 7287 events. 3933/7287 cut-off events. For 208000/208166 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 58257 event pairs, 831 based on Foata normal form. 158/7316 useless extension candidates. Maximal degree in co-relation 46213. Up to 3250 conditions per place. [2024-05-12 11:40:27,200 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 260 selfloop transitions, 169 changer transitions 0/438 dead transitions. [2024-05-12 11:40:27,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 438 transitions, 7188 flow [2024-05-12 11:40:27,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:40:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:40:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-05-12 11:40:27,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432432432432432 [2024-05-12 11:40:27,201 INFO L175 Difference]: Start difference. First operand has 311 places, 376 transitions, 5875 flow. Second operand 10 states and 201 transitions. [2024-05-12 11:40:27,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 438 transitions, 7188 flow [2024-05-12 11:40:28,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 438 transitions, 6945 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-05-12 11:40:28,445 INFO L231 Difference]: Finished difference. Result has 313 places, 376 transitions, 5975 flow [2024-05-12 11:40:28,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5632, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5975, PETRI_PLACES=313, PETRI_TRANSITIONS=376} [2024-05-12 11:40:28,445 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 272 predicate places. [2024-05-12 11:40:28,445 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 376 transitions, 5975 flow [2024-05-12 11:40:28,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:28,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:28,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:28,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-12 11:40:28,446 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:28,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash 123137116, now seen corresponding path program 12 times [2024-05-12 11:40:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401059699] [2024-05-12 11:40:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:34,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401059699] [2024-05-12 11:40:34,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401059699] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:34,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:34,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:40:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541649617] [2024-05-12 11:40:34,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:34,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:40:34,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:34,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:40:34,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:40:34,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:40:34,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 376 transitions, 5975 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:34,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:34,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:40:34,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:36,842 INFO L124 PetriNetUnfolderBase]: 4021/7439 cut-off events. [2024-05-12 11:40:36,842 INFO L125 PetriNetUnfolderBase]: For 218048/218227 co-relation queries the response was YES. [2024-05-12 11:40:36,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47530 conditions, 7439 events. 4021/7439 cut-off events. For 218048/218227 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 59630 event pairs, 949 based on Foata normal form. 169/7480 useless extension candidates. Maximal degree in co-relation 47389. Up to 5181 conditions per place. [2024-05-12 11:40:36,924 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 255 selfloop transitions, 173 changer transitions 0/437 dead transitions. [2024-05-12 11:40:36,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 437 transitions, 7190 flow [2024-05-12 11:40:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:40:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:40:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-05-12 11:40:36,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324324324324324 [2024-05-12 11:40:36,925 INFO L175 Difference]: Start difference. First operand has 313 places, 376 transitions, 5975 flow. Second operand 10 states and 197 transitions. [2024-05-12 11:40:36,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 437 transitions, 7190 flow [2024-05-12 11:40:38,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 437 transitions, 6791 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-05-12 11:40:38,321 INFO L231 Difference]: Finished difference. Result has 314 places, 380 transitions, 5992 flow [2024-05-12 11:40:38,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5598, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5992, PETRI_PLACES=314, PETRI_TRANSITIONS=380} [2024-05-12 11:40:38,322 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places. [2024-05-12 11:40:38,322 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 380 transitions, 5992 flow [2024-05-12 11:40:38,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:38,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:38,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:38,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-12 11:40:38,322 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:38,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash 123132466, now seen corresponding path program 13 times [2024-05-12 11:40:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:38,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392422234] [2024-05-12 11:40:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392422234] [2024-05-12 11:40:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392422234] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:43,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:40:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397494741] [2024-05-12 11:40:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:43,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:40:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:40:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:40:43,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:40:43,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 380 transitions, 5992 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:43,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:43,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:40:43,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:46,101 INFO L124 PetriNetUnfolderBase]: 3968/7360 cut-off events. [2024-05-12 11:40:46,101 INFO L125 PetriNetUnfolderBase]: For 190359/190544 co-relation queries the response was YES. [2024-05-12 11:40:46,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45940 conditions, 7360 events. 3968/7360 cut-off events. For 190359/190544 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 58968 event pairs, 902 based on Foata normal form. 164/7396 useless extension candidates. Maximal degree in co-relation 45800. Up to 4880 conditions per place. [2024-05-12 11:40:46,192 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 259 selfloop transitions, 173 changer transitions 0/441 dead transitions. [2024-05-12 11:40:46,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 441 transitions, 7179 flow [2024-05-12 11:40:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:40:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:40:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-05-12 11:40:46,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432432432432432 [2024-05-12 11:40:46,194 INFO L175 Difference]: Start difference. First operand has 314 places, 380 transitions, 5992 flow. Second operand 10 states and 201 transitions. [2024-05-12 11:40:46,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 441 transitions, 7179 flow [2024-05-12 11:40:47,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 441 transitions, 6825 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-05-12 11:40:47,631 INFO L231 Difference]: Finished difference. Result has 317 places, 380 transitions, 5989 flow [2024-05-12 11:40:47,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5638, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5989, PETRI_PLACES=317, PETRI_TRANSITIONS=380} [2024-05-12 11:40:47,631 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places. [2024-05-12 11:40:47,631 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 380 transitions, 5989 flow [2024-05-12 11:40:47,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:40:47,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:47,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:47,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-05-12 11:40:47,632 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:47,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 300506220, now seen corresponding path program 1 times [2024-05-12 11:40:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536701853] [2024-05-12 11:40:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:47,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:40:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:40:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:40:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536701853] [2024-05-12 11:40:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536701853] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:40:53,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:40:53,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:40:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969815221] [2024-05-12 11:40:53,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:40:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:40:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:40:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:40:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:40:53,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:40:53,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 380 transitions, 5989 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-05-12 11:40:53,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:40:53,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:40:53,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:40:56,502 INFO L124 PetriNetUnfolderBase]: 4013/7789 cut-off events. [2024-05-12 11:40:56,502 INFO L125 PetriNetUnfolderBase]: For 185620/185759 co-relation queries the response was YES. [2024-05-12 11:40:56,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47060 conditions, 7789 events. 4013/7789 cut-off events. For 185620/185759 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 65579 event pairs, 1404 based on Foata normal form. 121/7818 useless extension candidates. Maximal degree in co-relation 46919. Up to 6194 conditions per place. [2024-05-12 11:40:56,590 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 362 selfloop transitions, 69 changer transitions 6/446 dead transitions. [2024-05-12 11:40:56,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 446 transitions, 7252 flow [2024-05-12 11:40:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:40:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:40:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-05-12 11:40:56,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48423423423423423 [2024-05-12 11:40:56,591 INFO L175 Difference]: Start difference. First operand has 317 places, 380 transitions, 5989 flow. Second operand 12 states and 215 transitions. [2024-05-12 11:40:56,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 446 transitions, 7252 flow [2024-05-12 11:40:57,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 446 transitions, 6901 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 11:40:57,949 INFO L231 Difference]: Finished difference. Result has 323 places, 386 transitions, 5912 flow [2024-05-12 11:40:57,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5912, PETRI_PLACES=323, PETRI_TRANSITIONS=386} [2024-05-12 11:40:57,950 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places. [2024-05-12 11:40:57,950 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 386 transitions, 5912 flow [2024-05-12 11:40:57,950 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-05-12 11:40:57,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:40:57,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:40:57,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-05-12 11:40:57,950 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:40:57,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:40:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 300268636, now seen corresponding path program 14 times [2024-05-12 11:40:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:40:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448982434] [2024-05-12 11:40:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:40:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:40:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448982434] [2024-05-12 11:41:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448982434] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:03,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:03,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:41:03,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318609473] [2024-05-12 11:41:03,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:03,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:41:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:03,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:41:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:41:03,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 11:41:03,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 386 transitions, 5912 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:03,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:03,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 11:41:03,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:05,804 INFO L124 PetriNetUnfolderBase]: 3778/7518 cut-off events. [2024-05-12 11:41:05,804 INFO L125 PetriNetUnfolderBase]: For 205040/205179 co-relation queries the response was YES. [2024-05-12 11:41:05,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44858 conditions, 7518 events. 3778/7518 cut-off events. For 205040/205179 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 65620 event pairs, 1422 based on Foata normal form. 128/7516 useless extension candidates. Maximal degree in co-relation 44714. Up to 5852 conditions per place. [2024-05-12 11:41:05,894 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 361 selfloop transitions, 65 changer transitions 8/445 dead transitions. [2024-05-12 11:41:05,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 445 transitions, 7143 flow [2024-05-12 11:41:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:41:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:41:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 236 transitions. [2024-05-12 11:41:05,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49064449064449067 [2024-05-12 11:41:05,895 INFO L175 Difference]: Start difference. First operand has 323 places, 386 transitions, 5912 flow. Second operand 13 states and 236 transitions. [2024-05-12 11:41:05,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 445 transitions, 7143 flow [2024-05-12 11:41:06,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 445 transitions, 7038 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-05-12 11:41:06,927 INFO L231 Difference]: Finished difference. Result has 330 places, 388 transitions, 5980 flow [2024-05-12 11:41:06,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5807, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5980, PETRI_PLACES=330, PETRI_TRANSITIONS=388} [2024-05-12 11:41:06,928 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 289 predicate places. [2024-05-12 11:41:06,928 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 388 transitions, 5980 flow [2024-05-12 11:41:06,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:06,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:06,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:06,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-05-12 11:41:06,928 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:06,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1108113898, now seen corresponding path program 15 times [2024-05-12 11:41:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:06,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209683531] [2024-05-12 11:41:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209683531] [2024-05-12 11:41:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209683531] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:12,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:41:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589135029] [2024-05-12 11:41:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:12,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:41:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:12,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:41:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:41:12,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:41:12,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 388 transitions, 5980 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-05-12 11:41:12,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:12,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:41:12,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:14,912 INFO L124 PetriNetUnfolderBase]: 4336/8253 cut-off events. [2024-05-12 11:41:14,913 INFO L125 PetriNetUnfolderBase]: For 259954/260135 co-relation queries the response was YES. [2024-05-12 11:41:14,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50668 conditions, 8253 events. 4336/8253 cut-off events. For 259954/260135 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 68667 event pairs, 1236 based on Foata normal form. 174/8318 useless extension candidates. Maximal degree in co-relation 50522. Up to 5724 conditions per place. [2024-05-12 11:41:15,018 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 333 selfloop transitions, 111 changer transitions 0/453 dead transitions. [2024-05-12 11:41:15,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 453 transitions, 7362 flow [2024-05-12 11:41:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:41:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:41:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-05-12 11:41:15,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515970515970516 [2024-05-12 11:41:15,019 INFO L175 Difference]: Start difference. First operand has 330 places, 388 transitions, 5980 flow. Second operand 11 states and 210 transitions. [2024-05-12 11:41:15,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 453 transitions, 7362 flow [2024-05-12 11:41:16,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 453 transitions, 7235 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-05-12 11:41:16,223 INFO L231 Difference]: Finished difference. Result has 331 places, 388 transitions, 6080 flow [2024-05-12 11:41:16,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5853, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6080, PETRI_PLACES=331, PETRI_TRANSITIONS=388} [2024-05-12 11:41:16,223 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 290 predicate places. [2024-05-12 11:41:16,224 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 388 transitions, 6080 flow [2024-05-12 11:41:16,224 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-05-12 11:41:16,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:16,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:16,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-05-12 11:41:16,224 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:16,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 127605766, now seen corresponding path program 16 times [2024-05-12 11:41:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905552575] [2024-05-12 11:41:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905552575] [2024-05-12 11:41:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905552575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:22,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:41:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760826865] [2024-05-12 11:41:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:22,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:41:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:22,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:41:22,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:41:22,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:41:22,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 388 transitions, 6080 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:22,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:22,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:41:22,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:25,620 INFO L124 PetriNetUnfolderBase]: 4415/8588 cut-off events. [2024-05-12 11:41:25,620 INFO L125 PetriNetUnfolderBase]: For 279535/279679 co-relation queries the response was YES. [2024-05-12 11:41:25,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52038 conditions, 8588 events. 4415/8588 cut-off events. For 279535/279679 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 73939 event pairs, 1583 based on Foata normal form. 136/8617 useless extension candidates. Maximal degree in co-relation 51891. Up to 6804 conditions per place. [2024-05-12 11:41:25,738 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 363 selfloop transitions, 78 changer transitions 0/450 dead transitions. [2024-05-12 11:41:25,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 450 transitions, 7305 flow [2024-05-12 11:41:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:41:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:41:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-05-12 11:41:25,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085995085995086 [2024-05-12 11:41:25,739 INFO L175 Difference]: Start difference. First operand has 331 places, 388 transitions, 6080 flow. Second operand 11 states and 207 transitions. [2024-05-12 11:41:25,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 450 transitions, 7305 flow [2024-05-12 11:41:27,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 450 transitions, 7086 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 11:41:27,229 INFO L231 Difference]: Finished difference. Result has 333 places, 389 transitions, 6037 flow [2024-05-12 11:41:27,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5861, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6037, PETRI_PLACES=333, PETRI_TRANSITIONS=389} [2024-05-12 11:41:27,229 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 292 predicate places. [2024-05-12 11:41:27,230 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 389 transitions, 6037 flow [2024-05-12 11:41:27,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:41:27,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:27,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:27,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-05-12 11:41:27,230 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:27,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 300514590, now seen corresponding path program 2 times [2024-05-12 11:41:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:27,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502912173] [2024-05-12 11:41:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:32,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502912173] [2024-05-12 11:41:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502912173] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:32,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:32,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:41:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446973772] [2024-05-12 11:41:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:32,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:41:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:32,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:41:32,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:41:32,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:41:32,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 389 transitions, 6037 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-05-12 11:41:32,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:32,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:41:32,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:35,470 INFO L124 PetriNetUnfolderBase]: 4268/8335 cut-off events. [2024-05-12 11:41:35,470 INFO L125 PetriNetUnfolderBase]: For 212566/212711 co-relation queries the response was YES. [2024-05-12 11:41:35,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49579 conditions, 8335 events. 4268/8335 cut-off events. For 212566/212711 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 71623 event pairs, 1571 based on Foata normal form. 127/8361 useless extension candidates. Maximal degree in co-relation 49431. Up to 6643 conditions per place. [2024-05-12 11:41:35,576 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 372 selfloop transitions, 68 changer transitions 3/452 dead transitions. [2024-05-12 11:41:35,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 452 transitions, 7405 flow [2024-05-12 11:41:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:41:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:41:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-05-12 11:41:35,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48423423423423423 [2024-05-12 11:41:35,577 INFO L175 Difference]: Start difference. First operand has 333 places, 389 transitions, 6037 flow. Second operand 12 states and 215 transitions. [2024-05-12 11:41:35,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 452 transitions, 7405 flow [2024-05-12 11:41:36,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 452 transitions, 7245 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-05-12 11:41:36,827 INFO L231 Difference]: Finished difference. Result has 337 places, 391 transitions, 6047 flow [2024-05-12 11:41:36,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5877, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6047, PETRI_PLACES=337, PETRI_TRANSITIONS=391} [2024-05-12 11:41:36,828 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 296 predicate places. [2024-05-12 11:41:36,828 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 391 transitions, 6047 flow [2024-05-12 11:41:36,828 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-05-12 11:41:36,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:36,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:36,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-05-12 11:41:36,828 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:36,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash 293839546, now seen corresponding path program 17 times [2024-05-12 11:41:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973693739] [2024-05-12 11:41:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:42,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973693739] [2024-05-12 11:41:42,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973693739] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:42,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:42,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:41:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238453923] [2024-05-12 11:41:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:42,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:41:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:42,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:41:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:41:42,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:41:42,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 391 transitions, 6047 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-05-12 11:41:42,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:42,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:41:42,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:45,186 INFO L124 PetriNetUnfolderBase]: 4324/8448 cut-off events. [2024-05-12 11:41:45,187 INFO L125 PetriNetUnfolderBase]: For 236088/236238 co-relation queries the response was YES. [2024-05-12 11:41:45,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50140 conditions, 8448 events. 4324/8448 cut-off events. For 236088/236238 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 72676 event pairs, 1561 based on Foata normal form. 139/8486 useless extension candidates. Maximal degree in co-relation 49991. Up to 6606 conditions per place. [2024-05-12 11:41:45,285 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 375 selfloop transitions, 67 changer transitions 0/451 dead transitions. [2024-05-12 11:41:45,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 451 transitions, 7261 flow [2024-05-12 11:41:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:41:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:41:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-05-12 11:41:45,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012285012285013 [2024-05-12 11:41:45,286 INFO L175 Difference]: Start difference. First operand has 337 places, 391 transitions, 6047 flow. Second operand 11 states and 204 transitions. [2024-05-12 11:41:45,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 451 transitions, 7261 flow [2024-05-12 11:41:46,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 451 transitions, 7161 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-05-12 11:41:46,691 INFO L231 Difference]: Finished difference. Result has 340 places, 391 transitions, 6085 flow [2024-05-12 11:41:46,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5947, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6085, PETRI_PLACES=340, PETRI_TRANSITIONS=391} [2024-05-12 11:41:46,691 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places. [2024-05-12 11:41:46,691 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 391 transitions, 6085 flow [2024-05-12 11:41:46,692 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-05-12 11:41:46,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:46,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:46,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-12 11:41:46,692 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:46,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1108298472, now seen corresponding path program 3 times [2024-05-12 11:41:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:46,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895519597] [2024-05-12 11:41:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:46,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:41:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:41:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:41:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895519597] [2024-05-12 11:41:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895519597] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:41:52,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:41:52,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:41:52,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976881461] [2024-05-12 11:41:52,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:41:52,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:41:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:41:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:41:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:41:52,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:41:52,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 391 transitions, 6085 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-05-12 11:41:52,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:41:52,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:41:52,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:41:55,029 INFO L124 PetriNetUnfolderBase]: 4321/8459 cut-off events. [2024-05-12 11:41:55,029 INFO L125 PetriNetUnfolderBase]: For 214264/214399 co-relation queries the response was YES. [2024-05-12 11:41:55,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50262 conditions, 8459 events. 4321/8459 cut-off events. For 214264/214399 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 72995 event pairs, 1591 based on Foata normal form. 117/8474 useless extension candidates. Maximal degree in co-relation 50111. Up to 6840 conditions per place. [2024-05-12 11:41:55,144 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 371 selfloop transitions, 61 changer transitions 0/441 dead transitions. [2024-05-12 11:41:55,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 441 transitions, 7201 flow [2024-05-12 11:41:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:41:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:41:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-05-12 11:41:55,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2024-05-12 11:41:55,145 INFO L175 Difference]: Start difference. First operand has 340 places, 391 transitions, 6085 flow. Second operand 10 states and 183 transitions. [2024-05-12 11:41:55,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 441 transitions, 7201 flow [2024-05-12 11:41:56,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 441 transitions, 7071 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 11:41:56,873 INFO L231 Difference]: Finished difference. Result has 342 places, 391 transitions, 6081 flow [2024-05-12 11:41:56,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5955, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6081, PETRI_PLACES=342, PETRI_TRANSITIONS=391} [2024-05-12 11:41:56,874 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 301 predicate places. [2024-05-12 11:41:56,874 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 391 transitions, 6081 flow [2024-05-12 11:41:56,874 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-05-12 11:41:56,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:41:56,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:41:56,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-05-12 11:41:56,874 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:41:56,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:41:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1108291528, now seen corresponding path program 18 times [2024-05-12 11:41:56,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:41:56,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399793575] [2024-05-12 11:41:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:41:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:41:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399793575] [2024-05-12 11:42:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399793575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:42:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282101013] [2024-05-12 11:42:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:02,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:42:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:42:02,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:42:02,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:42:02,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 391 transitions, 6081 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-05-12 11:42:02,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:02,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:42:02,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:05,133 INFO L124 PetriNetUnfolderBase]: 4425/8647 cut-off events. [2024-05-12 11:42:05,133 INFO L125 PetriNetUnfolderBase]: For 258178/258313 co-relation queries the response was YES. [2024-05-12 11:42:05,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51136 conditions, 8647 events. 4425/8647 cut-off events. For 258178/258313 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 74968 event pairs, 1613 based on Foata normal form. 131/8676 useless extension candidates. Maximal degree in co-relation 50984. Up to 6782 conditions per place. [2024-05-12 11:42:05,248 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 380 selfloop transitions, 62 changer transitions 0/451 dead transitions. [2024-05-12 11:42:05,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 451 transitions, 7295 flow [2024-05-12 11:42:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:42:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:42:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-05-12 11:42:05,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012285012285013 [2024-05-12 11:42:05,249 INFO L175 Difference]: Start difference. First operand has 342 places, 391 transitions, 6081 flow. Second operand 11 states and 204 transitions. [2024-05-12 11:42:05,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 451 transitions, 7295 flow [2024-05-12 11:42:07,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 451 transitions, 7164 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-05-12 11:42:07,071 INFO L231 Difference]: Finished difference. Result has 344 places, 391 transitions, 6079 flow [2024-05-12 11:42:07,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5950, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6079, PETRI_PLACES=344, PETRI_TRANSITIONS=391} [2024-05-12 11:42:07,072 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places. [2024-05-12 11:42:07,072 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 391 transitions, 6079 flow [2024-05-12 11:42:07,072 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-05-12 11:42:07,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:07,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:07,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-05-12 11:42:07,072 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:07,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 942057748, now seen corresponding path program 19 times [2024-05-12 11:42:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600632107] [2024-05-12 11:42:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:12,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:12,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600632107] [2024-05-12 11:42:12,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600632107] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:12,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:12,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:42:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602110226] [2024-05-12 11:42:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:12,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:42:12,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:12,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:42:12,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:42:12,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:42:12,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 391 transitions, 6079 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:12,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:12,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:42:12,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:15,333 INFO L124 PetriNetUnfolderBase]: 4493/8768 cut-off events. [2024-05-12 11:42:15,333 INFO L125 PetriNetUnfolderBase]: For 247027/247161 co-relation queries the response was YES. [2024-05-12 11:42:15,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51707 conditions, 8768 events. 4493/8768 cut-off events. For 247027/247161 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 76158 event pairs, 1615 based on Foata normal form. 124/8784 useless extension candidates. Maximal degree in co-relation 51554. Up to 7016 conditions per place. [2024-05-12 11:42:15,434 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 366 selfloop transitions, 71 changer transitions 0/446 dead transitions. [2024-05-12 11:42:15,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 446 transitions, 7252 flow [2024-05-12 11:42:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:42:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:42:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-05-12 11:42:15,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2024-05-12 11:42:15,435 INFO L175 Difference]: Start difference. First operand has 344 places, 391 transitions, 6079 flow. Second operand 10 states and 188 transitions. [2024-05-12 11:42:15,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 446 transitions, 7252 flow [2024-05-12 11:42:16,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 446 transitions, 7121 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-05-12 11:42:16,914 INFO L231 Difference]: Finished difference. Result has 344 places, 391 transitions, 6094 flow [2024-05-12 11:42:16,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5948, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6094, PETRI_PLACES=344, PETRI_TRANSITIONS=391} [2024-05-12 11:42:16,914 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 303 predicate places. [2024-05-12 11:42:16,914 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 391 transitions, 6094 flow [2024-05-12 11:42:16,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:16,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:16,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:16,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-05-12 11:42:16,915 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:16,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 941880118, now seen corresponding path program 20 times [2024-05-12 11:42:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927418977] [2024-05-12 11:42:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:22,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927418977] [2024-05-12 11:42:22,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927418977] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:22,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:22,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:42:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866436402] [2024-05-12 11:42:22,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:22,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:42:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:42:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:42:22,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:42:22,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 391 transitions, 6094 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:22,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:22,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:42:22,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:25,210 INFO L124 PetriNetUnfolderBase]: 4589/8661 cut-off events. [2024-05-12 11:42:25,210 INFO L125 PetriNetUnfolderBase]: For 238707/238865 co-relation queries the response was YES. [2024-05-12 11:42:25,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52030 conditions, 8661 events. 4589/8661 cut-off events. For 238707/238865 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 72466 event pairs, 1207 based on Foata normal form. 152/8697 useless extension candidates. Maximal degree in co-relation 51878. Up to 6485 conditions per place. [2024-05-12 11:42:25,310 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 312 selfloop transitions, 134 changer transitions 0/455 dead transitions. [2024-05-12 11:42:25,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 455 transitions, 7367 flow [2024-05-12 11:42:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:42:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:42:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-05-12 11:42:25,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297297297297298 [2024-05-12 11:42:25,311 INFO L175 Difference]: Start difference. First operand has 344 places, 391 transitions, 6094 flow. Second operand 10 states and 196 transitions. [2024-05-12 11:42:25,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 455 transitions, 7367 flow [2024-05-12 11:42:26,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 455 transitions, 7227 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 11:42:26,882 INFO L231 Difference]: Finished difference. Result has 347 places, 395 transitions, 6304 flow [2024-05-12 11:42:26,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5954, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6304, PETRI_PLACES=347, PETRI_TRANSITIONS=395} [2024-05-12 11:42:26,882 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 306 predicate places. [2024-05-12 11:42:26,882 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 395 transitions, 6304 flow [2024-05-12 11:42:26,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:42:26,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:26,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:26,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-05-12 11:42:26,883 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:26,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2015379940, now seen corresponding path program 21 times [2024-05-12 11:42:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:26,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403934432] [2024-05-12 11:42:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403934432] [2024-05-12 11:42:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403934432] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:42:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110844853] [2024-05-12 11:42:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:32,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:42:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:42:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:42:32,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:42:32,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 395 transitions, 6304 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-05-12 11:42:32,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:32,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:42:32,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:35,443 INFO L124 PetriNetUnfolderBase]: 4692/8834 cut-off events. [2024-05-12 11:42:35,444 INFO L125 PetriNetUnfolderBase]: For 280204/280457 co-relation queries the response was YES. [2024-05-12 11:42:35,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54028 conditions, 8834 events. 4692/8834 cut-off events. For 280204/280457 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 74902 event pairs, 1995 based on Foata normal form. 143/8820 useless extension candidates. Maximal degree in co-relation 53874. Up to 7256 conditions per place. [2024-05-12 11:42:35,548 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 405 selfloop transitions, 40 changer transitions 0/454 dead transitions. [2024-05-12 11:42:35,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 454 transitions, 7668 flow [2024-05-12 11:42:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:42:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:42:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 11:42:35,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 11:42:35,549 INFO L175 Difference]: Start difference. First operand has 347 places, 395 transitions, 6304 flow. Second operand 11 states and 198 transitions. [2024-05-12 11:42:35,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 454 transitions, 7668 flow [2024-05-12 11:42:37,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 454 transitions, 7402 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 11:42:37,432 INFO L231 Difference]: Finished difference. Result has 352 places, 395 transitions, 6122 flow [2024-05-12 11:42:37,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6038, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6122, PETRI_PLACES=352, PETRI_TRANSITIONS=395} [2024-05-12 11:42:37,433 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 311 predicate places. [2024-05-12 11:42:37,433 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 395 transitions, 6122 flow [2024-05-12 11:42:37,433 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-05-12 11:42:37,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:37,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:37,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-05-12 11:42:37,434 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:37,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash 613594874, now seen corresponding path program 22 times [2024-05-12 11:42:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:37,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193696120] [2024-05-12 11:42:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193696120] [2024-05-12 11:42:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193696120] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:42,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:42:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087086126] [2024-05-12 11:42:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:42,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:42:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:42:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:42:43,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:42:43,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 395 transitions, 6122 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-05-12 11:42:43,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:43,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:42:43,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:46,216 INFO L124 PetriNetUnfolderBase]: 4686/8883 cut-off events. [2024-05-12 11:42:46,217 INFO L125 PetriNetUnfolderBase]: For 259192/259452 co-relation queries the response was YES. [2024-05-12 11:42:46,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52979 conditions, 8883 events. 4686/8883 cut-off events. For 259192/259452 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 75303 event pairs, 1932 based on Foata normal form. 151/8876 useless extension candidates. Maximal degree in co-relation 52824. Up to 7552 conditions per place. [2024-05-12 11:42:46,324 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 365 selfloop transitions, 78 changer transitions 0/452 dead transitions. [2024-05-12 11:42:46,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 452 transitions, 7308 flow [2024-05-12 11:42:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:42:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:42:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-05-12 11:42:46,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-05-12 11:42:46,325 INFO L175 Difference]: Start difference. First operand has 352 places, 395 transitions, 6122 flow. Second operand 11 states and 198 transitions. [2024-05-12 11:42:46,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 452 transitions, 7308 flow [2024-05-12 11:42:47,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 452 transitions, 7253 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 11:42:47,781 INFO L231 Difference]: Finished difference. Result has 356 places, 395 transitions, 6229 flow [2024-05-12 11:42:47,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6067, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6229, PETRI_PLACES=356, PETRI_TRANSITIONS=395} [2024-05-12 11:42:47,781 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 315 predicate places. [2024-05-12 11:42:47,781 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 395 transitions, 6229 flow [2024-05-12 11:42:47,782 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-05-12 11:42:47,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:47,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:47,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-12 11:42:47,782 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:47,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1665466364, now seen corresponding path program 4 times [2024-05-12 11:42:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:47,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618922667] [2024-05-12 11:42:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:42:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:42:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:42:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618922667] [2024-05-12 11:42:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618922667] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:42:52,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:42:52,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:42:52,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958208391] [2024-05-12 11:42:52,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:42:52,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:42:52,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:42:52,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:42:52,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:42:52,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:42:52,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 395 transitions, 6229 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-05-12 11:42:52,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:42:52,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:42:52,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:42:55,600 INFO L124 PetriNetUnfolderBase]: 4696/8871 cut-off events. [2024-05-12 11:42:55,601 INFO L125 PetriNetUnfolderBase]: For 239965/240213 co-relation queries the response was YES. [2024-05-12 11:42:55,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53294 conditions, 8871 events. 4696/8871 cut-off events. For 239965/240213 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 75547 event pairs, 2080 based on Foata normal form. 128/8835 useless extension candidates. Maximal degree in co-relation 53138. Up to 8016 conditions per place. [2024-05-12 11:42:55,728 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 382 selfloop transitions, 36 changer transitions 6/433 dead transitions. [2024-05-12 11:42:55,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 433 transitions, 7245 flow [2024-05-12 11:42:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:42:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:42:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-05-12 11:42:55,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-05-12 11:42:55,729 INFO L175 Difference]: Start difference. First operand has 356 places, 395 transitions, 6229 flow. Second operand 10 states and 169 transitions. [2024-05-12 11:42:55,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 433 transitions, 7245 flow [2024-05-12 11:42:57,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 433 transitions, 7093 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 11:42:57,574 INFO L231 Difference]: Finished difference. Result has 357 places, 396 transitions, 6173 flow [2024-05-12 11:42:57,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6077, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6173, PETRI_PLACES=357, PETRI_TRANSITIONS=396} [2024-05-12 11:42:57,574 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 316 predicate places. [2024-05-12 11:42:57,574 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 396 transitions, 6173 flow [2024-05-12 11:42:57,575 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-05-12 11:42:57,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:42:57,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:42:57,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-05-12 11:42:57,575 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:42:57,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:42:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 620269918, now seen corresponding path program 5 times [2024-05-12 11:42:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:42:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151543978] [2024-05-12 11:42:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:42:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:42:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151543978] [2024-05-12 11:43:03,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151543978] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:03,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:03,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:43:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044414902] [2024-05-12 11:43:03,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:03,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:43:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:03,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:43:03,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:43:03,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:43:03,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 396 transitions, 6173 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:03,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:03,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:43:03,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:06,335 INFO L124 PetriNetUnfolderBase]: 4713/8909 cut-off events. [2024-05-12 11:43:06,336 INFO L125 PetriNetUnfolderBase]: For 245422/245682 co-relation queries the response was YES. [2024-05-12 11:43:06,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53412 conditions, 8909 events. 4713/8909 cut-off events. For 245422/245682 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 75888 event pairs, 2106 based on Foata normal form. 142/8891 useless extension candidates. Maximal degree in co-relation 53255. Up to 7946 conditions per place. [2024-05-12 11:43:06,438 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 398 selfloop transitions, 41 changer transitions 3/451 dead transitions. [2024-05-12 11:43:06,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 451 transitions, 7353 flow [2024-05-12 11:43:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:43:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:43:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2024-05-12 11:43:06,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-05-12 11:43:06,440 INFO L175 Difference]: Start difference. First operand has 357 places, 396 transitions, 6173 flow. Second operand 12 states and 204 transitions. [2024-05-12 11:43:06,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 451 transitions, 7353 flow [2024-05-12 11:43:08,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 451 transitions, 7271 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-05-12 11:43:08,082 INFO L231 Difference]: Finished difference. Result has 361 places, 398 transitions, 6215 flow [2024-05-12 11:43:08,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6091, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6215, PETRI_PLACES=361, PETRI_TRANSITIONS=398} [2024-05-12 11:43:08,083 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places. [2024-05-12 11:43:08,083 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 398 transitions, 6215 flow [2024-05-12 11:43:08,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:08,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:08,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:08,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-12 11:43:08,084 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:08,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1445010616, now seen corresponding path program 6 times [2024-05-12 11:43:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695054583] [2024-05-12 11:43:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:14,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695054583] [2024-05-12 11:43:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695054583] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:14,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:14,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:43:14,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855721628] [2024-05-12 11:43:14,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:14,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:43:14,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:14,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:43:14,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:43:14,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:43:14,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 398 transitions, 6215 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-05-12 11:43:14,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:14,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:43:14,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:17,191 INFO L124 PetriNetUnfolderBase]: 4754/8977 cut-off events. [2024-05-12 11:43:17,191 INFO L125 PetriNetUnfolderBase]: For 268902/269154 co-relation queries the response was YES. [2024-05-12 11:43:17,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53111 conditions, 8977 events. 4754/8977 cut-off events. For 268902/269154 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 76501 event pairs, 2138 based on Foata normal form. 150/8963 useless extension candidates. Maximal degree in co-relation 52953. Up to 7878 conditions per place. [2024-05-12 11:43:17,307 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 398 selfloop transitions, 31 changer transitions 12/450 dead transitions. [2024-05-12 11:43:17,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 450 transitions, 7431 flow [2024-05-12 11:43:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:43:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:43:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-05-12 11:43:17,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2024-05-12 11:43:17,308 INFO L175 Difference]: Start difference. First operand has 361 places, 398 transitions, 6215 flow. Second operand 11 states and 189 transitions. [2024-05-12 11:43:17,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 450 transitions, 7431 flow [2024-05-12 11:43:18,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 450 transitions, 7363 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 11:43:18,985 INFO L231 Difference]: Finished difference. Result has 368 places, 403 transitions, 6309 flow [2024-05-12 11:43:18,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6147, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6309, PETRI_PLACES=368, PETRI_TRANSITIONS=403} [2024-05-12 11:43:18,985 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 327 predicate places. [2024-05-12 11:43:18,985 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 403 transitions, 6309 flow [2024-05-12 11:43:18,986 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-05-12 11:43:18,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:18,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:18,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-05-12 11:43:18,986 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:18,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1372372222, now seen corresponding path program 7 times [2024-05-12 11:43:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:18,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602730099] [2024-05-12 11:43:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:24,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:24,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602730099] [2024-05-12 11:43:24,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602730099] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:24,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:24,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:43:24,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021097188] [2024-05-12 11:43:24,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:24,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:43:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:24,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:43:24,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:43:24,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:43:24,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 403 transitions, 6309 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:24,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:24,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:43:24,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:27,350 INFO L124 PetriNetUnfolderBase]: 4771/9036 cut-off events. [2024-05-12 11:43:27,350 INFO L125 PetriNetUnfolderBase]: For 219955/220224 co-relation queries the response was YES. [2024-05-12 11:43:27,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53279 conditions, 9036 events. 4771/9036 cut-off events. For 219955/220224 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 77357 event pairs, 2131 based on Foata normal form. 149/9022 useless extension candidates. Maximal degree in co-relation 53117. Up to 8104 conditions per place. [2024-05-12 11:43:27,466 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 396 selfloop transitions, 33 changer transitions 3/441 dead transitions. [2024-05-12 11:43:27,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 441 transitions, 7343 flow [2024-05-12 11:43:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:43:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:43:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-05-12 11:43:27,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-05-12 11:43:27,467 INFO L175 Difference]: Start difference. First operand has 368 places, 403 transitions, 6309 flow. Second operand 10 states and 170 transitions. [2024-05-12 11:43:27,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 441 transitions, 7343 flow [2024-05-12 11:43:29,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 441 transitions, 7310 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 11:43:29,058 INFO L231 Difference]: Finished difference. Result has 373 places, 404 transitions, 6368 flow [2024-05-12 11:43:29,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6276, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6368, PETRI_PLACES=373, PETRI_TRANSITIONS=404} [2024-05-12 11:43:29,058 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 332 predicate places. [2024-05-12 11:43:29,058 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 404 transitions, 6368 flow [2024-05-12 11:43:29,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:43:29,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:29,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:29,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-05-12 11:43:29,058 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:29,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1204096588, now seen corresponding path program 8 times [2024-05-12 11:43:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389830588] [2024-05-12 11:43:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:34,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389830588] [2024-05-12 11:43:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389830588] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:34,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:34,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:43:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794589937] [2024-05-12 11:43:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:34,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:43:34,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:43:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:43:34,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:43:34,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 404 transitions, 6368 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-05-12 11:43:34,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:34,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:43:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:37,362 INFO L124 PetriNetUnfolderBase]: 4772/9036 cut-off events. [2024-05-12 11:43:37,362 INFO L125 PetriNetUnfolderBase]: For 217290/217540 co-relation queries the response was YES. [2024-05-12 11:43:37,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53300 conditions, 9036 events. 4772/9036 cut-off events. For 217290/217540 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 77294 event pairs, 2192 based on Foata normal form. 132/9005 useless extension candidates. Maximal degree in co-relation 53137. Up to 8200 conditions per place. [2024-05-12 11:43:37,479 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 406 selfloop transitions, 29 changer transitions 1/445 dead transitions. [2024-05-12 11:43:37,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 445 transitions, 7442 flow [2024-05-12 11:43:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:43:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:43:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-05-12 11:43:37,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-05-12 11:43:37,480 INFO L175 Difference]: Start difference. First operand has 373 places, 404 transitions, 6368 flow. Second operand 10 states and 169 transitions. [2024-05-12 11:43:37,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 445 transitions, 7442 flow [2024-05-12 11:43:39,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 445 transitions, 7360 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-05-12 11:43:39,024 INFO L231 Difference]: Finished difference. Result has 375 places, 405 transitions, 6372 flow [2024-05-12 11:43:39,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6286, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6372, PETRI_PLACES=375, PETRI_TRANSITIONS=405} [2024-05-12 11:43:39,024 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 334 predicate places. [2024-05-12 11:43:39,024 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 405 transitions, 6372 flow [2024-05-12 11:43:39,024 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-05-12 11:43:39,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:39,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:39,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-05-12 11:43:39,025 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:39,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1438569932, now seen corresponding path program 23 times [2024-05-12 11:43:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148178928] [2024-05-12 11:43:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148178928] [2024-05-12 11:43:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148178928] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:44,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:43:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822516772] [2024-05-12 11:43:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:44,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:43:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:43:44,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:43:44,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:43:44,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 405 transitions, 6372 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-05-12 11:43:44,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:44,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:43:44,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:47,712 INFO L124 PetriNetUnfolderBase]: 4880/9224 cut-off events. [2024-05-12 11:43:47,712 INFO L125 PetriNetUnfolderBase]: For 263283/263539 co-relation queries the response was YES. [2024-05-12 11:43:47,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54575 conditions, 9224 events. 4880/9224 cut-off events. For 263283/263539 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 79126 event pairs, 2131 based on Foata normal form. 145/9209 useless extension candidates. Maximal degree in co-relation 54411. Up to 7665 conditions per place. [2024-05-12 11:43:47,830 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 417 selfloop transitions, 33 changer transitions 0/459 dead transitions. [2024-05-12 11:43:47,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 459 transitions, 7726 flow [2024-05-12 11:43:47,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:43:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:43:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 11:43:47,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742014742014742 [2024-05-12 11:43:47,831 INFO L175 Difference]: Start difference. First operand has 375 places, 405 transitions, 6372 flow. Second operand 11 states and 193 transitions. [2024-05-12 11:43:47,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 459 transitions, 7726 flow [2024-05-12 11:43:49,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 459 transitions, 7651 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 11:43:49,697 INFO L231 Difference]: Finished difference. Result has 379 places, 405 transitions, 6367 flow [2024-05-12 11:43:49,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6297, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6367, PETRI_PLACES=379, PETRI_TRANSITIONS=405} [2024-05-12 11:43:49,697 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 338 predicate places. [2024-05-12 11:43:49,697 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 405 transitions, 6367 flow [2024-05-12 11:43:49,697 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-05-12 11:43:49,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:43:49,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:43:49,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-05-12 11:43:49,698 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:43:49,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:43:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1790481384, now seen corresponding path program 24 times [2024-05-12 11:43:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:43:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442212535] [2024-05-12 11:43:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:43:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:43:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:43:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:43:55,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:43:55,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442212535] [2024-05-12 11:43:55,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442212535] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:43:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:43:55,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:43:55,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492360824] [2024-05-12 11:43:55,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:43:55,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:43:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:43:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:43:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:43:55,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:43:55,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 405 transitions, 6367 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-05-12 11:43:55,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:43:55,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:43:55,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:43:58,304 INFO L124 PetriNetUnfolderBase]: 4901/9265 cut-off events. [2024-05-12 11:43:58,304 INFO L125 PetriNetUnfolderBase]: For 246514/246776 co-relation queries the response was YES. [2024-05-12 11:43:58,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54492 conditions, 9265 events. 4901/9265 cut-off events. For 246514/246776 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 79587 event pairs, 2247 based on Foata normal form. 145/9246 useless extension candidates. Maximal degree in co-relation 54327. Up to 8367 conditions per place. [2024-05-12 11:43:58,418 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 400 selfloop transitions, 32 changer transitions 9/450 dead transitions. [2024-05-12 11:43:58,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 450 transitions, 7471 flow [2024-05-12 11:43:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:43:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:43:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-05-12 11:43:58,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44819819819819817 [2024-05-12 11:43:58,419 INFO L175 Difference]: Start difference. First operand has 379 places, 405 transitions, 6367 flow. Second operand 12 states and 199 transitions. [2024-05-12 11:43:58,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 450 transitions, 7471 flow [2024-05-12 11:44:00,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 450 transitions, 7421 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 11:44:00,110 INFO L231 Difference]: Finished difference. Result has 384 places, 407 transitions, 6431 flow [2024-05-12 11:44:00,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6317, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6431, PETRI_PLACES=384, PETRI_TRANSITIONS=407} [2024-05-12 11:44:00,110 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 343 predicate places. [2024-05-12 11:44:00,110 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 407 transitions, 6431 flow [2024-05-12 11:44:00,111 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-05-12 11:44:00,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:00,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:00,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-05-12 11:44:00,111 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:00,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1204276512, now seen corresponding path program 25 times [2024-05-12 11:44:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:00,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519890694] [2024-05-12 11:44:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519890694] [2024-05-12 11:44:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519890694] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:05,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:05,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:44:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42059724] [2024-05-12 11:44:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:05,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:44:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:44:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:44:05,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:44:05,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 407 transitions, 6431 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-05-12 11:44:05,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:05,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:44:05,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:08,811 INFO L124 PetriNetUnfolderBase]: 4888/9289 cut-off events. [2024-05-12 11:44:08,811 INFO L125 PetriNetUnfolderBase]: For 232822/233077 co-relation queries the response was YES. [2024-05-12 11:44:08,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54457 conditions, 9289 events. 4888/9289 cut-off events. For 232822/233077 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 80112 event pairs, 2214 based on Foata normal form. 146/9270 useless extension candidates. Maximal degree in co-relation 54291. Up to 8203 conditions per place. [2024-05-12 11:44:08,931 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 413 selfloop transitions, 35 changer transitions 0/457 dead transitions. [2024-05-12 11:44:08,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 457 transitions, 7589 flow [2024-05-12 11:44:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:44:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:44:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-05-12 11:44:08,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668304668304668 [2024-05-12 11:44:08,935 INFO L175 Difference]: Start difference. First operand has 384 places, 407 transitions, 6431 flow. Second operand 11 states and 190 transitions. [2024-05-12 11:44:08,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 457 transitions, 7589 flow [2024-05-12 11:44:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 457 transitions, 7493 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-05-12 11:44:10,536 INFO L231 Difference]: Finished difference. Result has 385 places, 407 transitions, 6409 flow [2024-05-12 11:44:10,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6335, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6409, PETRI_PLACES=385, PETRI_TRANSITIONS=407} [2024-05-12 11:44:10,536 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 344 predicate places. [2024-05-12 11:44:10,536 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 407 transitions, 6409 flow [2024-05-12 11:44:10,536 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-05-12 11:44:10,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:10,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:10,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-05-12 11:44:10,537 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:10,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2018382534, now seen corresponding path program 26 times [2024-05-12 11:44:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:10,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297658165] [2024-05-12 11:44:10,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:10,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297658165] [2024-05-12 11:44:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297658165] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:44:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242588431] [2024-05-12 11:44:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:15,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:44:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:44:15,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:44:16,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:44:16,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 407 transitions, 6409 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-05-12 11:44:16,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:16,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:44:16,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:19,232 INFO L124 PetriNetUnfolderBase]: 4875/9255 cut-off events. [2024-05-12 11:44:19,232 INFO L125 PetriNetUnfolderBase]: For 198047/198303 co-relation queries the response was YES. [2024-05-12 11:44:19,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53286 conditions, 9255 events. 4875/9255 cut-off events. For 198047/198303 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 79756 event pairs, 2233 based on Foata normal form. 146/9238 useless extension candidates. Maximal degree in co-relation 53119. Up to 8261 conditions per place. [2024-05-12 11:44:19,354 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 417 selfloop transitions, 30 changer transitions 1/457 dead transitions. [2024-05-12 11:44:19,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 457 transitions, 7567 flow [2024-05-12 11:44:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:44:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:44:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-05-12 11:44:19,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2024-05-12 11:44:19,355 INFO L175 Difference]: Start difference. First operand has 385 places, 407 transitions, 6409 flow. Second operand 11 states and 189 transitions. [2024-05-12 11:44:19,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 457 transitions, 7567 flow [2024-05-12 11:44:21,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 457 transitions, 7499 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 11:44:21,104 INFO L231 Difference]: Finished difference. Result has 387 places, 407 transitions, 6405 flow [2024-05-12 11:44:21,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6341, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6405, PETRI_PLACES=387, PETRI_TRANSITIONS=407} [2024-05-12 11:44:21,104 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 346 predicate places. [2024-05-12 11:44:21,104 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 407 transitions, 6405 flow [2024-05-12 11:44:21,104 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-05-12 11:44:21,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:21,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:21,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-05-12 11:44:21,105 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:21,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1989523934, now seen corresponding path program 9 times [2024-05-12 11:44:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408764823] [2024-05-12 11:44:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408764823] [2024-05-12 11:44:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408764823] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:26,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:44:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733994803] [2024-05-12 11:44:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:26,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:44:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:26,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:44:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:44:26,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:44:26,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 407 transitions, 6405 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-05-12 11:44:26,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:26,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:44:26,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:29,681 INFO L124 PetriNetUnfolderBase]: 4892/9287 cut-off events. [2024-05-12 11:44:29,681 INFO L125 PetriNetUnfolderBase]: For 170304/170567 co-relation queries the response was YES. [2024-05-12 11:44:29,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53508 conditions, 9287 events. 4892/9287 cut-off events. For 170304/170567 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 80007 event pairs, 2211 based on Foata normal form. 143/9263 useless extension candidates. Maximal degree in co-relation 53340. Up to 8474 conditions per place. [2024-05-12 11:44:29,809 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 407 selfloop transitions, 25 changer transitions 3/444 dead transitions. [2024-05-12 11:44:29,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 444 transitions, 7431 flow [2024-05-12 11:44:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:44:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:44:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-05-12 11:44:29,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45135135135135135 [2024-05-12 11:44:29,810 INFO L175 Difference]: Start difference. First operand has 387 places, 407 transitions, 6405 flow. Second operand 10 states and 167 transitions. [2024-05-12 11:44:29,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 444 transitions, 7431 flow [2024-05-12 11:44:31,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 444 transitions, 7381 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-05-12 11:44:31,371 INFO L231 Difference]: Finished difference. Result has 389 places, 408 transitions, 6435 flow [2024-05-12 11:44:31,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6355, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6435, PETRI_PLACES=389, PETRI_TRANSITIONS=408} [2024-05-12 11:44:31,371 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 348 predicate places. [2024-05-12 11:44:31,371 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 408 transitions, 6435 flow [2024-05-12 11:44:31,371 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-05-12 11:44:31,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:31,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:31,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-05-12 11:44:31,371 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:31,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1445249626, now seen corresponding path program 10 times [2024-05-12 11:44:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548199880] [2024-05-12 11:44:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548199880] [2024-05-12 11:44:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548199880] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:37,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:37,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:44:37,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522183074] [2024-05-12 11:44:37,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:37,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:44:37,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:37,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:44:37,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:44:37,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:44:37,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 408 transitions, 6435 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-05-12 11:44:37,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:37,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:44:37,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:40,513 INFO L124 PetriNetUnfolderBase]: 4974/9433 cut-off events. [2024-05-12 11:44:40,513 INFO L125 PetriNetUnfolderBase]: For 212159/212430 co-relation queries the response was YES. [2024-05-12 11:44:40,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54636 conditions, 9433 events. 4974/9433 cut-off events. For 212159/212430 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 81666 event pairs, 2225 based on Foata normal form. 159/9431 useless extension candidates. Maximal degree in co-relation 54468. Up to 7887 conditions per place. [2024-05-12 11:44:40,649 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 414 selfloop transitions, 32 changer transitions 4/459 dead transitions. [2024-05-12 11:44:40,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 459 transitions, 7835 flow [2024-05-12 11:44:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:44:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:44:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-05-12 11:44:40,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47174447174447176 [2024-05-12 11:44:40,652 INFO L175 Difference]: Start difference. First operand has 389 places, 408 transitions, 6435 flow. Second operand 11 states and 192 transitions. [2024-05-12 11:44:40,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 459 transitions, 7835 flow [2024-05-12 11:44:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 459 transitions, 7765 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-05-12 11:44:42,563 INFO L231 Difference]: Finished difference. Result has 392 places, 408 transitions, 6432 flow [2024-05-12 11:44:42,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6365, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6432, PETRI_PLACES=392, PETRI_TRANSITIONS=408} [2024-05-12 11:44:42,563 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 351 predicate places. [2024-05-12 11:44:42,563 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 408 transitions, 6432 flow [2024-05-12 11:44:42,564 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-05-12 11:44:42,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:42,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:42,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-05-12 11:44:42,564 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:42,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1139371260, now seen corresponding path program 1 times [2024-05-12 11:44:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:42,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532907259] [2024-05-12 11:44:42,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532907259] [2024-05-12 11:44:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532907259] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:42,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:42,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:44:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002793674] [2024-05-12 11:44:42,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:44:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:42,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:44:42,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:44:42,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-05-12 11:44:42,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 408 transitions, 6432 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:42,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:42,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-05-12 11:44:42,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:45,766 INFO L124 PetriNetUnfolderBase]: 6459/13211 cut-off events. [2024-05-12 11:44:45,766 INFO L125 PetriNetUnfolderBase]: For 167909/168214 co-relation queries the response was YES. [2024-05-12 11:44:45,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70131 conditions, 13211 events. 6459/13211 cut-off events. For 167909/168214 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 129311 event pairs, 1913 based on Foata normal form. 679/13628 useless extension candidates. Maximal degree in co-relation 69962. Up to 5309 conditions per place. [2024-05-12 11:44:45,965 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 259 selfloop transitions, 104 changer transitions 435/924 dead transitions. [2024-05-12 11:44:45,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 924 transitions, 15889 flow [2024-05-12 11:44:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:44:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:44:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-05-12 11:44:45,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180180180180181 [2024-05-12 11:44:45,966 INFO L175 Difference]: Start difference. First operand has 392 places, 408 transitions, 6432 flow. Second operand 12 states and 230 transitions. [2024-05-12 11:44:45,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 924 transitions, 15889 flow [2024-05-12 11:44:49,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 924 transitions, 15808 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 11:44:49,141 INFO L231 Difference]: Finished difference. Result has 401 places, 399 transitions, 6470 flow [2024-05-12 11:44:49,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6369, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6470, PETRI_PLACES=401, PETRI_TRANSITIONS=399} [2024-05-12 11:44:49,142 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 360 predicate places. [2024-05-12 11:44:49,142 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 399 transitions, 6470 flow [2024-05-12 11:44:49,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:49,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:44:49,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:44:49,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-05-12 11:44:49,143 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:44:49,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:44:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash -377405734, now seen corresponding path program 1 times [2024-05-12 11:44:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:44:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494074859] [2024-05-12 11:44:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:44:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:44:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:44:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:44:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:44:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494074859] [2024-05-12 11:44:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494074859] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:44:56,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:44:56,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:44:56,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420327486] [2024-05-12 11:44:56,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:44:56,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:44:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:44:56,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:44:56,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:44:56,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-05-12 11:44:56,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 399 transitions, 6470 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:44:56,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:44:56,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-05-12 11:44:56,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:44:59,966 INFO L124 PetriNetUnfolderBase]: 5478/10704 cut-off events. [2024-05-12 11:44:59,966 INFO L125 PetriNetUnfolderBase]: For 175967/175987 co-relation queries the response was YES. [2024-05-12 11:45:00,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62426 conditions, 10704 events. 5478/10704 cut-off events. For 175967/175987 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 94341 event pairs, 2259 based on Foata normal form. 11/10704 useless extension candidates. Maximal degree in co-relation 62251. Up to 9038 conditions per place. [2024-05-12 11:45:00,131 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 428 selfloop transitions, 58 changer transitions 8/501 dead transitions. [2024-05-12 11:45:00,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 501 transitions, 8745 flow [2024-05-12 11:45:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:45:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:45:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 11:45:00,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756756756756757 [2024-05-12 11:45:00,132 INFO L175 Difference]: Start difference. First operand has 401 places, 399 transitions, 6470 flow. Second operand 10 states and 176 transitions. [2024-05-12 11:45:00,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 501 transitions, 8745 flow [2024-05-12 11:45:02,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 501 transitions, 8540 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-05-12 11:45:02,379 INFO L231 Difference]: Finished difference. Result has 398 places, 430 transitions, 7142 flow [2024-05-12 11:45:02,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6304, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7142, PETRI_PLACES=398, PETRI_TRANSITIONS=430} [2024-05-12 11:45:02,380 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 357 predicate places. [2024-05-12 11:45:02,380 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 430 transitions, 7142 flow [2024-05-12 11:45:02,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:02,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:02,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:02,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-05-12 11:45:02,380 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:02,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash -333610060, now seen corresponding path program 2 times [2024-05-12 11:45:02,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113617405] [2024-05-12 11:45:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113617405] [2024-05-12 11:45:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113617405] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:45:08,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129841285] [2024-05-12 11:45:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:08,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:45:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:08,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:45:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:45:08,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-05-12 11:45:08,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 430 transitions, 7142 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:08,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:08,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-05-12 11:45:08,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:10,838 INFO L124 PetriNetUnfolderBase]: 4368/8630 cut-off events. [2024-05-12 11:45:10,838 INFO L125 PetriNetUnfolderBase]: For 157475/157542 co-relation queries the response was YES. [2024-05-12 11:45:10,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49596 conditions, 8630 events. 4368/8630 cut-off events. For 157475/157542 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 77400 event pairs, 1734 based on Foata normal form. 24/8502 useless extension candidates. Maximal degree in co-relation 49421. Up to 7121 conditions per place. [2024-05-12 11:45:10,956 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 367 selfloop transitions, 94 changer transitions 0/473 dead transitions. [2024-05-12 11:45:10,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 473 transitions, 8289 flow [2024-05-12 11:45:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:45:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:45:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 11:45:10,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054054054054054 [2024-05-12 11:45:10,957 INFO L175 Difference]: Start difference. First operand has 398 places, 430 transitions, 7142 flow. Second operand 10 states and 187 transitions. [2024-05-12 11:45:10,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 473 transitions, 8289 flow [2024-05-12 11:45:12,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 473 transitions, 8221 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 11:45:12,325 INFO L231 Difference]: Finished difference. Result has 403 places, 430 transitions, 7265 flow [2024-05-12 11:45:12,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7074, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7265, PETRI_PLACES=403, PETRI_TRANSITIONS=430} [2024-05-12 11:45:12,325 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 362 predicate places. [2024-05-12 11:45:12,325 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 430 transitions, 7265 flow [2024-05-12 11:45:12,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:12,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:12,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:12,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-05-12 11:45:12,326 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:12,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 725759074, now seen corresponding path program 3 times [2024-05-12 11:45:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701155709] [2024-05-12 11:45:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:18,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701155709] [2024-05-12 11:45:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701155709] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:18,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 11:45:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123240480] [2024-05-12 11:45:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:45:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:45:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:45:19,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:45:19,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 430 transitions, 7265 flow. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:19,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:19,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:45:19,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:22,518 INFO L124 PetriNetUnfolderBase]: 4728/9185 cut-off events. [2024-05-12 11:45:22,518 INFO L125 PetriNetUnfolderBase]: For 164884/164944 co-relation queries the response was YES. [2024-05-12 11:45:22,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52963 conditions, 9185 events. 4728/9185 cut-off events. For 164884/164944 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 80329 event pairs, 1812 based on Foata normal form. 17/9082 useless extension candidates. Maximal degree in co-relation 52788. Up to 7599 conditions per place. [2024-05-12 11:45:22,649 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 380 selfloop transitions, 94 changer transitions 12/496 dead transitions. [2024-05-12 11:45:22,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 496 transitions, 8583 flow [2024-05-12 11:45:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:45:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:45:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2024-05-12 11:45:22,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781704781704782 [2024-05-12 11:45:22,650 INFO L175 Difference]: Start difference. First operand has 403 places, 430 transitions, 7265 flow. Second operand 13 states and 230 transitions. [2024-05-12 11:45:22,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 496 transitions, 8583 flow [2024-05-12 11:45:24,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 496 transitions, 8390 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 11:45:24,093 INFO L231 Difference]: Finished difference. Result has 408 places, 430 transitions, 7263 flow [2024-05-12 11:45:24,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7072, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7263, PETRI_PLACES=408, PETRI_TRANSITIONS=430} [2024-05-12 11:45:24,094 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 367 predicate places. [2024-05-12 11:45:24,094 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 430 transitions, 7263 flow [2024-05-12 11:45:24,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:24,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:24,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-05-12 11:45:24,094 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:24,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 726018544, now seen corresponding path program 4 times [2024-05-12 11:45:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456237587] [2024-05-12 11:45:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:30,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:30,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456237587] [2024-05-12 11:45:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456237587] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 11:45:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479746583] [2024-05-12 11:45:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:30,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:45:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:30,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:45:30,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:45:30,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:45:30,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 430 transitions, 7263 flow. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:30,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:30,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:45:30,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:34,035 INFO L124 PetriNetUnfolderBase]: 4764/9251 cut-off events. [2024-05-12 11:45:34,035 INFO L125 PetriNetUnfolderBase]: For 167219/167292 co-relation queries the response was YES. [2024-05-12 11:45:34,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53228 conditions, 9251 events. 4764/9251 cut-off events. For 167219/167292 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 81023 event pairs, 1795 based on Foata normal form. 30/9160 useless extension candidates. Maximal degree in co-relation 53052. Up to 7566 conditions per place. [2024-05-12 11:45:34,168 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 378 selfloop transitions, 100 changer transitions 8/496 dead transitions. [2024-05-12 11:45:34,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 496 transitions, 8579 flow [2024-05-12 11:45:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:45:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:45:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2024-05-12 11:45:34,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781704781704782 [2024-05-12 11:45:34,171 INFO L175 Difference]: Start difference. First operand has 408 places, 430 transitions, 7263 flow. Second operand 13 states and 230 transitions. [2024-05-12 11:45:34,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 496 transitions, 8579 flow [2024-05-12 11:45:35,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 496 transitions, 8392 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-05-12 11:45:35,605 INFO L231 Difference]: Finished difference. Result has 410 places, 430 transitions, 7279 flow [2024-05-12 11:45:35,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7076, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7279, PETRI_PLACES=410, PETRI_TRANSITIONS=430} [2024-05-12 11:45:35,606 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 369 predicate places. [2024-05-12 11:45:35,606 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 430 transitions, 7279 flow [2024-05-12 11:45:35,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:35,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:35,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:35,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-05-12 11:45:35,606 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:35,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:35,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2013826002, now seen corresponding path program 5 times [2024-05-12 11:45:35,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:35,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937529000] [2024-05-12 11:45:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:42,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-05-12 11:45:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:42,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937529000] [2024-05-12 11:45:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937529000] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 11:45:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645859549] [2024-05-12 11:45:42,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:42,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:45:42,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:42,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:45:42,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:45:42,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:45:42,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 430 transitions, 7279 flow. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:42,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:42,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:45:42,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:46,126 INFO L124 PetriNetUnfolderBase]: 4803/9196 cut-off events. [2024-05-12 11:45:46,126 INFO L125 PetriNetUnfolderBase]: For 170232/170392 co-relation queries the response was YES. [2024-05-12 11:45:46,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53384 conditions, 9196 events. 4803/9196 cut-off events. For 170232/170392 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 79200 event pairs, 2127 based on Foata normal form. 36/9101 useless extension candidates. Maximal degree in co-relation 53207. Up to 7827 conditions per place. [2024-05-12 11:45:46,271 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 435 selfloop transitions, 46 changer transitions 4/495 dead transitions. [2024-05-12 11:45:46,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 495 transitions, 8615 flow [2024-05-12 11:45:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:45:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:45:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 227 transitions. [2024-05-12 11:45:46,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47193347193347196 [2024-05-12 11:45:46,272 INFO L175 Difference]: Start difference. First operand has 410 places, 430 transitions, 7279 flow. Second operand 13 states and 227 transitions. [2024-05-12 11:45:46,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 495 transitions, 8615 flow [2024-05-12 11:45:48,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 495 transitions, 8416 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-05-12 11:45:48,064 INFO L231 Difference]: Finished difference. Result has 412 places, 430 transitions, 7175 flow [2024-05-12 11:45:48,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7080, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7175, PETRI_PLACES=412, PETRI_TRANSITIONS=430} [2024-05-12 11:45:48,064 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 371 predicate places. [2024-05-12 11:45:48,064 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 430 transitions, 7175 flow [2024-05-12 11:45:48,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:48,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:48,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:48,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-05-12 11:45:48,065 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:48,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1651717572, now seen corresponding path program 6 times [2024-05-12 11:45:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447762452] [2024-05-12 11:45:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:45:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:45:53,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:45:53,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447762452] [2024-05-12 11:45:53,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447762452] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:45:53,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:45:53,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 11:45:53,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693921910] [2024-05-12 11:45:53,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:45:53,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:45:53,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:45:53,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:45:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:45:54,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:45:54,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 430 transitions, 7175 flow. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:54,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:45:54,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:45:54,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:45:57,301 INFO L124 PetriNetUnfolderBase]: 4816/9213 cut-off events. [2024-05-12 11:45:57,301 INFO L125 PetriNetUnfolderBase]: For 144559/144720 co-relation queries the response was YES. [2024-05-12 11:45:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52683 conditions, 9213 events. 4816/9213 cut-off events. For 144559/144720 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 79439 event pairs, 2226 based on Foata normal form. 36/9115 useless extension candidates. Maximal degree in co-relation 52505. Up to 8310 conditions per place. [2024-05-12 11:45:57,440 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 434 selfloop transitions, 33 changer transitions 1/478 dead transitions. [2024-05-12 11:45:57,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 478 transitions, 8345 flow [2024-05-12 11:45:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:45:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:45:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-05-12 11:45:57,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457002457002457 [2024-05-12 11:45:57,442 INFO L175 Difference]: Start difference. First operand has 412 places, 430 transitions, 7175 flow. Second operand 11 states and 186 transitions. [2024-05-12 11:45:57,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 478 transitions, 8345 flow [2024-05-12 11:45:58,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 478 transitions, 8253 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-05-12 11:45:58,954 INFO L231 Difference]: Finished difference. Result has 412 places, 430 transitions, 7152 flow [2024-05-12 11:45:58,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7083, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7152, PETRI_PLACES=412, PETRI_TRANSITIONS=430} [2024-05-12 11:45:58,954 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 371 predicate places. [2024-05-12 11:45:58,954 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 430 transitions, 7152 flow [2024-05-12 11:45:58,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:45:58,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:45:58,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:45:58,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-05-12 11:45:58,955 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:45:58,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:45:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2021480580, now seen corresponding path program 7 times [2024-05-12 11:45:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:45:58,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172507940] [2024-05-12 11:45:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:45:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:45:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172507940] [2024-05-12 11:46:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172507940] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:04,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:04,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 11:46:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920479949] [2024-05-12 11:46:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:04,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:46:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:46:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:46:04,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:46:04,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 430 transitions, 7152 flow. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:04,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:04,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:46:04,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:07,871 INFO L124 PetriNetUnfolderBase]: 4846/9256 cut-off events. [2024-05-12 11:46:07,871 INFO L125 PetriNetUnfolderBase]: For 144246/144416 co-relation queries the response was YES. [2024-05-12 11:46:07,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52830 conditions, 9256 events. 4846/9256 cut-off events. For 144246/144416 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 79852 event pairs, 2218 based on Foata normal form. 37/9157 useless extension candidates. Maximal degree in co-relation 52652. Up to 8373 conditions per place. [2024-05-12 11:46:08,015 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 424 selfloop transitions, 29 changer transitions 11/474 dead transitions. [2024-05-12 11:46:08,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 474 transitions, 8282 flow [2024-05-12 11:46:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:46:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:46:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions. [2024-05-12 11:46:08,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44144144144144143 [2024-05-12 11:46:08,016 INFO L175 Difference]: Start difference. First operand has 412 places, 430 transitions, 7152 flow. Second operand 12 states and 196 transitions. [2024-05-12 11:46:08,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 474 transitions, 8282 flow [2024-05-12 11:46:09,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 474 transitions, 8217 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 11:46:09,602 INFO L231 Difference]: Finished difference. Result has 416 places, 431 transitions, 7157 flow [2024-05-12 11:46:09,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7087, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7157, PETRI_PLACES=416, PETRI_TRANSITIONS=431} [2024-05-12 11:46:09,602 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 375 predicate places. [2024-05-12 11:46:09,602 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 431 transitions, 7157 flow [2024-05-12 11:46:09,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:09,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:09,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:09,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-05-12 11:46:09,603 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:09,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2021740050, now seen corresponding path program 8 times [2024-05-12 11:46:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666611628] [2024-05-12 11:46:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:15,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:15,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666611628] [2024-05-12 11:46:15,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666611628] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:15,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:15,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 11:46:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116158131] [2024-05-12 11:46:15,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:15,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:46:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:46:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:46:16,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:46:16,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 431 transitions, 7157 flow. Second operand has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:16,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:16,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:46:16,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:19,373 INFO L124 PetriNetUnfolderBase]: 4894/9362 cut-off events. [2024-05-12 11:46:19,373 INFO L125 PetriNetUnfolderBase]: For 145770/145952 co-relation queries the response was YES. [2024-05-12 11:46:19,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53315 conditions, 9362 events. 4894/9362 cut-off events. For 145770/145952 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 81008 event pairs, 2235 based on Foata normal form. 46/9271 useless extension candidates. Maximal degree in co-relation 53135. Up to 8414 conditions per place. [2024-05-12 11:46:19,514 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 431 selfloop transitions, 27 changer transitions 8/476 dead transitions. [2024-05-12 11:46:19,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 476 transitions, 8299 flow [2024-05-12 11:46:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:46:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:46:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 197 transitions. [2024-05-12 11:46:19,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436936936936937 [2024-05-12 11:46:19,515 INFO L175 Difference]: Start difference. First operand has 416 places, 431 transitions, 7157 flow. Second operand 12 states and 197 transitions. [2024-05-12 11:46:19,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 476 transitions, 8299 flow [2024-05-12 11:46:21,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 476 transitions, 8245 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-05-12 11:46:21,171 INFO L231 Difference]: Finished difference. Result has 421 places, 433 transitions, 7186 flow [2024-05-12 11:46:21,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7103, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7186, PETRI_PLACES=421, PETRI_TRANSITIONS=433} [2024-05-12 11:46:21,171 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 380 predicate places. [2024-05-12 11:46:21,171 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 433 transitions, 7186 flow [2024-05-12 11:46:21,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.307692307692308) internal successors, (134), 13 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:21,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:21,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:21,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-05-12 11:46:21,171 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:21,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:21,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1545700656, now seen corresponding path program 9 times [2024-05-12 11:46:21,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:21,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349216748] [2024-05-12 11:46:21,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:26,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349216748] [2024-05-12 11:46:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349216748] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 11:46:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917186190] [2024-05-12 11:46:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:26,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 11:46:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 11:46:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-05-12 11:46:27,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-05-12 11:46:27,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 433 transitions, 7186 flow. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:27,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:27,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-05-12 11:46:27,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:30,278 INFO L124 PetriNetUnfolderBase]: 4922/9411 cut-off events. [2024-05-12 11:46:30,279 INFO L125 PetriNetUnfolderBase]: For 121573/121757 co-relation queries the response was YES. [2024-05-12 11:46:30,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53538 conditions, 9411 events. 4922/9411 cut-off events. For 121573/121757 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 81482 event pairs, 2277 based on Foata normal form. 37/9303 useless extension candidates. Maximal degree in co-relation 53355. Up to 8602 conditions per place. [2024-05-12 11:46:30,423 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 438 selfloop transitions, 25 changer transitions 6/479 dead transitions. [2024-05-12 11:46:30,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 479 transitions, 8374 flow [2024-05-12 11:46:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:46:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:46:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2024-05-12 11:46:30,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346846846846847 [2024-05-12 11:46:30,424 INFO L175 Difference]: Start difference. First operand has 421 places, 433 transitions, 7186 flow. Second operand 12 states and 193 transitions. [2024-05-12 11:46:30,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 479 transitions, 8374 flow [2024-05-12 11:46:31,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 479 transitions, 8329 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 11:46:31,776 INFO L231 Difference]: Finished difference. Result has 428 places, 439 transitions, 7316 flow [2024-05-12 11:46:31,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7141, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7316, PETRI_PLACES=428, PETRI_TRANSITIONS=439} [2024-05-12 11:46:31,777 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 387 predicate places. [2024-05-12 11:46:31,777 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 439 transitions, 7316 flow [2024-05-12 11:46:31,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:31,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:31,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:31,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-05-12 11:46:31,777 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:31,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1002140191, now seen corresponding path program 1 times [2024-05-12 11:46:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672045849] [2024-05-12 11:46:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:46:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:46:31,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:46:31,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672045849] [2024-05-12 11:46:31,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672045849] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:46:31,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:46:31,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:46:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583614094] [2024-05-12 11:46:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:46:31,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:46:31,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:46:31,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:46:31,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:46:31,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-05-12 11:46:31,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 439 transitions, 7316 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:31,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:46:31,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-05-12 11:46:31,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:46:33,821 INFO L124 PetriNetUnfolderBase]: 3520/8105 cut-off events. [2024-05-12 11:46:33,821 INFO L125 PetriNetUnfolderBase]: For 98978/99097 co-relation queries the response was YES. [2024-05-12 11:46:33,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40116 conditions, 8105 events. 3520/8105 cut-off events. For 98978/99097 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 77658 event pairs, 610 based on Foata normal form. 549/8537 useless extension candidates. Maximal degree in co-relation 39929. Up to 3746 conditions per place. [2024-05-12 11:46:33,946 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 158 selfloop transitions, 62 changer transitions 16/281 dead transitions. [2024-05-12 11:46:33,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 281 transitions, 5271 flow [2024-05-12 11:46:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:46:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:46:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-05-12 11:46:33,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6554054054054054 [2024-05-12 11:46:33,947 INFO L175 Difference]: Start difference. First operand has 428 places, 439 transitions, 7316 flow. Second operand 4 states and 97 transitions. [2024-05-12 11:46:33,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 281 transitions, 5271 flow [2024-05-12 11:46:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 281 transitions, 3500 flow, removed 73 selfloop flow, removed 131 redundant places. [2024-05-12 11:46:34,831 INFO L231 Difference]: Finished difference. Result has 298 places, 223 transitions, 2644 flow [2024-05-12 11:46:34,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2644, PETRI_PLACES=298, PETRI_TRANSITIONS=223} [2024-05-12 11:46:34,831 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places. [2024-05-12 11:46:34,831 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 223 transitions, 2644 flow [2024-05-12 11:46:34,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:46:34,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:46:34,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:46:34,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-05-12 11:46:34,832 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 11:46:34,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:46:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1168162495, now seen corresponding path program 1 times [2024-05-12 11:46:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:46:34,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239183936] [2024-05-12 11:46:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:46:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:46:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15