./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe007_rmo.oepc_rmo.opt-thin001_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:13:27,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:13:27,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:13:27,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:13:27,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:13:27,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:13:27,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:13:27,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:13:27,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:13:27,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:13:27,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:13:27,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:13:27,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:13:27,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:13:27,323 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:13:27,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:13:27,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:13:27,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:13:27,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:13:27,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:13:27,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:13:27,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:13:27,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:13:27,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:13:27,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:13:27,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:13:27,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:13:27,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:13:27,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:13:27,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:13:27,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:13:27,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:13:27,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:13:27,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:13:27,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:13:27,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:13:27,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:13:27,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:13:27,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:13:27,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:13:27,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:13:27,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:13:27,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:13:27,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 00:13:27,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:13:27,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:13:27,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:13:27,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:13:27,557 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:13:27,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-06-28 00:13:28,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:13:28,703 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:13:28,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-06-28 00:13:28,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b4f4a9b/351e6ae320844e578b611a9ec34a28b5/FLAGae6400af5 [2024-06-28 00:13:28,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b4f4a9b/351e6ae320844e578b611a9ec34a28b5 [2024-06-28 00:13:28,756 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:13:28,757 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:13:28,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 00:13:28,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:13:28,838 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:13:28,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:13:28,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:13:28,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:13:28,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:13:28" (1/2) ... [2024-06-28 00:13:28,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3579a836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:13:28, skipping insertion in model container [2024-06-28 00:13:28,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:13:28" (1/2) ... [2024-06-28 00:13:28,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@674e1478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:13:28, skipping insertion in model container [2024-06-28 00:13:28,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:13:28" (2/2) ... [2024-06-28 00:13:28,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3579a836 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:28, skipping insertion in model container [2024-06-28 00:13:28,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:13:28" (2/2) ... [2024-06-28 00:13:28,847 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:13:28,868 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:13:28,870 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )y) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) [2024-06-28 00:13:28,870 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )y) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) [2024-06-28 00:13:28,870 INFO L97 edCorrectnessWitness]: Location invariant before [L842-L842] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) + (long long )z$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )y) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )z$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )z$flush_delayed) - (long long )z$mem_tmp >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$mem_tmp) - (long long )z$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) [2024-06-28 00:13:28,871 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:13:28,871 INFO L106 edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1; [2024-06-28 00:13:28,907 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:13:29,181 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:13:29,197 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:13:29,370 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:13:29,413 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:13:29,413 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29 WrapperNode [2024-06-28 00:13:29,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:13:29,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:13:29,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:13:29,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:13:29,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,493 INFO L138 Inliner]: procedures = 175, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2024-06-28 00:13:29,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:13:29,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:13:29,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:13:29,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:13:29,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,530 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-28 00:13:29,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:13:29,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:13:29,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:13:29,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:13:29,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (1/1) ... [2024-06-28 00:13:29,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:13:29,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:13:29,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 00:13:29,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 00:13:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 00:13:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 00:13:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 00:13:29,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 00:13:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:13:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:13:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:13:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:13:29,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:13:29,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:13:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 00:13:29,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 00:13:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:13:29,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 00:13:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:13:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:13:29,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:13:29,634 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:13:29,745 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:13:29,747 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:13:30,356 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:13:30,357 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:13:30,655 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:13:30,655 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:13:30,656 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:13:30 BoogieIcfgContainer [2024-06-28 00:13:30,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:13:30,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:13:30,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:13:30,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:13:30,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:13:28" (1/4) ... [2024-06-28 00:13:30,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af0f00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:13:30, skipping insertion in model container [2024-06-28 00:13:30,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:13:28" (2/4) ... [2024-06-28 00:13:30,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af0f00c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:13:30, skipping insertion in model container [2024-06-28 00:13:30,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:13:29" (3/4) ... [2024-06-28 00:13:30,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af0f00c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:13:30, skipping insertion in model container [2024-06-28 00:13:30,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:13:30" (4/4) ... [2024-06-28 00:13:30,666 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2024-06-28 00:13:30,679 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:13:30,679 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 00:13:30,680 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:13:30,748 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:13:30,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-28 00:13:30,830 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-28 00:13:30,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:13:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:13:30,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-28 00:13:30,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-28 00:13:30,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:13:30,855 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;@718dd3e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:13:30,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-28 00:13:30,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:13:30,861 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 00:13:30,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:13:30,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:30,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:13:30,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:30,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 537184003, now seen corresponding path program 1 times [2024-06-28 00:13:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:30,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576041236] [2024-06-28 00:13:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:30,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:33,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:33,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576041236] [2024-06-28 00:13:33,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576041236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:33,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:13:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232284420] [2024-06-28 00:13:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:33,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:13:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:13:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:13:33,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-28 00:13:33,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:33,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:33,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-28 00:13:33,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:33,838 INFO L124 PetriNetUnfolderBase]: 775/1248 cut-off events. [2024-06-28 00:13:33,838 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-06-28 00:13:33,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 1248 events. 775/1248 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6012 event pairs, 500 based on Foata normal form. 1/1215 useless extension candidates. Maximal degree in co-relation 2491. Up to 1188 conditions per place. [2024-06-28 00:13:33,850 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-28 00:13:33,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 179 flow [2024-06-28 00:13:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:13:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:13:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-28 00:13:33,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2024-06-28 00:13:33,861 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 73 transitions. [2024-06-28 00:13:33,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 179 flow [2024-06-28 00:13:33,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:13:33,865 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-28 00:13:33,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-28 00:13:33,869 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-28 00:13:33,870 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-28 00:13:33,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:33,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:33,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:33,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:13:33,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:33,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash 837775426, now seen corresponding path program 1 times [2024-06-28 00:13:33,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:33,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289884110] [2024-06-28 00:13:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289884110] [2024-06-28 00:13:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289884110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:13:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208526979] [2024-06-28 00:13:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:37,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:13:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:13:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:13:37,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-28 00:13:37,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:37,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:37,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-28 00:13:37,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:37,678 INFO L124 PetriNetUnfolderBase]: 769/1235 cut-off events. [2024-06-28 00:13:37,678 INFO L125 PetriNetUnfolderBase]: For 238/245 co-relation queries the response was YES. [2024-06-28 00:13:37,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 1235 events. 769/1235 cut-off events. For 238/245 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5816 event pairs, 410 based on Foata normal form. 7/1238 useless extension candidates. Maximal degree in co-relation 2842. Up to 1160 conditions per place. [2024-06-28 00:13:37,685 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 42 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2024-06-28 00:13:37,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 254 flow [2024-06-28 00:13:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:13:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:13:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-06-28 00:13:37,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-28 00:13:37,690 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 96 transitions. [2024-06-28 00:13:37,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 254 flow [2024-06-28 00:13:37,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:13:37,694 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-28 00:13:37,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-28 00:13:37,696 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-28 00:13:37,696 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-28 00:13:37,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:37,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:37,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:37,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:13:37,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:37,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 201235243, now seen corresponding path program 1 times [2024-06-28 00:13:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963068009] [2024-06-28 00:13:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:40,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:40,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963068009] [2024-06-28 00:13:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963068009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:40,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:13:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413301489] [2024-06-28 00:13:40,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:13:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:40,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:13:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:13:40,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 00:13:40,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:40,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:40,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 00:13:40,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:41,443 INFO L124 PetriNetUnfolderBase]: 968/1529 cut-off events. [2024-06-28 00:13:41,443 INFO L125 PetriNetUnfolderBase]: For 808/816 co-relation queries the response was YES. [2024-06-28 00:13:41,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3937 conditions, 1529 events. 968/1529 cut-off events. For 808/816 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7188 event pairs, 400 based on Foata normal form. 9/1535 useless extension candidates. Maximal degree in co-relation 3923. Up to 1433 conditions per place. [2024-06-28 00:13:41,450 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 58 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2024-06-28 00:13:41,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 379 flow [2024-06-28 00:13:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:13:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:13:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-28 00:13:41,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-28 00:13:41,452 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 115 transitions. [2024-06-28 00:13:41,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 379 flow [2024-06-28 00:13:41,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 358 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-28 00:13:41,461 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 208 flow [2024-06-28 00:13:41,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-06-28 00:13:41,462 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-28 00:13:41,462 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 208 flow [2024-06-28 00:13:41,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:41,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:41,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:41,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:13:41,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:41,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash -747685872, now seen corresponding path program 1 times [2024-06-28 00:13:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:41,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844509151] [2024-06-28 00:13:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844509151] [2024-06-28 00:13:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844509151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:44,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:44,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:13:44,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585874081] [2024-06-28 00:13:44,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:44,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:13:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:44,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:13:44,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:13:44,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-28 00:13:44,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:44,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:44,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-28 00:13:44,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:45,147 INFO L124 PetriNetUnfolderBase]: 959/1514 cut-off events. [2024-06-28 00:13:45,148 INFO L125 PetriNetUnfolderBase]: For 1374/1394 co-relation queries the response was YES. [2024-06-28 00:13:45,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4330 conditions, 1514 events. 959/1514 cut-off events. For 1374/1394 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7051 event pairs, 275 based on Foata normal form. 18/1529 useless extension candidates. Maximal degree in co-relation 4313. Up to 1380 conditions per place. [2024-06-28 00:13:45,156 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 63 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2024-06-28 00:13:45,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 442 flow [2024-06-28 00:13:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:13:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:13:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-28 00:13:45,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 00:13:45,160 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 208 flow. Second operand 6 states and 132 transitions. [2024-06-28 00:13:45,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 442 flow [2024-06-28 00:13:45,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 438 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 00:13:45,166 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 243 flow [2024-06-28 00:13:45,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-28 00:13:45,167 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-28 00:13:45,167 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 243 flow [2024-06-28 00:13:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:45,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:45,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:45,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:13:45,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:45,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 74682117, now seen corresponding path program 1 times [2024-06-28 00:13:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972747231] [2024-06-28 00:13:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972747231] [2024-06-28 00:13:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972747231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:48,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:13:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989546694] [2024-06-28 00:13:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:48,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:13:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:13:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:13:48,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:13:48,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:48,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:48,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:13:48,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:49,330 INFO L124 PetriNetUnfolderBase]: 1099/1718 cut-off events. [2024-06-28 00:13:49,331 INFO L125 PetriNetUnfolderBase]: For 2527/2530 co-relation queries the response was YES. [2024-06-28 00:13:49,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 1718 events. 1099/1718 cut-off events. For 2527/2530 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8126 event pairs, 421 based on Foata normal form. 6/1717 useless extension candidates. Maximal degree in co-relation 5221. Up to 1585 conditions per place. [2024-06-28 00:13:49,340 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 61 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-28 00:13:49,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 517 flow [2024-06-28 00:13:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:13:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:13:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-28 00:13:49,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-28 00:13:49,344 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 243 flow. Second operand 5 states and 94 transitions. [2024-06-28 00:13:49,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 517 flow [2024-06-28 00:13:49,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 476 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 00:13:49,350 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 316 flow [2024-06-28 00:13:49,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2024-06-28 00:13:49,352 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-28 00:13:49,352 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 316 flow [2024-06-28 00:13:49,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:49,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:49,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:49,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:13:49,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:49,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2050688232, now seen corresponding path program 1 times [2024-06-28 00:13:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:49,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628384609] [2024-06-28 00:13:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628384609] [2024-06-28 00:13:54,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628384609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:54,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:54,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:13:54,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335556919] [2024-06-28 00:13:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:54,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:13:54,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:54,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:13:54,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:13:54,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 00:13:54,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:54,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:54,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 00:13:54,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:55,462 INFO L124 PetriNetUnfolderBase]: 1077/1706 cut-off events. [2024-06-28 00:13:55,462 INFO L125 PetriNetUnfolderBase]: For 3384/3476 co-relation queries the response was YES. [2024-06-28 00:13:55,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5709 conditions, 1706 events. 1077/1706 cut-off events. For 3384/3476 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8163 event pairs, 347 based on Foata normal form. 36/1731 useless extension candidates. Maximal degree in co-relation 5683. Up to 1546 conditions per place. [2024-06-28 00:13:55,473 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 81 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2024-06-28 00:13:55,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 733 flow [2024-06-28 00:13:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-28 00:13:55,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 00:13:55,476 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 316 flow. Second operand 9 states and 171 transitions. [2024-06-28 00:13:55,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 733 flow [2024-06-28 00:13:55,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 113 transitions, 731 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-28 00:13:55,482 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 469 flow [2024-06-28 00:13:55,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=469, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-06-28 00:13:55,484 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-28 00:13:55,484 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 469 flow [2024-06-28 00:13:55,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:55,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:55,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:55,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:13:55,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:55,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1422256148, now seen corresponding path program 2 times [2024-06-28 00:13:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:55,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864987274] [2024-06-28 00:13:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:55,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:00,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864987274] [2024-06-28 00:14:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864987274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:14:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451326648] [2024-06-28 00:14:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:00,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:14:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:14:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:14:00,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 00:14:00,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 469 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:00,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:00,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 00:14:00,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:01,703 INFO L124 PetriNetUnfolderBase]: 1134/1816 cut-off events. [2024-06-28 00:14:01,704 INFO L125 PetriNetUnfolderBase]: For 5502/5591 co-relation queries the response was YES. [2024-06-28 00:14:01,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6740 conditions, 1816 events. 1134/1816 cut-off events. For 5502/5591 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8904 event pairs, 358 based on Foata normal form. 24/1822 useless extension candidates. Maximal degree in co-relation 6709. Up to 1593 conditions per place. [2024-06-28 00:14:01,715 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 63 selfloop transitions, 40 changer transitions 0/111 dead transitions. [2024-06-28 00:14:01,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 913 flow [2024-06-28 00:14:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:14:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:14:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-28 00:14:01,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 00:14:01,718 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 469 flow. Second operand 6 states and 120 transitions. [2024-06-28 00:14:01,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 913 flow [2024-06-28 00:14:01,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 858 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-28 00:14:01,726 INFO L231 Difference]: Finished difference. Result has 72 places, 88 transitions, 725 flow [2024-06-28 00:14:01,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=72, PETRI_TRANSITIONS=88} [2024-06-28 00:14:01,727 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-28 00:14:01,727 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 88 transitions, 725 flow [2024-06-28 00:14:01,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:01,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:01,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:14:01,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:01,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2077591272, now seen corresponding path program 3 times [2024-06-28 00:14:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751074064] [2024-06-28 00:14:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:04,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751074064] [2024-06-28 00:14:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751074064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:04,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:04,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:14:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478989113] [2024-06-28 00:14:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:04,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:14:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:04,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:14:04,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:14:05,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 00:14:05,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 88 transitions, 725 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:05,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:05,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 00:14:05,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:05,947 INFO L124 PetriNetUnfolderBase]: 1172/1886 cut-off events. [2024-06-28 00:14:05,947 INFO L125 PetriNetUnfolderBase]: For 7872/7947 co-relation queries the response was YES. [2024-06-28 00:14:05,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7570 conditions, 1886 events. 1172/1886 cut-off events. For 7872/7947 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9332 event pairs, 367 based on Foata normal form. 30/1889 useless extension candidates. Maximal degree in co-relation 7535. Up to 1555 conditions per place. [2024-06-28 00:14:05,959 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 63 selfloop transitions, 47 changer transitions 0/118 dead transitions. [2024-06-28 00:14:05,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 118 transitions, 1070 flow [2024-06-28 00:14:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:14:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:14:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 00:14:05,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-06-28 00:14:05,962 INFO L175 Difference]: Start difference. First operand has 72 places, 88 transitions, 725 flow. Second operand 7 states and 128 transitions. [2024-06-28 00:14:05,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 118 transitions, 1070 flow [2024-06-28 00:14:05,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 118 transitions, 974 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-28 00:14:05,970 INFO L231 Difference]: Finished difference. Result has 77 places, 98 transitions, 848 flow [2024-06-28 00:14:05,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=77, PETRI_TRANSITIONS=98} [2024-06-28 00:14:05,971 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-06-28 00:14:05,971 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 98 transitions, 848 flow [2024-06-28 00:14:05,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:05,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:05,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:14:05,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:05,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1276151870, now seen corresponding path program 1 times [2024-06-28 00:14:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:05,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324562394] [2024-06-28 00:14:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324562394] [2024-06-28 00:14:09,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324562394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:09,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:09,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:14:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805899437] [2024-06-28 00:14:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:09,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:14:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:14:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:14:09,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:14:09,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 98 transitions, 848 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-06-28 00:14:09,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:09,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:14:09,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:10,546 INFO L124 PetriNetUnfolderBase]: 1253/1979 cut-off events. [2024-06-28 00:14:10,546 INFO L125 PetriNetUnfolderBase]: For 10720/10758 co-relation queries the response was YES. [2024-06-28 00:14:10,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8706 conditions, 1979 events. 1253/1979 cut-off events. For 10720/10758 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9608 event pairs, 385 based on Foata normal form. 34/2002 useless extension candidates. Maximal degree in co-relation 8668. Up to 1719 conditions per place. [2024-06-28 00:14:10,559 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 101 selfloop transitions, 19 changer transitions 0/125 dead transitions. [2024-06-28 00:14:10,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1193 flow [2024-06-28 00:14:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:14:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:14:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-28 00:14:10,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:14:10,561 INFO L175 Difference]: Start difference. First operand has 77 places, 98 transitions, 848 flow. Second operand 7 states and 119 transitions. [2024-06-28 00:14:10,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1193 flow [2024-06-28 00:14:10,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 125 transitions, 1168 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-28 00:14:10,574 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 884 flow [2024-06-28 00:14:10,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=884, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2024-06-28 00:14:10,575 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2024-06-28 00:14:10,575 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 884 flow [2024-06-28 00:14:10,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-06-28 00:14:10,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:10,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:10,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:14:10,576 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:10,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash -853172679, now seen corresponding path program 1 times [2024-06-28 00:14:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:10,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24490583] [2024-06-28 00:14:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24490583] [2024-06-28 00:14:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24490583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:15,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:15,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808079914] [2024-06-28 00:14:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:15,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:15,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:14:15,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 884 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:15,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:15,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:14:15,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:16,357 INFO L124 PetriNetUnfolderBase]: 1297/2055 cut-off events. [2024-06-28 00:14:16,357 INFO L125 PetriNetUnfolderBase]: For 11799/11805 co-relation queries the response was YES. [2024-06-28 00:14:16,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9320 conditions, 2055 events. 1297/2055 cut-off events. For 11799/11805 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9998 event pairs, 364 based on Foata normal form. 8/2060 useless extension candidates. Maximal degree in co-relation 9280. Up to 1762 conditions per place. [2024-06-28 00:14:16,369 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 137 selfloop transitions, 35 changer transitions 0/177 dead transitions. [2024-06-28 00:14:16,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 177 transitions, 1632 flow [2024-06-28 00:14:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:14:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:14:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-28 00:14:16,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430952380952381 [2024-06-28 00:14:16,374 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 884 flow. Second operand 10 states and 181 transitions. [2024-06-28 00:14:16,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 177 transitions, 1632 flow [2024-06-28 00:14:16,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 177 transitions, 1576 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 00:14:16,389 INFO L231 Difference]: Finished difference. Result has 93 places, 127 transitions, 1212 flow [2024-06-28 00:14:16,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1212, PETRI_PLACES=93, PETRI_TRANSITIONS=127} [2024-06-28 00:14:16,390 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-28 00:14:16,390 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 127 transitions, 1212 flow [2024-06-28 00:14:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:16,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:16,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:16,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:14:16,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:16,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1140266059, now seen corresponding path program 2 times [2024-06-28 00:14:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300226951] [2024-06-28 00:14:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:16,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300226951] [2024-06-28 00:14:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300226951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:21,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:21,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784888923] [2024-06-28 00:14:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:21,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:21,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:14:21,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 127 transitions, 1212 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:21,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:21,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:14:21,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:22,842 INFO L124 PetriNetUnfolderBase]: 1354/2162 cut-off events. [2024-06-28 00:14:22,843 INFO L125 PetriNetUnfolderBase]: For 14855/14885 co-relation queries the response was YES. [2024-06-28 00:14:22,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10467 conditions, 2162 events. 1354/2162 cut-off events. For 14855/14885 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10769 event pairs, 384 based on Foata normal form. 21/2174 useless extension candidates. Maximal degree in co-relation 10421. Up to 1827 conditions per place. [2024-06-28 00:14:22,858 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 129 selfloop transitions, 49 changer transitions 0/183 dead transitions. [2024-06-28 00:14:22,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 183 transitions, 1923 flow [2024-06-28 00:14:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:14:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:14:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 00:14:22,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:14:22,861 INFO L175 Difference]: Start difference. First operand has 93 places, 127 transitions, 1212 flow. Second operand 8 states and 144 transitions. [2024-06-28 00:14:22,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 183 transitions, 1923 flow [2024-06-28 00:14:22,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 183 transitions, 1889 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-06-28 00:14:22,881 INFO L231 Difference]: Finished difference. Result has 102 places, 153 transitions, 1575 flow [2024-06-28 00:14:22,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1575, PETRI_PLACES=102, PETRI_TRANSITIONS=153} [2024-06-28 00:14:22,882 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-06-28 00:14:22,882 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 153 transitions, 1575 flow [2024-06-28 00:14:22,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:22,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:22,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:22,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:14:22,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:22,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash -19172859, now seen corresponding path program 3 times [2024-06-28 00:14:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038876761] [2024-06-28 00:14:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:26,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038876761] [2024-06-28 00:14:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038876761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:26,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:26,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379603582] [2024-06-28 00:14:26,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:26,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:26,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:26,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:26,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:14:26,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 153 transitions, 1575 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:26,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:26,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:14:26,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:27,915 INFO L124 PetriNetUnfolderBase]: 1357/2173 cut-off events. [2024-06-28 00:14:27,916 INFO L125 PetriNetUnfolderBase]: For 18668/18743 co-relation queries the response was YES. [2024-06-28 00:14:27,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11255 conditions, 2173 events. 1357/2173 cut-off events. For 18668/18743 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10903 event pairs, 391 based on Foata normal form. 58/2220 useless extension candidates. Maximal degree in co-relation 11204. Up to 1786 conditions per place. [2024-06-28 00:14:27,930 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 124 selfloop transitions, 64 changer transitions 0/193 dead transitions. [2024-06-28 00:14:27,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 193 transitions, 2154 flow [2024-06-28 00:14:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:14:27,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2024-06-28 00:14:27,933 INFO L175 Difference]: Start difference. First operand has 102 places, 153 transitions, 1575 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:14:27,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 193 transitions, 2154 flow [2024-06-28 00:14:27,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 193 transitions, 2105 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-28 00:14:27,957 INFO L231 Difference]: Finished difference. Result has 110 places, 161 transitions, 1773 flow [2024-06-28 00:14:27,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1773, PETRI_PLACES=110, PETRI_TRANSITIONS=161} [2024-06-28 00:14:27,958 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-28 00:14:27,958 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 161 transitions, 1773 flow [2024-06-28 00:14:27,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:27,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:27,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:27,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:14:27,958 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:27,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash -19178439, now seen corresponding path program 4 times [2024-06-28 00:14:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736257305] [2024-06-28 00:14:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736257305] [2024-06-28 00:14:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736257305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:31,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:31,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885921886] [2024-06-28 00:14:31,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:31,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:31,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:31,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:31,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:14:31,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 161 transitions, 1773 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:31,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:31,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:14:31,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:32,667 INFO L124 PetriNetUnfolderBase]: 1352/2163 cut-off events. [2024-06-28 00:14:32,667 INFO L125 PetriNetUnfolderBase]: For 21380/21458 co-relation queries the response was YES. [2024-06-28 00:14:32,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11633 conditions, 2163 events. 1352/2163 cut-off events. For 21380/21458 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10822 event pairs, 411 based on Foata normal form. 48/2198 useless extension candidates. Maximal degree in co-relation 11579. Up to 1781 conditions per place. [2024-06-28 00:14:32,682 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 116 selfloop transitions, 60 changer transitions 0/181 dead transitions. [2024-06-28 00:14:32,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 181 transitions, 2175 flow [2024-06-28 00:14:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:14:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:14:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 00:14:32,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-28 00:14:32,684 INFO L175 Difference]: Start difference. First operand has 110 places, 161 transitions, 1773 flow. Second operand 7 states and 122 transitions. [2024-06-28 00:14:32,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 181 transitions, 2175 flow [2024-06-28 00:14:32,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 181 transitions, 2049 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-28 00:14:32,711 INFO L231 Difference]: Finished difference. Result has 112 places, 161 transitions, 1783 flow [2024-06-28 00:14:32,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1783, PETRI_PLACES=112, PETRI_TRANSITIONS=161} [2024-06-28 00:14:32,712 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places. [2024-06-28 00:14:32,712 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 161 transitions, 1783 flow [2024-06-28 00:14:32,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:32,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:32,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:32,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:14:32,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:32,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash -681409593, now seen corresponding path program 1 times [2024-06-28 00:14:32,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:32,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617887698] [2024-06-28 00:14:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:37,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:37,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617887698] [2024-06-28 00:14:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617887698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:37,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:37,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:37,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250769750] [2024-06-28 00:14:37,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:37,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:37,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:37,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:37,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:14:37,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 161 transitions, 1783 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:37,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:37,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:14:37,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:39,169 INFO L124 PetriNetUnfolderBase]: 1667/2645 cut-off events. [2024-06-28 00:14:39,170 INFO L125 PetriNetUnfolderBase]: For 28245/28259 co-relation queries the response was YES. [2024-06-28 00:14:39,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14205 conditions, 2645 events. 1667/2645 cut-off events. For 28245/28259 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13625 event pairs, 254 based on Foata normal form. 32/2674 useless extension candidates. Maximal degree in co-relation 14150. Up to 1870 conditions per place. [2024-06-28 00:14:39,188 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 182 selfloop transitions, 80 changer transitions 0/267 dead transitions. [2024-06-28 00:14:39,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 267 transitions, 2946 flow [2024-06-28 00:14:39,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:14:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:14:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions. [2024-06-28 00:14:39,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503968253968254 [2024-06-28 00:14:39,190 INFO L175 Difference]: Start difference. First operand has 112 places, 161 transitions, 1783 flow. Second operand 12 states and 227 transitions. [2024-06-28 00:14:39,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 267 transitions, 2946 flow [2024-06-28 00:14:39,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 267 transitions, 2806 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 00:14:39,227 INFO L231 Difference]: Finished difference. Result has 121 places, 194 transitions, 2248 flow [2024-06-28 00:14:39,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2248, PETRI_PLACES=121, PETRI_TRANSITIONS=194} [2024-06-28 00:14:39,227 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places. [2024-06-28 00:14:39,227 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 194 transitions, 2248 flow [2024-06-28 00:14:39,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:39,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:39,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:39,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:14:39,228 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:39,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1103803991, now seen corresponding path program 2 times [2024-06-28 00:14:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878999796] [2024-06-28 00:14:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878999796] [2024-06-28 00:14:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878999796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:44,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276658664] [2024-06-28 00:14:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:44,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:44,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 00:14:44,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 194 transitions, 2248 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-06-28 00:14:44,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:44,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 00:14:44,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:46,208 INFO L124 PetriNetUnfolderBase]: 1642/2631 cut-off events. [2024-06-28 00:14:46,208 INFO L125 PetriNetUnfolderBase]: For 34474/34485 co-relation queries the response was YES. [2024-06-28 00:14:46,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15494 conditions, 2631 events. 1642/2631 cut-off events. For 34474/34485 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13796 event pairs, 376 based on Foata normal form. 18/2611 useless extension candidates. Maximal degree in co-relation 15435. Up to 2172 conditions per place. [2024-06-28 00:14:46,232 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 131 selfloop transitions, 84 changer transitions 0/249 dead transitions. [2024-06-28 00:14:46,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 249 transitions, 2858 flow [2024-06-28 00:14:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:14:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:14:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2024-06-28 00:14:46,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-28 00:14:46,234 INFO L175 Difference]: Start difference. First operand has 121 places, 194 transitions, 2248 flow. Second operand 11 states and 203 transitions. [2024-06-28 00:14:46,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 249 transitions, 2858 flow [2024-06-28 00:14:46,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 249 transitions, 2754 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-28 00:14:46,281 INFO L231 Difference]: Finished difference. Result has 127 places, 197 transitions, 2371 flow [2024-06-28 00:14:46,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2371, PETRI_PLACES=127, PETRI_TRANSITIONS=197} [2024-06-28 00:14:46,282 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places. [2024-06-28 00:14:46,282 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 197 transitions, 2371 flow [2024-06-28 00:14:46,282 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-06-28 00:14:46,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:46,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:46,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:14:46,283 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:46,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash -988512821, now seen corresponding path program 3 times [2024-06-28 00:14:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:46,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269668997] [2024-06-28 00:14:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269668997] [2024-06-28 00:14:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269668997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857322841] [2024-06-28 00:14:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:52,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:52,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:52,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:52,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 00:14:52,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 197 transitions, 2371 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-06-28 00:14:52,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:52,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 00:14:52,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:53,457 INFO L124 PetriNetUnfolderBase]: 1702/2734 cut-off events. [2024-06-28 00:14:53,457 INFO L125 PetriNetUnfolderBase]: For 39147/39164 co-relation queries the response was YES. [2024-06-28 00:14:53,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16331 conditions, 2734 events. 1702/2734 cut-off events. For 39147/39164 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14509 event pairs, 388 based on Foata normal form. 23/2704 useless extension candidates. Maximal degree in co-relation 16271. Up to 2280 conditions per place. [2024-06-28 00:14:53,475 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 141 selfloop transitions, 60 changer transitions 0/235 dead transitions. [2024-06-28 00:14:53,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 235 transitions, 2942 flow [2024-06-28 00:14:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:14:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:14:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 00:14:53,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-28 00:14:53,478 INFO L175 Difference]: Start difference. First operand has 127 places, 197 transitions, 2371 flow. Second operand 8 states and 149 transitions. [2024-06-28 00:14:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 235 transitions, 2942 flow [2024-06-28 00:14:53,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 235 transitions, 2754 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-28 00:14:53,518 INFO L231 Difference]: Finished difference. Result has 126 places, 203 transitions, 2403 flow [2024-06-28 00:14:53,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2403, PETRI_PLACES=126, PETRI_TRANSITIONS=203} [2024-06-28 00:14:53,519 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2024-06-28 00:14:53,519 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 203 transitions, 2403 flow [2024-06-28 00:14:53,519 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-06-28 00:14:53,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:53,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:53,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:14:53,519 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:53,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -594534969, now seen corresponding path program 4 times [2024-06-28 00:14:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:53,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452894891] [2024-06-28 00:14:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452894891] [2024-06-28 00:14:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452894891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761563635] [2024-06-28 00:14:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:57,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:57,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:57,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 00:14:57,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 203 transitions, 2403 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-06-28 00:14:57,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:57,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 00:14:57,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:58,648 INFO L124 PetriNetUnfolderBase]: 1873/3000 cut-off events. [2024-06-28 00:14:58,649 INFO L125 PetriNetUnfolderBase]: For 50456/50497 co-relation queries the response was YES. [2024-06-28 00:14:58,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17716 conditions, 3000 events. 1873/3000 cut-off events. For 50456/50497 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16191 event pairs, 426 based on Foata normal form. 74/2998 useless extension candidates. Maximal degree in co-relation 17658. Up to 2174 conditions per place. [2024-06-28 00:14:58,670 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 124 selfloop transitions, 85 changer transitions 0/243 dead transitions. [2024-06-28 00:14:58,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 243 transitions, 3029 flow [2024-06-28 00:14:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:14:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:14:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-28 00:14:58,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-28 00:14:58,672 INFO L175 Difference]: Start difference. First operand has 126 places, 203 transitions, 2403 flow. Second operand 8 states and 151 transitions. [2024-06-28 00:14:58,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 243 transitions, 3029 flow [2024-06-28 00:14:58,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 243 transitions, 2854 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 00:14:58,726 INFO L231 Difference]: Finished difference. Result has 127 places, 209 transitions, 2515 flow [2024-06-28 00:14:58,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2515, PETRI_PLACES=127, PETRI_TRANSITIONS=209} [2024-06-28 00:14:58,727 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places. [2024-06-28 00:14:58,727 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 209 transitions, 2515 flow [2024-06-28 00:14:58,727 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-06-28 00:14:58,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:58,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:58,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:14:58,728 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:58,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 351140666, now seen corresponding path program 1 times [2024-06-28 00:14:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202815763] [2024-06-28 00:14:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:03,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:03,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202815763] [2024-06-28 00:15:03,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202815763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:03,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366494650] [2024-06-28 00:15:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:03,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:03,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:03,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:03,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 209 transitions, 2515 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:03,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:03,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:03,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:05,165 INFO L124 PetriNetUnfolderBase]: 2082/3336 cut-off events. [2024-06-28 00:15:05,165 INFO L125 PetriNetUnfolderBase]: For 47474/47488 co-relation queries the response was YES. [2024-06-28 00:15:05,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19600 conditions, 3336 events. 2082/3336 cut-off events. For 47474/47488 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 18285 event pairs, 379 based on Foata normal form. 26/3359 useless extension candidates. Maximal degree in co-relation 19542. Up to 2435 conditions per place. [2024-06-28 00:15:05,190 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 60 changer transitions 0/279 dead transitions. [2024-06-28 00:15:05,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 279 transitions, 3431 flow [2024-06-28 00:15:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:15:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:15:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2024-06-28 00:15:05,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2024-06-28 00:15:05,192 INFO L175 Difference]: Start difference. First operand has 127 places, 209 transitions, 2515 flow. Second operand 11 states and 202 transitions. [2024-06-28 00:15:05,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 279 transitions, 3431 flow [2024-06-28 00:15:05,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 279 transitions, 3283 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-28 00:15:05,262 INFO L231 Difference]: Finished difference. Result has 134 places, 215 transitions, 2610 flow [2024-06-28 00:15:05,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2373, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2610, PETRI_PLACES=134, PETRI_TRANSITIONS=215} [2024-06-28 00:15:05,263 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places. [2024-06-28 00:15:05,263 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 215 transitions, 2610 flow [2024-06-28 00:15:05,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:05,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:05,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:05,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:15:05,264 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:05,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash 141964086, now seen corresponding path program 2 times [2024-06-28 00:15:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:05,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537571328] [2024-06-28 00:15:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:10,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537571328] [2024-06-28 00:15:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537571328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:10,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:10,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471204005] [2024-06-28 00:15:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:10,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:10,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:10,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:10,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 215 transitions, 2610 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:10,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:10,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:10,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:12,163 INFO L124 PetriNetUnfolderBase]: 2150/3458 cut-off events. [2024-06-28 00:15:12,163 INFO L125 PetriNetUnfolderBase]: For 53043/53057 co-relation queries the response was YES. [2024-06-28 00:15:12,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20434 conditions, 3458 events. 2150/3458 cut-off events. For 53043/53057 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19303 event pairs, 522 based on Foata normal form. 30/3485 useless extension candidates. Maximal degree in co-relation 20373. Up to 2888 conditions per place. [2024-06-28 00:15:12,188 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 200 selfloop transitions, 71 changer transitions 0/276 dead transitions. [2024-06-28 00:15:12,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 276 transitions, 3343 flow [2024-06-28 00:15:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:15:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:15:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions. [2024-06-28 00:15:12,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2024-06-28 00:15:12,194 INFO L175 Difference]: Start difference. First operand has 134 places, 215 transitions, 2610 flow. Second operand 11 states and 206 transitions. [2024-06-28 00:15:12,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 276 transitions, 3343 flow [2024-06-28 00:15:12,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 276 transitions, 3265 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 00:15:12,273 INFO L231 Difference]: Finished difference. Result has 140 places, 216 transitions, 2698 flow [2024-06-28 00:15:12,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2534, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2698, PETRI_PLACES=140, PETRI_TRANSITIONS=216} [2024-06-28 00:15:12,274 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-28 00:15:12,274 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 216 transitions, 2698 flow [2024-06-28 00:15:12,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:12,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:12,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:12,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:15:12,274 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:12,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1090191768, now seen corresponding path program 3 times [2024-06-28 00:15:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599191298] [2024-06-28 00:15:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599191298] [2024-06-28 00:15:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599191298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:19,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:19,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843564679] [2024-06-28 00:15:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:19,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:19,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:19,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:19,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:19,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 216 transitions, 2698 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:19,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:19,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:19,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:20,806 INFO L124 PetriNetUnfolderBase]: 2198/3542 cut-off events. [2024-06-28 00:15:20,806 INFO L125 PetriNetUnfolderBase]: For 56171/56185 co-relation queries the response was YES. [2024-06-28 00:15:20,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21076 conditions, 3542 events. 2198/3542 cut-off events. For 56171/56185 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19928 event pairs, 514 based on Foata normal form. 26/3565 useless extension candidates. Maximal degree in co-relation 21014. Up to 2866 conditions per place. [2024-06-28 00:15:20,828 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 204 selfloop transitions, 73 changer transitions 0/282 dead transitions. [2024-06-28 00:15:20,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 282 transitions, 3476 flow [2024-06-28 00:15:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:15:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:15:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2024-06-28 00:15:20,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 00:15:20,830 INFO L175 Difference]: Start difference. First operand has 140 places, 216 transitions, 2698 flow. Second operand 11 states and 209 transitions. [2024-06-28 00:15:20,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 282 transitions, 3476 flow [2024-06-28 00:15:20,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 282 transitions, 3381 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-28 00:15:20,898 INFO L231 Difference]: Finished difference. Result has 146 places, 219 transitions, 2803 flow [2024-06-28 00:15:20,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2803, PETRI_PLACES=146, PETRI_TRANSITIONS=219} [2024-06-28 00:15:20,899 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places. [2024-06-28 00:15:20,899 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 219 transitions, 2803 flow [2024-06-28 00:15:20,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:20,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:20,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:20,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:15:20,900 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:20,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash 339864446, now seen corresponding path program 4 times [2024-06-28 00:15:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:20,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053762092] [2024-06-28 00:15:20,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:28,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053762092] [2024-06-28 00:15:28,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053762092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:28,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:28,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:28,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55055100] [2024-06-28 00:15:28,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:28,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:28,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:28,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:28,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:28,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 219 transitions, 2803 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:28,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:28,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:28,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:29,480 INFO L124 PetriNetUnfolderBase]: 2334/3778 cut-off events. [2024-06-28 00:15:29,481 INFO L125 PetriNetUnfolderBase]: For 66622/66651 co-relation queries the response was YES. [2024-06-28 00:15:29,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22383 conditions, 3778 events. 2334/3778 cut-off events. For 66622/66651 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21817 event pairs, 591 based on Foata normal form. 49/3818 useless extension candidates. Maximal degree in co-relation 22319. Up to 3185 conditions per place. [2024-06-28 00:15:29,510 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 200 selfloop transitions, 53 changer transitions 0/258 dead transitions. [2024-06-28 00:15:29,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 258 transitions, 3465 flow [2024-06-28 00:15:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 00:15:29,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2024-06-28 00:15:29,512 INFO L175 Difference]: Start difference. First operand has 146 places, 219 transitions, 2803 flow. Second operand 9 states and 160 transitions. [2024-06-28 00:15:29,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 258 transitions, 3465 flow [2024-06-28 00:15:29,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 258 transitions, 3317 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 00:15:29,651 INFO L231 Difference]: Finished difference. Result has 147 places, 221 transitions, 2808 flow [2024-06-28 00:15:29,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2808, PETRI_PLACES=147, PETRI_TRANSITIONS=221} [2024-06-28 00:15:29,652 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2024-06-28 00:15:29,652 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 221 transitions, 2808 flow [2024-06-28 00:15:29,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:29,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:29,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:29,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:15:29,652 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:29,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1245203036, now seen corresponding path program 5 times [2024-06-28 00:15:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:29,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823972107] [2024-06-28 00:15:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:29,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:34,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-06-28 00:15:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823972107] [2024-06-28 00:15:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823972107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:34,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:34,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24214558] [2024-06-28 00:15:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:34,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:34,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:34,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:34,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:34,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 221 transitions, 2808 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:34,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:34,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:34,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:35,585 INFO L124 PetriNetUnfolderBase]: 2470/4028 cut-off events. [2024-06-28 00:15:35,585 INFO L125 PetriNetUnfolderBase]: For 72873/72950 co-relation queries the response was YES. [2024-06-28 00:15:35,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23550 conditions, 4028 events. 2470/4028 cut-off events. For 72873/72950 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23835 event pairs, 628 based on Foata normal form. 85/4102 useless extension candidates. Maximal degree in co-relation 23484. Up to 3357 conditions per place. [2024-06-28 00:15:35,613 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 191 selfloop transitions, 66 changer transitions 0/262 dead transitions. [2024-06-28 00:15:35,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 262 transitions, 3473 flow [2024-06-28 00:15:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:15:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:15:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-28 00:15:35,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2024-06-28 00:15:35,615 INFO L175 Difference]: Start difference. First operand has 147 places, 221 transitions, 2808 flow. Second operand 10 states and 171 transitions. [2024-06-28 00:15:35,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 262 transitions, 3473 flow [2024-06-28 00:15:35,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 262 transitions, 3359 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-28 00:15:35,703 INFO L231 Difference]: Finished difference. Result has 150 places, 223 transitions, 2877 flow [2024-06-28 00:15:35,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2694, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2877, PETRI_PLACES=150, PETRI_TRANSITIONS=223} [2024-06-28 00:15:35,704 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places. [2024-06-28 00:15:35,704 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 223 transitions, 2877 flow [2024-06-28 00:15:35,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:35,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:35,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:35,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:15:35,704 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:35,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1250709566, now seen corresponding path program 6 times [2024-06-28 00:15:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665057138] [2024-06-28 00:15:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:40,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-06-28 00:15:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665057138] [2024-06-28 00:15:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665057138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:40,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:40,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414155030] [2024-06-28 00:15:40,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:40,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:40,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:40,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 223 transitions, 2877 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:40,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:40,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:40,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:41,536 INFO L124 PetriNetUnfolderBase]: 2510/4109 cut-off events. [2024-06-28 00:15:41,536 INFO L125 PetriNetUnfolderBase]: For 73175/73249 co-relation queries the response was YES. [2024-06-28 00:15:41,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23957 conditions, 4109 events. 2510/4109 cut-off events. For 73175/73249 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 24515 event pairs, 664 based on Foata normal form. 60/4156 useless extension candidates. Maximal degree in co-relation 23890. Up to 3329 conditions per place. [2024-06-28 00:15:41,562 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 185 selfloop transitions, 63 changer transitions 0/253 dead transitions. [2024-06-28 00:15:41,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 253 transitions, 3486 flow [2024-06-28 00:15:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:15:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:15:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 00:15:41,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-28 00:15:41,565 INFO L175 Difference]: Start difference. First operand has 150 places, 223 transitions, 2877 flow. Second operand 8 states and 140 transitions. [2024-06-28 00:15:41,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 253 transitions, 3486 flow [2024-06-28 00:15:41,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 253 transitions, 3344 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-28 00:15:41,648 INFO L231 Difference]: Finished difference. Result has 150 places, 224 transitions, 2897 flow [2024-06-28 00:15:41,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2735, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2897, PETRI_PLACES=150, PETRI_TRANSITIONS=224} [2024-06-28 00:15:41,648 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places. [2024-06-28 00:15:41,648 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 224 transitions, 2897 flow [2024-06-28 00:15:41,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:41,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:41,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:41,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:15:41,649 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:41,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1250713286, now seen corresponding path program 7 times [2024-06-28 00:15:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:41,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593712963] [2024-06-28 00:15:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:45,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:45,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593712963] [2024-06-28 00:15:45,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593712963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:45,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:45,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:45,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191459573] [2024-06-28 00:15:45,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:45,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:45,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:46,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:46,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 224 transitions, 2897 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:46,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:46,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:46,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:47,375 INFO L124 PetriNetUnfolderBase]: 2510/4117 cut-off events. [2024-06-28 00:15:47,375 INFO L125 PetriNetUnfolderBase]: For 74960/75034 co-relation queries the response was YES. [2024-06-28 00:15:47,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23685 conditions, 4117 events. 2510/4117 cut-off events. For 74960/75034 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24687 event pairs, 610 based on Foata normal form. 68/4172 useless extension candidates. Maximal degree in co-relation 23617. Up to 2795 conditions per place. [2024-06-28 00:15:47,408 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 188 selfloop transitions, 71 changer transitions 0/264 dead transitions. [2024-06-28 00:15:47,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 264 transitions, 3615 flow [2024-06-28 00:15:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:15:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:15:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 00:15:47,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-28 00:15:47,410 INFO L175 Difference]: Start difference. First operand has 150 places, 224 transitions, 2897 flow. Second operand 8 states and 145 transitions. [2024-06-28 00:15:47,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 264 transitions, 3615 flow [2024-06-28 00:15:47,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 264 transitions, 3482 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 00:15:47,522 INFO L231 Difference]: Finished difference. Result has 153 places, 230 transitions, 3044 flow [2024-06-28 00:15:47,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3044, PETRI_PLACES=153, PETRI_TRANSITIONS=230} [2024-06-28 00:15:47,523 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places. [2024-06-28 00:15:47,523 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 230 transitions, 3044 flow [2024-06-28 00:15:47,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:47,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:47,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:47,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:15:47,524 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:47,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1244987834, now seen corresponding path program 1 times [2024-06-28 00:15:47,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:47,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715944254] [2024-06-28 00:15:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715944254] [2024-06-28 00:15:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715944254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:51,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409560340] [2024-06-28 00:15:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:51,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:52,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:15:52,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 230 transitions, 3044 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:52,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:52,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:15:52,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:53,688 INFO L124 PetriNetUnfolderBase]: 2578/4248 cut-off events. [2024-06-28 00:15:53,688 INFO L125 PetriNetUnfolderBase]: For 78003/78080 co-relation queries the response was YES. [2024-06-28 00:15:53,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24609 conditions, 4248 events. 2578/4248 cut-off events. For 78003/78080 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 25716 event pairs, 586 based on Foata normal form. 65/4302 useless extension candidates. Maximal degree in co-relation 24539. Up to 3077 conditions per place. [2024-06-28 00:15:53,721 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 198 selfloop transitions, 73 changer transitions 0/276 dead transitions. [2024-06-28 00:15:53,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 276 transitions, 3762 flow [2024-06-28 00:15:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:15:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:15:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 00:15:53,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-28 00:15:53,723 INFO L175 Difference]: Start difference. First operand has 153 places, 230 transitions, 3044 flow. Second operand 10 states and 174 transitions. [2024-06-28 00:15:53,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 276 transitions, 3762 flow [2024-06-28 00:15:53,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 276 transitions, 3659 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-28 00:15:53,851 INFO L231 Difference]: Finished difference. Result has 160 places, 234 transitions, 3163 flow [2024-06-28 00:15:53,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2941, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3163, PETRI_PLACES=160, PETRI_TRANSITIONS=234} [2024-06-28 00:15:53,851 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-28 00:15:53,852 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 234 transitions, 3163 flow [2024-06-28 00:15:53,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:53,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:53,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:15:53,852 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:53,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash 953169828, now seen corresponding path program 2 times [2024-06-28 00:15:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:53,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021796489] [2024-06-28 00:15:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021796489] [2024-06-28 00:16:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021796489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681022306] [2024-06-28 00:16:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:01,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:01,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:01,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 234 transitions, 3163 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:01,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:01,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:01,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:03,998 INFO L124 PetriNetUnfolderBase]: 2558/4216 cut-off events. [2024-06-28 00:16:03,998 INFO L125 PetriNetUnfolderBase]: For 78445/78522 co-relation queries the response was YES. [2024-06-28 00:16:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24668 conditions, 4216 events. 2558/4216 cut-off events. For 78445/78522 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25431 event pairs, 596 based on Foata normal form. 65/4270 useless extension candidates. Maximal degree in co-relation 24595. Up to 2933 conditions per place. [2024-06-28 00:16:04,033 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 201 selfloop transitions, 75 changer transitions 0/281 dead transitions. [2024-06-28 00:16:04,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 281 transitions, 3817 flow [2024-06-28 00:16:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:16:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:16:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2024-06-28 00:16:04,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-28 00:16:04,035 INFO L175 Difference]: Start difference. First operand has 160 places, 234 transitions, 3163 flow. Second operand 11 states and 189 transitions. [2024-06-28 00:16:04,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 281 transitions, 3817 flow [2024-06-28 00:16:04,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 281 transitions, 3675 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 00:16:04,164 INFO L231 Difference]: Finished difference. Result has 163 places, 233 transitions, 3125 flow [2024-06-28 00:16:04,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2971, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3125, PETRI_PLACES=163, PETRI_TRANSITIONS=233} [2024-06-28 00:16:04,165 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2024-06-28 00:16:04,165 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 233 transitions, 3125 flow [2024-06-28 00:16:04,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:04,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:04,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:04,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:16:04,166 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:04,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1650001867, now seen corresponding path program 1 times [2024-06-28 00:16:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:04,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942772521] [2024-06-28 00:16:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942772521] [2024-06-28 00:16:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942772521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:08,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:08,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112745783] [2024-06-28 00:16:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:08,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:08,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:08,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:08,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:08,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 233 transitions, 3125 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-06-28 00:16:08,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:08,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:08,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:10,073 INFO L124 PetriNetUnfolderBase]: 2572/4241 cut-off events. [2024-06-28 00:16:10,073 INFO L125 PetriNetUnfolderBase]: For 77495/77512 co-relation queries the response was YES. [2024-06-28 00:16:10,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24868 conditions, 4241 events. 2572/4241 cut-off events. For 77495/77512 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 25696 event pairs, 608 based on Foata normal form. 20/4257 useless extension candidates. Maximal degree in co-relation 24794. Up to 3911 conditions per place. [2024-06-28 00:16:10,107 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 220 selfloop transitions, 43 changer transitions 0/268 dead transitions. [2024-06-28 00:16:10,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 268 transitions, 3813 flow [2024-06-28 00:16:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:16:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:16:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 00:16:10,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:16:10,108 INFO L175 Difference]: Start difference. First operand has 163 places, 233 transitions, 3125 flow. Second operand 9 states and 153 transitions. [2024-06-28 00:16:10,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 268 transitions, 3813 flow [2024-06-28 00:16:10,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 268 transitions, 3603 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-28 00:16:10,225 INFO L231 Difference]: Finished difference. Result has 164 places, 242 transitions, 3117 flow [2024-06-28 00:16:10,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2917, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3117, PETRI_PLACES=164, PETRI_TRANSITIONS=242} [2024-06-28 00:16:10,226 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-28 00:16:10,226 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 242 transitions, 3117 flow [2024-06-28 00:16:10,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-06-28 00:16:10,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:10,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:10,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:16:10,227 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:10,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2137721177, now seen corresponding path program 1 times [2024-06-28 00:16:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365951097] [2024-06-28 00:16:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365951097] [2024-06-28 00:16:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365951097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:14,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:16:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788240647] [2024-06-28 00:16:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:14,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:16:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:16:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:16:14,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:14,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 242 transitions, 3117 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:14,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:14,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:14,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:16,201 INFO L124 PetriNetUnfolderBase]: 2582/4260 cut-off events. [2024-06-28 00:16:16,201 INFO L125 PetriNetUnfolderBase]: For 79649/79694 co-relation queries the response was YES. [2024-06-28 00:16:16,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24826 conditions, 4260 events. 2582/4260 cut-off events. For 79649/79694 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25828 event pairs, 632 based on Foata normal form. 32/4285 useless extension candidates. Maximal degree in co-relation 24751. Up to 3856 conditions per place. [2024-06-28 00:16:16,233 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 211 selfloop transitions, 54 changer transitions 0/270 dead transitions. [2024-06-28 00:16:16,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 270 transitions, 3847 flow [2024-06-28 00:16:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:16:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:16:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-28 00:16:16,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-28 00:16:16,234 INFO L175 Difference]: Start difference. First operand has 164 places, 242 transitions, 3117 flow. Second operand 7 states and 125 transitions. [2024-06-28 00:16:16,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 270 transitions, 3847 flow [2024-06-28 00:16:16,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 270 transitions, 3730 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-28 00:16:16,357 INFO L231 Difference]: Finished difference. Result has 168 places, 248 transitions, 3201 flow [2024-06-28 00:16:16,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3000, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3201, PETRI_PLACES=168, PETRI_TRANSITIONS=248} [2024-06-28 00:16:16,357 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places. [2024-06-28 00:16:16,358 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 248 transitions, 3201 flow [2024-06-28 00:16:16,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:16,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:16,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:16,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:16:16,358 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:16,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1659635571, now seen corresponding path program 2 times [2024-06-28 00:16:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989723125] [2024-06-28 00:16:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989723125] [2024-06-28 00:16:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989723125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:20,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:20,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390690495] [2024-06-28 00:16:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:21,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:21,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 248 transitions, 3201 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-06-28 00:16:21,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:21,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:21,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:22,465 INFO L124 PetriNetUnfolderBase]: 2576/4250 cut-off events. [2024-06-28 00:16:22,466 INFO L125 PetriNetUnfolderBase]: For 85440/85511 co-relation queries the response was YES. [2024-06-28 00:16:22,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25050 conditions, 4250 events. 2576/4250 cut-off events. For 85440/85511 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 25784 event pairs, 651 based on Foata normal form. 44/4283 useless extension candidates. Maximal degree in co-relation 24973. Up to 3913 conditions per place. [2024-06-28 00:16:22,497 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 211 selfloop transitions, 43 changer transitions 0/259 dead transitions. [2024-06-28 00:16:22,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 259 transitions, 3743 flow [2024-06-28 00:16:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:16:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:16:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-28 00:16:22,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2024-06-28 00:16:22,498 INFO L175 Difference]: Start difference. First operand has 168 places, 248 transitions, 3201 flow. Second operand 7 states and 110 transitions. [2024-06-28 00:16:22,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 259 transitions, 3743 flow [2024-06-28 00:16:22,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 259 transitions, 3676 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-28 00:16:22,625 INFO L231 Difference]: Finished difference. Result has 173 places, 248 transitions, 3231 flow [2024-06-28 00:16:22,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3134, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3231, PETRI_PLACES=173, PETRI_TRANSITIONS=248} [2024-06-28 00:16:22,626 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-28 00:16:22,626 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 248 transitions, 3231 flow [2024-06-28 00:16:22,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-06-28 00:16:22,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:22,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:22,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:16:22,626 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:22,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1649986987, now seen corresponding path program 1 times [2024-06-28 00:16:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537620642] [2024-06-28 00:16:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:22,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537620642] [2024-06-28 00:16:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537620642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:27,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:27,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711934561] [2024-06-28 00:16:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:27,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:27,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:27,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:27,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:27,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 248 transitions, 3231 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:27,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:27,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:27,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:29,146 INFO L124 PetriNetUnfolderBase]: 2579/4245 cut-off events. [2024-06-28 00:16:29,146 INFO L125 PetriNetUnfolderBase]: For 88826/88829 co-relation queries the response was YES. [2024-06-28 00:16:29,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25214 conditions, 4245 events. 2579/4245 cut-off events. For 88826/88829 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 25613 event pairs, 722 based on Foata normal form. 6/4247 useless extension candidates. Maximal degree in co-relation 25134. Up to 3990 conditions per place. [2024-06-28 00:16:29,184 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 241 selfloop transitions, 20 changer transitions 0/266 dead transitions. [2024-06-28 00:16:29,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 266 transitions, 3852 flow [2024-06-28 00:16:29,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:16:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:16:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 00:16:29,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3601190476190476 [2024-06-28 00:16:29,186 INFO L175 Difference]: Start difference. First operand has 173 places, 248 transitions, 3231 flow. Second operand 8 states and 121 transitions. [2024-06-28 00:16:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 266 transitions, 3852 flow [2024-06-28 00:16:29,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 266 transitions, 3734 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 00:16:29,328 INFO L231 Difference]: Finished difference. Result has 176 places, 252 transitions, 3227 flow [2024-06-28 00:16:29,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3116, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3227, PETRI_PLACES=176, PETRI_TRANSITIONS=252} [2024-06-28 00:16:29,329 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 133 predicate places. [2024-06-28 00:16:29,329 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 252 transitions, 3227 flow [2024-06-28 00:16:29,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:29,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:29,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:29,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:16:29,330 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:29,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash 389550758, now seen corresponding path program 1 times [2024-06-28 00:16:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954522538] [2024-06-28 00:16:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:34,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:34,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954522538] [2024-06-28 00:16:34,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954522538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:34,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:34,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:34,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719527047] [2024-06-28 00:16:34,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:34,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:34,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:34,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:34,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 252 transitions, 3227 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:34,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:34,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:34,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:36,219 INFO L124 PetriNetUnfolderBase]: 2573/4237 cut-off events. [2024-06-28 00:16:36,220 INFO L125 PetriNetUnfolderBase]: For 89588/89588 co-relation queries the response was YES. [2024-06-28 00:16:36,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25239 conditions, 4237 events. 2573/4237 cut-off events. For 89588/89588 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 25511 event pairs, 553 based on Foata normal form. 2/4236 useless extension candidates. Maximal degree in co-relation 25158. Up to 3890 conditions per place. [2024-06-28 00:16:36,258 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 233 selfloop transitions, 49 changer transitions 0/287 dead transitions. [2024-06-28 00:16:36,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 287 transitions, 3943 flow [2024-06-28 00:16:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:16:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:16:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-28 00:16:36,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36796536796536794 [2024-06-28 00:16:36,260 INFO L175 Difference]: Start difference. First operand has 176 places, 252 transitions, 3227 flow. Second operand 11 states and 170 transitions. [2024-06-28 00:16:36,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 287 transitions, 3943 flow [2024-06-28 00:16:36,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 287 transitions, 3864 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-28 00:16:36,385 INFO L231 Difference]: Finished difference. Result has 184 places, 260 transitions, 3362 flow [2024-06-28 00:16:36,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3151, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3362, PETRI_PLACES=184, PETRI_TRANSITIONS=260} [2024-06-28 00:16:36,386 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places. [2024-06-28 00:16:36,386 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 260 transitions, 3362 flow [2024-06-28 00:16:36,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:36,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:36,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:36,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:16:36,386 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:36,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -817450668, now seen corresponding path program 1 times [2024-06-28 00:16:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166656874] [2024-06-28 00:16:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:41,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:41,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166656874] [2024-06-28 00:16:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166656874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:41,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:41,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:41,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451401404] [2024-06-28 00:16:41,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:41,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:41,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:41,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 260 transitions, 3362 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:41,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:41,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:41,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:43,398 INFO L124 PetriNetUnfolderBase]: 2586/4265 cut-off events. [2024-06-28 00:16:43,398 INFO L125 PetriNetUnfolderBase]: For 96457/96460 co-relation queries the response was YES. [2024-06-28 00:16:43,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25884 conditions, 4265 events. 2586/4265 cut-off events. For 96457/96460 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25822 event pairs, 725 based on Foata normal form. 3/4264 useless extension candidates. Maximal degree in co-relation 25801. Up to 3975 conditions per place. [2024-06-28 00:16:43,438 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 257 selfloop transitions, 30 changer transitions 0/292 dead transitions. [2024-06-28 00:16:43,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 292 transitions, 4232 flow [2024-06-28 00:16:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:16:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:16:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 00:16:43,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-28 00:16:43,440 INFO L175 Difference]: Start difference. First operand has 184 places, 260 transitions, 3362 flow. Second operand 7 states and 122 transitions. [2024-06-28 00:16:43,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 292 transitions, 4232 flow [2024-06-28 00:16:43,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 292 transitions, 4087 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-28 00:16:43,586 INFO L231 Difference]: Finished difference. Result has 185 places, 272 transitions, 3433 flow [2024-06-28 00:16:43,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3217, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3433, PETRI_PLACES=185, PETRI_TRANSITIONS=272} [2024-06-28 00:16:43,587 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places. [2024-06-28 00:16:43,587 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 272 transitions, 3433 flow [2024-06-28 00:16:43,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:43,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:43,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:43,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:16:43,588 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:43,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1730516414, now seen corresponding path program 2 times [2024-06-28 00:16:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87875978] [2024-06-28 00:16:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87875978] [2024-06-28 00:16:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87875978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:16:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142830626] [2024-06-28 00:16:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:48,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:16:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:16:48,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:16:48,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:48,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 272 transitions, 3433 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:48,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:48,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:48,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:50,346 INFO L124 PetriNetUnfolderBase]: 2627/4323 cut-off events. [2024-06-28 00:16:50,346 INFO L125 PetriNetUnfolderBase]: For 102214/102214 co-relation queries the response was YES. [2024-06-28 00:16:50,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26775 conditions, 4323 events. 2627/4323 cut-off events. For 102214/102214 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26148 event pairs, 717 based on Foata normal form. 1/4321 useless extension candidates. Maximal degree in co-relation 26692. Up to 4043 conditions per place. [2024-06-28 00:16:50,451 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 270 selfloop transitions, 39 changer transitions 0/314 dead transitions. [2024-06-28 00:16:50,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 314 transitions, 4459 flow [2024-06-28 00:16:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:16:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:16:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-28 00:16:50,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-28 00:16:50,453 INFO L175 Difference]: Start difference. First operand has 185 places, 272 transitions, 3433 flow. Second operand 10 states and 158 transitions. [2024-06-28 00:16:50,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 314 transitions, 4459 flow [2024-06-28 00:16:50,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 314 transitions, 4383 flow, removed 27 selfloop flow, removed 2 redundant places. [2024-06-28 00:16:50,602 INFO L231 Difference]: Finished difference. Result has 197 places, 292 transitions, 3708 flow [2024-06-28 00:16:50,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3382, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3708, PETRI_PLACES=197, PETRI_TRANSITIONS=292} [2024-06-28 00:16:50,603 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places. [2024-06-28 00:16:50,603 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 292 transitions, 3708 flow [2024-06-28 00:16:50,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:50,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:50,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-06-28 00:16:50,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:16:50,603 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:50,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash 90906306, now seen corresponding path program 3 times [2024-06-28 00:16:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:50,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518771999] [2024-06-28 00:16:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:55,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518771999] [2024-06-28 00:16:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518771999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:55,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:55,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091054574] [2024-06-28 00:16:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:55,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:55,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:16:55,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 292 transitions, 3708 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:55,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:55,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:16:55,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:57,454 INFO L124 PetriNetUnfolderBase]: 2629/4331 cut-off events. [2024-06-28 00:16:57,455 INFO L125 PetriNetUnfolderBase]: For 106287/106290 co-relation queries the response was YES. [2024-06-28 00:16:57,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27379 conditions, 4331 events. 2629/4331 cut-off events. For 106287/106290 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26240 event pairs, 720 based on Foata normal form. 4/4331 useless extension candidates. Maximal degree in co-relation 27288. Up to 4029 conditions per place. [2024-06-28 00:16:57,489 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 263 selfloop transitions, 42 changer transitions 0/310 dead transitions. [2024-06-28 00:16:57,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 310 transitions, 4481 flow [2024-06-28 00:16:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:16:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:16:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-28 00:16:57,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2024-06-28 00:16:57,491 INFO L175 Difference]: Start difference. First operand has 197 places, 292 transitions, 3708 flow. Second operand 8 states and 123 transitions. [2024-06-28 00:16:57,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 310 transitions, 4481 flow [2024-06-28 00:16:57,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 310 transitions, 4426 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-28 00:16:57,658 INFO L231 Difference]: Finished difference. Result has 204 places, 296 transitions, 3817 flow [2024-06-28 00:16:57,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3653, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3817, PETRI_PLACES=204, PETRI_TRANSITIONS=296} [2024-06-28 00:16:57,659 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2024-06-28 00:16:57,659 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 296 transitions, 3817 flow [2024-06-28 00:16:57,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:57,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:57,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:57,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:16:57,659 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:57,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash 297565326, now seen corresponding path program 4 times [2024-06-28 00:16:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78814811] [2024-06-28 00:16:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78814811] [2024-06-28 00:17:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78814811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:02,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255591172] [2024-06-28 00:17:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:02,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:02,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:02,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:02,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 296 transitions, 3817 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:02,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:02,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:02,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:04,930 INFO L124 PetriNetUnfolderBase]: 2626/4321 cut-off events. [2024-06-28 00:17:04,930 INFO L125 PetriNetUnfolderBase]: For 109425/109428 co-relation queries the response was YES. [2024-06-28 00:17:04,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27671 conditions, 4321 events. 2626/4321 cut-off events. For 109425/109428 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26153 event pairs, 729 based on Foata normal form. 3/4320 useless extension candidates. Maximal degree in co-relation 27577. Up to 4027 conditions per place. [2024-06-28 00:17:04,971 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 259 selfloop transitions, 54 changer transitions 0/318 dead transitions. [2024-06-28 00:17:04,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 318 transitions, 4652 flow [2024-06-28 00:17:04,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:17:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:17:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-28 00:17:04,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476190476190476 [2024-06-28 00:17:04,973 INFO L175 Difference]: Start difference. First operand has 204 places, 296 transitions, 3817 flow. Second operand 10 states and 146 transitions. [2024-06-28 00:17:04,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 318 transitions, 4652 flow [2024-06-28 00:17:05,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 318 transitions, 4552 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 00:17:05,144 INFO L231 Difference]: Finished difference. Result has 209 places, 303 transitions, 3938 flow [2024-06-28 00:17:05,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3732, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3938, PETRI_PLACES=209, PETRI_TRANSITIONS=303} [2024-06-28 00:17:05,144 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2024-06-28 00:17:05,144 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 303 transitions, 3938 flow [2024-06-28 00:17:05,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:05,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:05,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:05,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 00:17:05,145 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:05,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1568207300, now seen corresponding path program 1 times [2024-06-28 00:17:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853021307] [2024-06-28 00:17:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:11,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:11,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853021307] [2024-06-28 00:17:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853021307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:11,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369966356] [2024-06-28 00:17:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:11,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:11,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:11,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:11,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:11,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 303 transitions, 3938 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:11,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:11,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:11,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:13,338 INFO L124 PetriNetUnfolderBase]: 2717/4456 cut-off events. [2024-06-28 00:17:13,338 INFO L125 PetriNetUnfolderBase]: For 116631/116654 co-relation queries the response was YES. [2024-06-28 00:17:13,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28612 conditions, 4456 events. 2717/4456 cut-off events. For 116631/116654 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26911 event pairs, 614 based on Foata normal form. 17/4466 useless extension candidates. Maximal degree in co-relation 28517. Up to 4063 conditions per place. [2024-06-28 00:17:13,379 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 276 selfloop transitions, 76 changer transitions 0/357 dead transitions. [2024-06-28 00:17:13,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 357 transitions, 5092 flow [2024-06-28 00:17:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:17:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:17:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-28 00:17:13,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-28 00:17:13,381 INFO L175 Difference]: Start difference. First operand has 209 places, 303 transitions, 3938 flow. Second operand 10 states and 158 transitions. [2024-06-28 00:17:13,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 357 transitions, 5092 flow [2024-06-28 00:17:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 357 transitions, 5023 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-28 00:17:13,561 INFO L231 Difference]: Finished difference. Result has 215 places, 332 transitions, 4412 flow [2024-06-28 00:17:13,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3873, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4412, PETRI_PLACES=215, PETRI_TRANSITIONS=332} [2024-06-28 00:17:13,561 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places. [2024-06-28 00:17:13,562 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 332 transitions, 4412 flow [2024-06-28 00:17:13,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:13,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:13,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:13,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 00:17:13,562 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:13,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:13,562 INFO L85 PathProgramCache]: Analyzing trace with hash 428005510, now seen corresponding path program 1 times [2024-06-28 00:17:13,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:13,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686617388] [2024-06-28 00:17:13,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686617388] [2024-06-28 00:17:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686617388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:18,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:18,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814167863] [2024-06-28 00:17:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:18,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:18,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:18,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 332 transitions, 4412 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:18,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:18,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:18,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:19,933 INFO L124 PetriNetUnfolderBase]: 2711/4450 cut-off events. [2024-06-28 00:17:19,934 INFO L125 PetriNetUnfolderBase]: For 118713/118730 co-relation queries the response was YES. [2024-06-28 00:17:19,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28907 conditions, 4450 events. 2711/4450 cut-off events. For 118713/118730 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26940 event pairs, 611 based on Foata normal form. 15/4461 useless extension candidates. Maximal degree in co-relation 28809. Up to 3991 conditions per place. [2024-06-28 00:17:19,979 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 250 selfloop transitions, 103 changer transitions 0/358 dead transitions. [2024-06-28 00:17:19,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 358 transitions, 5244 flow [2024-06-28 00:17:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 00:17:19,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:17:19,981 INFO L175 Difference]: Start difference. First operand has 215 places, 332 transitions, 4412 flow. Second operand 9 states and 153 transitions. [2024-06-28 00:17:19,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 358 transitions, 5244 flow [2024-06-28 00:17:20,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 358 transitions, 5139 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-28 00:17:20,187 INFO L231 Difference]: Finished difference. Result has 220 places, 335 transitions, 4591 flow [2024-06-28 00:17:20,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4307, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4591, PETRI_PLACES=220, PETRI_TRANSITIONS=335} [2024-06-28 00:17:20,187 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places. [2024-06-28 00:17:20,188 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 335 transitions, 4591 flow [2024-06-28 00:17:20,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:20,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:20,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:20,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 00:17:20,188 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:20,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash -794529580, now seen corresponding path program 2 times [2024-06-28 00:17:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383089215] [2024-06-28 00:17:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:26,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-06-28 00:17:26,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:26,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383089215] [2024-06-28 00:17:26,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383089215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:26,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:26,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:17:26,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350339123] [2024-06-28 00:17:26,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:26,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:17:26,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:26,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:17:26,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:17:26,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:26,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 335 transitions, 4591 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:26,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:26,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:26,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:27,537 INFO L124 PetriNetUnfolderBase]: 2748/4498 cut-off events. [2024-06-28 00:17:27,538 INFO L125 PetriNetUnfolderBase]: For 127352/127363 co-relation queries the response was YES. [2024-06-28 00:17:27,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29887 conditions, 4498 events. 2748/4498 cut-off events. For 127352/127363 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27144 event pairs, 591 based on Foata normal form. 14/4508 useless extension candidates. Maximal degree in co-relation 29787. Up to 4067 conditions per place. [2024-06-28 00:17:27,579 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 280 selfloop transitions, 84 changer transitions 0/369 dead transitions. [2024-06-28 00:17:27,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 369 transitions, 5601 flow [2024-06-28 00:17:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:17:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:17:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-06-28 00:17:27,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3976190476190476 [2024-06-28 00:17:27,580 INFO L175 Difference]: Start difference. First operand has 220 places, 335 transitions, 4591 flow. Second operand 10 states and 167 transitions. [2024-06-28 00:17:27,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 369 transitions, 5601 flow [2024-06-28 00:17:27,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 369 transitions, 5362 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-28 00:17:27,772 INFO L231 Difference]: Finished difference. Result has 225 places, 343 transitions, 4693 flow [2024-06-28 00:17:27,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4352, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4693, PETRI_PLACES=225, PETRI_TRANSITIONS=343} [2024-06-28 00:17:27,773 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-28 00:17:27,773 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 343 transitions, 4693 flow [2024-06-28 00:17:27,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:27,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:27,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:27,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 00:17:27,773 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:27,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1208311690, now seen corresponding path program 3 times [2024-06-28 00:17:27,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:27,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736275079] [2024-06-28 00:17:27,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:35,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736275079] [2024-06-28 00:17:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736275079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:17:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971268701] [2024-06-28 00:17:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:35,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:17:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:17:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:17:35,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:35,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 343 transitions, 4693 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:35,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:35,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:35,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:36,872 INFO L124 PetriNetUnfolderBase]: 2772/4541 cut-off events. [2024-06-28 00:17:36,872 INFO L125 PetriNetUnfolderBase]: For 138135/138191 co-relation queries the response was YES. [2024-06-28 00:17:36,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30514 conditions, 4541 events. 2772/4541 cut-off events. For 138135/138191 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27465 event pairs, 638 based on Foata normal form. 38/4568 useless extension candidates. Maximal degree in co-relation 30412. Up to 4168 conditions per place. [2024-06-28 00:17:36,918 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 290 selfloop transitions, 68 changer transitions 0/363 dead transitions. [2024-06-28 00:17:36,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 363 transitions, 5586 flow [2024-06-28 00:17:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-06-28 00:17:36,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36243386243386244 [2024-06-28 00:17:36,920 INFO L175 Difference]: Start difference. First operand has 225 places, 343 transitions, 4693 flow. Second operand 9 states and 137 transitions. [2024-06-28 00:17:36,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 363 transitions, 5586 flow [2024-06-28 00:17:37,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 363 transitions, 5405 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-28 00:17:37,117 INFO L231 Difference]: Finished difference. Result has 228 places, 348 transitions, 4792 flow [2024-06-28 00:17:37,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4525, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4792, PETRI_PLACES=228, PETRI_TRANSITIONS=348} [2024-06-28 00:17:37,118 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places. [2024-06-28 00:17:37,118 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 348 transitions, 4792 flow [2024-06-28 00:17:37,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:37,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:37,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:37,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 00:17:37,119 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:37,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash 642688456, now seen corresponding path program 4 times [2024-06-28 00:17:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:37,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344042879] [2024-06-28 00:17:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344042879] [2024-06-28 00:17:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344042879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:17:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421075958] [2024-06-28 00:17:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:43,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:17:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:17:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:17:43,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:43,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 348 transitions, 4792 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:43,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:43,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:43,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:44,554 INFO L124 PetriNetUnfolderBase]: 2775/4545 cut-off events. [2024-06-28 00:17:44,554 INFO L125 PetriNetUnfolderBase]: For 138147/138158 co-relation queries the response was YES. [2024-06-28 00:17:44,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30675 conditions, 4545 events. 2775/4545 cut-off events. For 138147/138158 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 27481 event pairs, 606 based on Foata normal form. 14/4555 useless extension candidates. Maximal degree in co-relation 30571. Up to 4162 conditions per place. [2024-06-28 00:17:44,595 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 295 selfloop transitions, 75 changer transitions 0/375 dead transitions. [2024-06-28 00:17:44,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 375 transitions, 5646 flow [2024-06-28 00:17:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:17:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:17:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 00:17:44,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-28 00:17:44,598 INFO L175 Difference]: Start difference. First operand has 228 places, 348 transitions, 4792 flow. Second operand 10 states and 166 transitions. [2024-06-28 00:17:44,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 375 transitions, 5646 flow [2024-06-28 00:17:44,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 375 transitions, 5473 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-06-28 00:17:44,821 INFO L231 Difference]: Finished difference. Result has 233 places, 350 transitions, 4820 flow [2024-06-28 00:17:44,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4619, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4820, PETRI_PLACES=233, PETRI_TRANSITIONS=350} [2024-06-28 00:17:44,822 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places. [2024-06-28 00:17:44,822 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 350 transitions, 4820 flow [2024-06-28 00:17:44,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:44,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:44,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 00:17:44,823 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:44,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2007746422, now seen corresponding path program 5 times [2024-06-28 00:17:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463127905] [2024-06-28 00:17:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:50,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463127905] [2024-06-28 00:17:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463127905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:50,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:50,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:50,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083140348] [2024-06-28 00:17:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:50,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:50,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:50,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:50,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:50,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 350 transitions, 4820 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:50,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:50,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:50,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:52,338 INFO L124 PetriNetUnfolderBase]: 2778/4549 cut-off events. [2024-06-28 00:17:52,338 INFO L125 PetriNetUnfolderBase]: For 143105/143161 co-relation queries the response was YES. [2024-06-28 00:17:52,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30669 conditions, 4549 events. 2778/4549 cut-off events. For 143105/143161 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27522 event pairs, 621 based on Foata normal form. 36/4574 useless extension candidates. Maximal degree in co-relation 30564. Up to 4054 conditions per place. [2024-06-28 00:17:52,381 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 252 selfloop transitions, 108 changer transitions 0/365 dead transitions. [2024-06-28 00:17:52,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 365 transitions, 5632 flow [2024-06-28 00:17:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:17:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:17:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-28 00:17:52,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:17:52,383 INFO L175 Difference]: Start difference. First operand has 233 places, 350 transitions, 4820 flow. Second operand 8 states and 126 transitions. [2024-06-28 00:17:52,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 365 transitions, 5632 flow [2024-06-28 00:17:52,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 365 transitions, 5415 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-06-28 00:17:52,651 INFO L231 Difference]: Finished difference. Result has 233 places, 352 transitions, 4909 flow [2024-06-28 00:17:52,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4603, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4909, PETRI_PLACES=233, PETRI_TRANSITIONS=352} [2024-06-28 00:17:52,652 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places. [2024-06-28 00:17:52,652 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 352 transitions, 4909 flow [2024-06-28 00:17:52,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:52,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:52,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:52,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 00:17:52,652 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:52,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1352868280, now seen corresponding path program 1 times [2024-06-28 00:17:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25197560] [2024-06-28 00:17:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:57,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25197560] [2024-06-28 00:17:57,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25197560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:57,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:57,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:17:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288880764] [2024-06-28 00:17:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:17:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:17:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:17:57,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:17:57,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 352 transitions, 4909 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:57,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:57,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:17:57,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:59,432 INFO L124 PetriNetUnfolderBase]: 2794/4571 cut-off events. [2024-06-28 00:17:59,432 INFO L125 PetriNetUnfolderBase]: For 147919/147949 co-relation queries the response was YES. [2024-06-28 00:17:59,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31092 conditions, 4571 events. 2794/4571 cut-off events. For 147919/147949 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 27629 event pairs, 564 based on Foata normal form. 24/4588 useless extension candidates. Maximal degree in co-relation 30986. Up to 4013 conditions per place. [2024-06-28 00:17:59,476 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 308 selfloop transitions, 75 changer transitions 0/388 dead transitions. [2024-06-28 00:17:59,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 388 transitions, 5983 flow [2024-06-28 00:17:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 00:17:59,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994708994708995 [2024-06-28 00:17:59,478 INFO L175 Difference]: Start difference. First operand has 233 places, 352 transitions, 4909 flow. Second operand 9 states and 151 transitions. [2024-06-28 00:17:59,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 388 transitions, 5983 flow [2024-06-28 00:17:59,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 388 transitions, 5745 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-28 00:17:59,765 INFO L231 Difference]: Finished difference. Result has 236 places, 356 transitions, 4921 flow [2024-06-28 00:17:59,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4677, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4921, PETRI_PLACES=236, PETRI_TRANSITIONS=356} [2024-06-28 00:17:59,765 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 193 predicate places. [2024-06-28 00:17:59,765 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 356 transitions, 4921 flow [2024-06-28 00:17:59,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:59,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:59,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:59,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 00:17:59,766 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:59,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:59,766 INFO L85 PathProgramCache]: Analyzing trace with hash 426033084, now seen corresponding path program 2 times [2024-06-28 00:17:59,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:59,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279600923] [2024-06-28 00:17:59,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279600923] [2024-06-28 00:18:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279600923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795352803] [2024-06-28 00:18:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:04,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:04,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:04,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:04,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:18:04,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 356 transitions, 4921 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:04,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:04,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:18:04,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:06,691 INFO L124 PetriNetUnfolderBase]: 2810/4597 cut-off events. [2024-06-28 00:18:06,691 INFO L125 PetriNetUnfolderBase]: For 149253/149309 co-relation queries the response was YES. [2024-06-28 00:18:06,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31180 conditions, 4597 events. 2810/4597 cut-off events. For 149253/149309 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 27885 event pairs, 645 based on Foata normal form. 43/4629 useless extension candidates. Maximal degree in co-relation 31073. Up to 4159 conditions per place. [2024-06-28 00:18:06,739 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 304 selfloop transitions, 69 changer transitions 0/378 dead transitions. [2024-06-28 00:18:06,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 378 transitions, 5809 flow [2024-06-28 00:18:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-28 00:18:06,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-28 00:18:06,741 INFO L175 Difference]: Start difference. First operand has 236 places, 356 transitions, 4921 flow. Second operand 8 states and 128 transitions. [2024-06-28 00:18:06,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 378 transitions, 5809 flow [2024-06-28 00:18:07,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 378 transitions, 5702 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-28 00:18:07,016 INFO L231 Difference]: Finished difference. Result has 240 places, 358 transitions, 5008 flow [2024-06-28 00:18:07,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4822, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5008, PETRI_PLACES=240, PETRI_TRANSITIONS=358} [2024-06-28 00:18:07,017 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places. [2024-06-28 00:18:07,017 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 358 transitions, 5008 flow [2024-06-28 00:18:07,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:07,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:07,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:07,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 00:18:07,017 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:07,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1355730200, now seen corresponding path program 1 times [2024-06-28 00:18:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262543071] [2024-06-28 00:18:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:12,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:12,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262543071] [2024-06-28 00:18:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262543071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675389932] [2024-06-28 00:18:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:12,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:13,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:18:13,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 358 transitions, 5008 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:13,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:13,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:18:13,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:15,093 INFO L124 PetriNetUnfolderBase]: 2807/4584 cut-off events. [2024-06-28 00:18:15,093 INFO L125 PetriNetUnfolderBase]: For 149823/149823 co-relation queries the response was YES. [2024-06-28 00:18:15,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31284 conditions, 4584 events. 2807/4584 cut-off events. For 149823/149823 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 27667 event pairs, 722 based on Foata normal form. 1/4582 useless extension candidates. Maximal degree in co-relation 31175. Up to 4273 conditions per place. [2024-06-28 00:18:15,136 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 321 selfloop transitions, 55 changer transitions 0/381 dead transitions. [2024-06-28 00:18:15,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 381 transitions, 5913 flow [2024-06-28 00:18:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 00:18:15,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-28 00:18:15,138 INFO L175 Difference]: Start difference. First operand has 240 places, 358 transitions, 5008 flow. Second operand 8 states and 139 transitions. [2024-06-28 00:18:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 381 transitions, 5913 flow [2024-06-28 00:18:15,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 381 transitions, 5687 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-28 00:18:15,388 INFO L231 Difference]: Finished difference. Result has 241 places, 359 transitions, 4911 flow [2024-06-28 00:18:15,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4788, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4911, PETRI_PLACES=241, PETRI_TRANSITIONS=359} [2024-06-28 00:18:15,389 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 198 predicate places. [2024-06-28 00:18:15,389 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 359 transitions, 4911 flow [2024-06-28 00:18:15,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:15,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:15,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:15,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 00:18:15,389 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:15,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:15,390 INFO L85 PathProgramCache]: Analyzing trace with hash -507583332, now seen corresponding path program 3 times [2024-06-28 00:18:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:15,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900056207] [2024-06-28 00:18:15,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:20,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900056207] [2024-06-28 00:18:20,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900056207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:20,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:20,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:18:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474501646] [2024-06-28 00:18:20,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:20,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:18:20,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:18:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:18:20,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:18:20,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 359 transitions, 4911 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:20,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:20,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:18:20,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:22,172 INFO L124 PetriNetUnfolderBase]: 2797/4585 cut-off events. [2024-06-28 00:18:22,172 INFO L125 PetriNetUnfolderBase]: For 154008/154069 co-relation queries the response was YES. [2024-06-28 00:18:22,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30945 conditions, 4585 events. 2797/4585 cut-off events. For 154008/154069 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 27808 event pairs, 639 based on Foata normal form. 37/4611 useless extension candidates. Maximal degree in co-relation 30836. Up to 4201 conditions per place. [2024-06-28 00:18:22,219 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 309 selfloop transitions, 60 changer transitions 0/374 dead transitions. [2024-06-28 00:18:22,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 374 transitions, 5728 flow [2024-06-28 00:18:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-28 00:18:22,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2024-06-28 00:18:22,223 INFO L175 Difference]: Start difference. First operand has 241 places, 359 transitions, 4911 flow. Second operand 8 states and 123 transitions. [2024-06-28 00:18:22,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 374 transitions, 5728 flow [2024-06-28 00:18:22,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 374 transitions, 5605 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-28 00:18:22,486 INFO L231 Difference]: Finished difference. Result has 245 places, 359 transitions, 4919 flow [2024-06-28 00:18:22,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4792, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4919, PETRI_PLACES=245, PETRI_TRANSITIONS=359} [2024-06-28 00:18:22,487 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places. [2024-06-28 00:18:22,487 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 359 transitions, 4919 flow [2024-06-28 00:18:22,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:22,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:22,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:22,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 00:18:22,488 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:22,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1471021370, now seen corresponding path program 2 times [2024-06-28 00:18:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340700360] [2024-06-28 00:18:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:28,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-06-28 00:18:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340700360] [2024-06-28 00:18:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340700360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65613007] [2024-06-28 00:18:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:28,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:28,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:18:28,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 359 transitions, 4919 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:28,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:28,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:18:28,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:30,185 INFO L124 PetriNetUnfolderBase]: 2802/4583 cut-off events. [2024-06-28 00:18:30,185 INFO L125 PetriNetUnfolderBase]: For 155252/155252 co-relation queries the response was YES. [2024-06-28 00:18:30,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31086 conditions, 4583 events. 2802/4583 cut-off events. For 155252/155252 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 27752 event pairs, 720 based on Foata normal form. 1/4581 useless extension candidates. Maximal degree in co-relation 30975. Up to 4302 conditions per place. [2024-06-28 00:18:30,228 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 334 selfloop transitions, 41 changer transitions 0/380 dead transitions. [2024-06-28 00:18:30,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 380 transitions, 5854 flow [2024-06-28 00:18:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-28 00:18:30,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-28 00:18:30,230 INFO L175 Difference]: Start difference. First operand has 245 places, 359 transitions, 4919 flow. Second operand 9 states and 144 transitions. [2024-06-28 00:18:30,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 380 transitions, 5854 flow [2024-06-28 00:18:30,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 380 transitions, 5716 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-28 00:18:30,487 INFO L231 Difference]: Finished difference. Result has 247 places, 362 transitions, 4920 flow [2024-06-28 00:18:30,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4781, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4920, PETRI_PLACES=247, PETRI_TRANSITIONS=362} [2024-06-28 00:18:30,488 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-06-28 00:18:30,488 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 362 transitions, 4920 flow [2024-06-28 00:18:30,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:30,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:30,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:30,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 00:18:30,488 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:30,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 544305214, now seen corresponding path program 3 times [2024-06-28 00:18:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565699133] [2024-06-28 00:18:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:36,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565699133] [2024-06-28 00:18:36,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565699133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:36,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611248705] [2024-06-28 00:18:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:36,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:36,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:18:36,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 362 transitions, 4920 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:36,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:36,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:18:36,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:38,467 INFO L124 PetriNetUnfolderBase]: 2804/4589 cut-off events. [2024-06-28 00:18:38,467 INFO L125 PetriNetUnfolderBase]: For 160288/160291 co-relation queries the response was YES. [2024-06-28 00:18:38,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31088 conditions, 4589 events. 2804/4589 cut-off events. For 160288/160291 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27797 event pairs, 722 based on Foata normal form. 4/4589 useless extension candidates. Maximal degree in co-relation 30976. Up to 4288 conditions per place. [2024-06-28 00:18:38,511 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 320 selfloop transitions, 56 changer transitions 0/381 dead transitions. [2024-06-28 00:18:38,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 381 transitions, 5877 flow [2024-06-28 00:18:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:18:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:18:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-28 00:18:38,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-28 00:18:38,513 INFO L175 Difference]: Start difference. First operand has 247 places, 362 transitions, 4920 flow. Second operand 10 states and 147 transitions. [2024-06-28 00:18:38,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 381 transitions, 5877 flow [2024-06-28 00:18:38,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 381 transitions, 5761 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 00:18:38,785 INFO L231 Difference]: Finished difference. Result has 251 places, 367 transitions, 5013 flow [2024-06-28 00:18:38,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4811, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5013, PETRI_PLACES=251, PETRI_TRANSITIONS=367} [2024-06-28 00:18:38,786 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places. [2024-06-28 00:18:38,786 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 367 transitions, 5013 flow [2024-06-28 00:18:38,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:38,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:38,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:38,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 00:18:38,786 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:38,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash 406517870, now seen corresponding path program 4 times [2024-06-28 00:18:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:38,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843429352] [2024-06-28 00:18:38,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843429352] [2024-06-28 00:18:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843429352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:18:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93615093] [2024-06-28 00:18:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:45,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:18:45,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:18:45,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:18:45,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:18:45,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 367 transitions, 5013 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:45,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:45,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:18:45,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:47,514 INFO L124 PetriNetUnfolderBase]: 2801/4579 cut-off events. [2024-06-28 00:18:47,514 INFO L125 PetriNetUnfolderBase]: For 163282/163285 co-relation queries the response was YES. [2024-06-28 00:18:47,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31125 conditions, 4579 events. 2801/4579 cut-off events. For 163282/163285 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27726 event pairs, 734 based on Foata normal form. 3/4578 useless extension candidates. Maximal degree in co-relation 31012. Up to 4285 conditions per place. [2024-06-28 00:18:47,558 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 320 selfloop transitions, 53 changer transitions 0/378 dead transitions. [2024-06-28 00:18:47,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 378 transitions, 5785 flow [2024-06-28 00:18:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-28 00:18:47,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2024-06-28 00:18:47,560 INFO L175 Difference]: Start difference. First operand has 251 places, 367 transitions, 5013 flow. Second operand 8 states and 123 transitions. [2024-06-28 00:18:47,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 378 transitions, 5785 flow [2024-06-28 00:18:47,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 378 transitions, 5665 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-28 00:18:47,861 INFO L231 Difference]: Finished difference. Result has 253 places, 367 transitions, 5013 flow [2024-06-28 00:18:47,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4893, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5013, PETRI_PLACES=253, PETRI_TRANSITIONS=367} [2024-06-28 00:18:47,862 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-28 00:18:47,862 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 367 transitions, 5013 flow [2024-06-28 00:18:47,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:47,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:47,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:47,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 00:18:47,863 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:47,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash -794523628, now seen corresponding path program 1 times [2024-06-28 00:18:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410854351] [2024-06-28 00:18:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:54,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410854351] [2024-06-28 00:18:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410854351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:54,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:18:54,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295926310] [2024-06-28 00:18:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:54,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:18:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:18:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:18:54,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:18:54,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 367 transitions, 5013 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:54,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:54,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:18:54,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:56,398 INFO L124 PetriNetUnfolderBase]: 2796/4572 cut-off events. [2024-06-28 00:18:56,399 INFO L125 PetriNetUnfolderBase]: For 161070/161073 co-relation queries the response was YES. [2024-06-28 00:18:56,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30955 conditions, 4572 events. 2796/4572 cut-off events. For 161070/161073 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27582 event pairs, 719 based on Foata normal form. 4/4572 useless extension candidates. Maximal degree in co-relation 30842. Up to 4290 conditions per place. [2024-06-28 00:18:56,443 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 342 selfloop transitions, 34 changer transitions 0/381 dead transitions. [2024-06-28 00:18:56,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 381 transitions, 5839 flow [2024-06-28 00:18:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:18:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:18:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 00:18:56,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3601190476190476 [2024-06-28 00:18:56,444 INFO L175 Difference]: Start difference. First operand has 253 places, 367 transitions, 5013 flow. Second operand 8 states and 121 transitions. [2024-06-28 00:18:56,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 381 transitions, 5839 flow [2024-06-28 00:18:56,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 381 transitions, 5719 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 00:18:56,721 INFO L231 Difference]: Finished difference. Result has 253 places, 369 transitions, 5020 flow [2024-06-28 00:18:56,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4893, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5020, PETRI_PLACES=253, PETRI_TRANSITIONS=369} [2024-06-28 00:18:56,721 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-28 00:18:56,721 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 369 transitions, 5020 flow [2024-06-28 00:18:56,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:56,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:56,721 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, 1] [2024-06-28 00:18:56,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 00:18:56,722 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:56,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1861967923, now seen corresponding path program 1 times [2024-06-28 00:18:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755810125] [2024-06-28 00:18:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:03,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755810125] [2024-06-28 00:19:03,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755810125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:03,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767506925] [2024-06-28 00:19:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:03,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:03,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:03,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:03,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:19:03,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 369 transitions, 5020 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:03,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:03,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:19:03,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:06,191 INFO L124 PetriNetUnfolderBase]: 2809/4596 cut-off events. [2024-06-28 00:19:06,192 INFO L125 PetriNetUnfolderBase]: For 160772/160780 co-relation queries the response was YES. [2024-06-28 00:19:06,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31228 conditions, 4596 events. 2809/4596 cut-off events. For 160772/160780 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27757 event pairs, 571 based on Foata normal form. 9/4602 useless extension candidates. Maximal degree in co-relation 31115. Up to 3913 conditions per place. [2024-06-28 00:19:06,234 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 308 selfloop transitions, 118 changer transitions 0/431 dead transitions. [2024-06-28 00:19:06,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 431 transitions, 6352 flow [2024-06-28 00:19:06,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:19:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:19:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2024-06-28 00:19:06,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:19:06,236 INFO L175 Difference]: Start difference. First operand has 253 places, 369 transitions, 5020 flow. Second operand 12 states and 216 transitions. [2024-06-28 00:19:06,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 431 transitions, 6352 flow [2024-06-28 00:19:06,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 431 transitions, 6257 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:06,531 INFO L231 Difference]: Finished difference. Result has 259 places, 378 transitions, 5335 flow [2024-06-28 00:19:06,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4925, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5335, PETRI_PLACES=259, PETRI_TRANSITIONS=378} [2024-06-28 00:19:06,531 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places. [2024-06-28 00:19:06,532 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 378 transitions, 5335 flow [2024-06-28 00:19:06,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:06,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:06,532 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, 1] [2024-06-28 00:19:06,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 00:19:06,532 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:06,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash -410596817, now seen corresponding path program 1 times [2024-06-28 00:19:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49594425] [2024-06-28 00:19:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:12,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-06-28 00:19:12,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49594425] [2024-06-28 00:19:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49594425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:12,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26940423] [2024-06-28 00:19:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:12,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:12,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:19:12,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 378 transitions, 5335 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:12,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:12,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:19:12,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:15,166 INFO L124 PetriNetUnfolderBase]: 2828/4622 cut-off events. [2024-06-28 00:19:15,166 INFO L125 PetriNetUnfolderBase]: For 171237/171245 co-relation queries the response was YES. [2024-06-28 00:19:15,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32309 conditions, 4622 events. 2828/4622 cut-off events. For 171237/171245 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 27909 event pairs, 561 based on Foata normal form. 10/4629 useless extension candidates. Maximal degree in co-relation 32195. Up to 3969 conditions per place. [2024-06-28 00:19:15,212 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 295 selfloop transitions, 142 changer transitions 0/442 dead transitions. [2024-06-28 00:19:15,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 442 transitions, 6597 flow [2024-06-28 00:19:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:19:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:19:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 244 transitions. [2024-06-28 00:19:15,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-28 00:19:15,215 INFO L175 Difference]: Start difference. First operand has 259 places, 378 transitions, 5335 flow. Second operand 14 states and 244 transitions. [2024-06-28 00:19:15,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 442 transitions, 6597 flow [2024-06-28 00:19:15,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 442 transitions, 6384 flow, removed 41 selfloop flow, removed 8 redundant places. [2024-06-28 00:19:15,557 INFO L231 Difference]: Finished difference. Result has 266 places, 386 transitions, 5559 flow [2024-06-28 00:19:15,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5125, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5559, PETRI_PLACES=266, PETRI_TRANSITIONS=386} [2024-06-28 00:19:15,558 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 223 predicate places. [2024-06-28 00:19:15,558 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 386 transitions, 5559 flow [2024-06-28 00:19:15,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:15,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:15,564 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, 1] [2024-06-28 00:19:15,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 00:19:15,564 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:15,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1861847953, now seen corresponding path program 2 times [2024-06-28 00:19:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969434749] [2024-06-28 00:19:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969434749] [2024-06-28 00:19:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969434749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:21,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:21,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31892652] [2024-06-28 00:19:21,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:21,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:21,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:21,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:19:21,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 386 transitions, 5559 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:21,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:21,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:19:21,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:24,309 INFO L124 PetriNetUnfolderBase]: 2842/4654 cut-off events. [2024-06-28 00:19:24,309 INFO L125 PetriNetUnfolderBase]: For 179262/179270 co-relation queries the response was YES. [2024-06-28 00:19:24,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33274 conditions, 4654 events. 2842/4654 cut-off events. For 179262/179270 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28255 event pairs, 568 based on Foata normal form. 9/4660 useless extension candidates. Maximal degree in co-relation 33160. Up to 4146 conditions per place. [2024-06-28 00:19:24,358 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 334 selfloop transitions, 103 changer transitions 0/442 dead transitions. [2024-06-28 00:19:24,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 442 transitions, 6648 flow [2024-06-28 00:19:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:19:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:19:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-28 00:19:24,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-28 00:19:24,360 INFO L175 Difference]: Start difference. First operand has 266 places, 386 transitions, 5559 flow. Second operand 11 states and 204 transitions. [2024-06-28 00:19:24,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 442 transitions, 6648 flow [2024-06-28 00:19:24,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 442 transitions, 6297 flow, removed 49 selfloop flow, removed 10 redundant places. [2024-06-28 00:19:24,704 INFO L231 Difference]: Finished difference. Result has 267 places, 392 transitions, 5513 flow [2024-06-28 00:19:24,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5208, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5513, PETRI_PLACES=267, PETRI_TRANSITIONS=392} [2024-06-28 00:19:24,704 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 224 predicate places. [2024-06-28 00:19:24,705 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 392 transitions, 5513 flow [2024-06-28 00:19:24,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:24,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:24,705 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, 1] [2024-06-28 00:19:24,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 00:19:24,705 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:24,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash -233465297, now seen corresponding path program 2 times [2024-06-28 00:19:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:24,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070337994] [2024-06-28 00:19:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:30,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070337994] [2024-06-28 00:19:30,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070337994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529471881] [2024-06-28 00:19:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:30,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:30,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:19:30,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 392 transitions, 5513 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:30,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:30,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:19:30,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:33,312 INFO L124 PetriNetUnfolderBase]: 2918/4764 cut-off events. [2024-06-28 00:19:33,313 INFO L125 PetriNetUnfolderBase]: For 187690/187698 co-relation queries the response was YES. [2024-06-28 00:19:33,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34005 conditions, 4764 events. 2918/4764 cut-off events. For 187690/187698 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 28903 event pairs, 558 based on Foata normal form. 10/4771 useless extension candidates. Maximal degree in co-relation 33890. Up to 4050 conditions per place. [2024-06-28 00:19:33,365 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 295 selfloop transitions, 177 changer transitions 0/477 dead transitions. [2024-06-28 00:19:33,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 477 transitions, 7262 flow [2024-06-28 00:19:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-28 00:19:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-28 00:19:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 263 transitions. [2024-06-28 00:19:33,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3913690476190476 [2024-06-28 00:19:33,367 INFO L175 Difference]: Start difference. First operand has 267 places, 392 transitions, 5513 flow. Second operand 16 states and 263 transitions. [2024-06-28 00:19:33,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 477 transitions, 7262 flow [2024-06-28 00:19:33,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 477 transitions, 7002 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-28 00:19:33,743 INFO L231 Difference]: Finished difference. Result has 275 places, 422 transitions, 6056 flow [2024-06-28 00:19:33,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5289, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6056, PETRI_PLACES=275, PETRI_TRANSITIONS=422} [2024-06-28 00:19:33,744 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 232 predicate places. [2024-06-28 00:19:33,744 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 422 transitions, 6056 flow [2024-06-28 00:19:33,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:33,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:33,744 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, 1] [2024-06-28 00:19:33,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 00:19:33,744 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:33,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1684716433, now seen corresponding path program 3 times [2024-06-28 00:19:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138936811] [2024-06-28 00:19:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138936811] [2024-06-28 00:19:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138936811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866561461] [2024-06-28 00:19:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:40,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:40,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:40,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:40,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:19:40,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 422 transitions, 6056 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:40,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:40,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:19:40,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:43,316 INFO L124 PetriNetUnfolderBase]: 2931/4784 cut-off events. [2024-06-28 00:19:43,316 INFO L125 PetriNetUnfolderBase]: For 194077/194085 co-relation queries the response was YES. [2024-06-28 00:19:43,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34550 conditions, 4784 events. 2931/4784 cut-off events. For 194077/194085 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 29076 event pairs, 571 based on Foata normal form. 9/4790 useless extension candidates. Maximal degree in co-relation 34433. Up to 4256 conditions per place. [2024-06-28 00:19:43,373 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 339 selfloop transitions, 130 changer transitions 0/474 dead transitions. [2024-06-28 00:19:43,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 474 transitions, 7320 flow [2024-06-28 00:19:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:19:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:19:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 226 transitions. [2024-06-28 00:19:43,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2024-06-28 00:19:43,375 INFO L175 Difference]: Start difference. First operand has 275 places, 422 transitions, 6056 flow. Second operand 14 states and 226 transitions. [2024-06-28 00:19:43,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 474 transitions, 7320 flow [2024-06-28 00:19:43,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 474 transitions, 7053 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-28 00:19:43,879 INFO L231 Difference]: Finished difference. Result has 283 places, 428 transitions, 6177 flow [2024-06-28 00:19:43,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5789, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6177, PETRI_PLACES=283, PETRI_TRANSITIONS=428} [2024-06-28 00:19:43,879 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places. [2024-06-28 00:19:43,879 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 428 transitions, 6177 flow [2024-06-28 00:19:43,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:43,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:43,880 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, 1] [2024-06-28 00:19:43,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 00:19:43,880 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:43,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1724945537, now seen corresponding path program 3 times [2024-06-28 00:19:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648348311] [2024-06-28 00:19:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:49,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648348311] [2024-06-28 00:19:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648348311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:49,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:49,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:49,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758624162] [2024-06-28 00:19:49,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:49,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:49,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:49,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:19:49,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 428 transitions, 6177 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:49,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:49,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:19:49,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:51,486 INFO L124 PetriNetUnfolderBase]: 2925/4780 cut-off events. [2024-06-28 00:19:51,486 INFO L125 PetriNetUnfolderBase]: For 198921/198929 co-relation queries the response was YES. [2024-06-28 00:19:51,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34495 conditions, 4780 events. 2925/4780 cut-off events. For 198921/198929 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 29090 event pairs, 556 based on Foata normal form. 10/4787 useless extension candidates. Maximal degree in co-relation 34376. Up to 4063 conditions per place. [2024-06-28 00:19:51,538 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 298 selfloop transitions, 176 changer transitions 0/479 dead transitions. [2024-06-28 00:19:51,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 479 transitions, 7395 flow [2024-06-28 00:19:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:19:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:19:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 237 transitions. [2024-06-28 00:19:51,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4030612244897959 [2024-06-28 00:19:51,540 INFO L175 Difference]: Start difference. First operand has 283 places, 428 transitions, 6177 flow. Second operand 14 states and 237 transitions. [2024-06-28 00:19:51,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 479 transitions, 7395 flow [2024-06-28 00:19:52,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 479 transitions, 7083 flow, removed 33 selfloop flow, removed 11 redundant places. [2024-06-28 00:19:52,062 INFO L231 Difference]: Finished difference. Result has 286 places, 428 transitions, 6224 flow [2024-06-28 00:19:52,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5865, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6224, PETRI_PLACES=286, PETRI_TRANSITIONS=428} [2024-06-28 00:19:52,063 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 243 predicate places. [2024-06-28 00:19:52,063 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 428 transitions, 6224 flow [2024-06-28 00:19:52,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:52,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:52,063 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, 1] [2024-06-28 00:19:52,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 00:19:52,063 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:52,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1126295619, now seen corresponding path program 4 times [2024-06-28 00:19:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176052655] [2024-06-28 00:19:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:01,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176052655] [2024-06-28 00:20:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176052655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435684053] [2024-06-28 00:20:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:01,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:01,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:01,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:20:01,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 428 transitions, 6224 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:01,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:01,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:20:01,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:03,598 INFO L124 PetriNetUnfolderBase]: 3008/4918 cut-off events. [2024-06-28 00:20:03,599 INFO L125 PetriNetUnfolderBase]: For 213019/213039 co-relation queries the response was YES. [2024-06-28 00:20:03,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35829 conditions, 4918 events. 3008/4918 cut-off events. For 213019/213039 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 30095 event pairs, 638 based on Foata normal form. 12/4921 useless extension candidates. Maximal degree in co-relation 35710. Up to 4287 conditions per place. [2024-06-28 00:20:03,655 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 366 selfloop transitions, 133 changer transitions 0/504 dead transitions. [2024-06-28 00:20:03,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 504 transitions, 8153 flow [2024-06-28 00:20:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:20:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:20:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-28 00:20:03,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2024-06-28 00:20:03,658 INFO L175 Difference]: Start difference. First operand has 286 places, 428 transitions, 6224 flow. Second operand 11 states and 193 transitions. [2024-06-28 00:20:03,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 504 transitions, 8153 flow [2024-06-28 00:20:04,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 504 transitions, 7843 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-28 00:20:04,112 INFO L231 Difference]: Finished difference. Result has 287 places, 460 transitions, 6690 flow [2024-06-28 00:20:04,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5918, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6690, PETRI_PLACES=287, PETRI_TRANSITIONS=460} [2024-06-28 00:20:04,113 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 244 predicate places. [2024-06-28 00:20:04,113 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 460 transitions, 6690 flow [2024-06-28 00:20:04,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:04,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:04,113 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, 1] [2024-06-28 00:20:04,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 00:20:04,113 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:04,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1636828787, now seen corresponding path program 1 times [2024-06-28 00:20:04,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:04,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882416398] [2024-06-28 00:20:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:10,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882416398] [2024-06-28 00:20:10,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882416398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:10,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:10,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602777396] [2024-06-28 00:20:10,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:10,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:10,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:10,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:20:10,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 460 transitions, 6690 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:10,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:10,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:20:10,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:13,101 INFO L124 PetriNetUnfolderBase]: 3060/4998 cut-off events. [2024-06-28 00:20:13,101 INFO L125 PetriNetUnfolderBase]: For 228072/228092 co-relation queries the response was YES. [2024-06-28 00:20:13,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36770 conditions, 4998 events. 3060/4998 cut-off events. For 228072/228092 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 30685 event pairs, 629 based on Foata normal form. 13/5002 useless extension candidates. Maximal degree in co-relation 36647. Up to 4411 conditions per place. [2024-06-28 00:20:13,160 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 386 selfloop transitions, 113 changer transitions 0/504 dead transitions. [2024-06-28 00:20:13,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 504 transitions, 8248 flow [2024-06-28 00:20:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:20:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:20:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-28 00:20:13,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:20:13,162 INFO L175 Difference]: Start difference. First operand has 287 places, 460 transitions, 6690 flow. Second operand 10 states and 170 transitions. [2024-06-28 00:20:13,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 504 transitions, 8248 flow [2024-06-28 00:20:13,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 504 transitions, 8172 flow, removed 35 selfloop flow, removed 2 redundant places. [2024-06-28 00:20:13,795 INFO L231 Difference]: Finished difference. Result has 297 places, 473 transitions, 7124 flow [2024-06-28 00:20:13,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6614, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7124, PETRI_PLACES=297, PETRI_TRANSITIONS=473} [2024-06-28 00:20:13,795 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 254 predicate places. [2024-06-28 00:20:13,795 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 473 transitions, 7124 flow [2024-06-28 00:20:13,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:13,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:13,795 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, 1] [2024-06-28 00:20:13,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 00:20:13,796 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:13,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1125997089, now seen corresponding path program 5 times [2024-06-28 00:20:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260869120] [2024-06-28 00:20:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:20,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-06-28 00:20:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260869120] [2024-06-28 00:20:20,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260869120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:20,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:20,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576990084] [2024-06-28 00:20:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:20,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:20,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:20:20,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 473 transitions, 7124 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:20,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:20,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:20:20,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:22,753 INFO L124 PetriNetUnfolderBase]: 3073/5018 cut-off events. [2024-06-28 00:20:22,753 INFO L125 PetriNetUnfolderBase]: For 238502/238522 co-relation queries the response was YES. [2024-06-28 00:20:22,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37861 conditions, 5018 events. 3073/5018 cut-off events. For 238502/238522 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 30800 event pairs, 643 based on Foata normal form. 12/5021 useless extension candidates. Maximal degree in co-relation 37734. Up to 4374 conditions per place. [2024-06-28 00:20:22,810 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 371 selfloop transitions, 143 changer transitions 0/519 dead transitions. [2024-06-28 00:20:22,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 519 transitions, 8731 flow [2024-06-28 00:20:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:20:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:20:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2024-06-28 00:20:22,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2024-06-28 00:20:22,812 INFO L175 Difference]: Start difference. First operand has 297 places, 473 transitions, 7124 flow. Second operand 12 states and 200 transitions. [2024-06-28 00:20:22,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 519 transitions, 8731 flow [2024-06-28 00:20:23,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 519 transitions, 8542 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-28 00:20:23,432 INFO L231 Difference]: Finished difference. Result has 305 places, 479 transitions, 7343 flow [2024-06-28 00:20:23,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6935, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7343, PETRI_PLACES=305, PETRI_TRANSITIONS=479} [2024-06-28 00:20:23,432 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 262 predicate places. [2024-06-28 00:20:23,432 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 479 transitions, 7343 flow [2024-06-28 00:20:23,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:23,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:23,433 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, 1] [2024-06-28 00:20:23,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 00:20:23,433 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:23,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1712058347, now seen corresponding path program 6 times [2024-06-28 00:20:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:23,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127189393] [2024-06-28 00:20:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:32,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127189393] [2024-06-28 00:20:32,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127189393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:32,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:32,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638820645] [2024-06-28 00:20:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:32,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:32,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:32,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:20:32,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 479 transitions, 7343 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:32,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:32,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:20:32,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:34,331 INFO L124 PetriNetUnfolderBase]: 3070/5018 cut-off events. [2024-06-28 00:20:34,331 INFO L125 PetriNetUnfolderBase]: For 243961/243981 co-relation queries the response was YES. [2024-06-28 00:20:34,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38107 conditions, 5018 events. 3070/5018 cut-off events. For 243961/243981 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 30893 event pairs, 645 based on Foata normal form. 12/5021 useless extension candidates. Maximal degree in co-relation 37978. Up to 4371 conditions per place. [2024-06-28 00:20:34,391 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 374 selfloop transitions, 132 changer transitions 0/511 dead transitions. [2024-06-28 00:20:34,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 511 transitions, 8692 flow [2024-06-28 00:20:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:20:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:20:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-28 00:20:34,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2024-06-28 00:20:34,393 INFO L175 Difference]: Start difference. First operand has 305 places, 479 transitions, 7343 flow. Second operand 9 states and 158 transitions. [2024-06-28 00:20:34,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 511 transitions, 8692 flow [2024-06-28 00:20:35,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 511 transitions, 8421 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-28 00:20:35,052 INFO L231 Difference]: Finished difference. Result has 307 places, 479 transitions, 7343 flow [2024-06-28 00:20:35,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7072, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7343, PETRI_PLACES=307, PETRI_TRANSITIONS=479} [2024-06-28 00:20:35,053 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places. [2024-06-28 00:20:35,053 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 479 transitions, 7343 flow [2024-06-28 00:20:35,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:35,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:35,053 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, 1] [2024-06-28 00:20:35,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 00:20:35,053 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:35,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1131538029, now seen corresponding path program 7 times [2024-06-28 00:20:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365934071] [2024-06-28 00:20:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:42,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-06-28 00:20:42,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:42,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365934071] [2024-06-28 00:20:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365934071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299660922] [2024-06-28 00:20:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:42,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:42,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:20:42,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 479 transitions, 7343 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:42,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:42,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:20:42,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:44,222 INFO L124 PetriNetUnfolderBase]: 3067/5012 cut-off events. [2024-06-28 00:20:44,222 INFO L125 PetriNetUnfolderBase]: For 249997/250020 co-relation queries the response was YES. [2024-06-28 00:20:44,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38130 conditions, 5012 events. 3067/5012 cut-off events. For 249997/250020 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 30815 event pairs, 628 based on Foata normal form. 14/5019 useless extension candidates. Maximal degree in co-relation 38000. Up to 4554 conditions per place. [2024-06-28 00:20:44,282 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 419 selfloop transitions, 81 changer transitions 0/505 dead transitions. [2024-06-28 00:20:44,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 505 transitions, 8440 flow [2024-06-28 00:20:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:20:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:20:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 00:20:44,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2024-06-28 00:20:44,283 INFO L175 Difference]: Start difference. First operand has 307 places, 479 transitions, 7343 flow. Second operand 8 states and 141 transitions. [2024-06-28 00:20:44,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 505 transitions, 8440 flow [2024-06-28 00:20:44,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 505 transitions, 8170 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 00:20:44,854 INFO L231 Difference]: Finished difference. Result has 307 places, 479 transitions, 7242 flow [2024-06-28 00:20:44,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7073, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7242, PETRI_PLACES=307, PETRI_TRANSITIONS=479} [2024-06-28 00:20:44,854 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 264 predicate places. [2024-06-28 00:20:44,855 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 479 transitions, 7242 flow [2024-06-28 00:20:44,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:44,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:44,855 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, 1] [2024-06-28 00:20:44,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 00:20:44,855 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:44,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1721432747, now seen corresponding path program 8 times [2024-06-28 00:20:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:44,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329146966] [2024-06-28 00:20:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:44,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329146966] [2024-06-28 00:20:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329146966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:52,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:52,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:52,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383304613] [2024-06-28 00:20:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:52,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:52,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:20:52,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 479 transitions, 7242 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:52,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:52,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:20:52,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:55,074 INFO L124 PetriNetUnfolderBase]: 3100/5066 cut-off events. [2024-06-28 00:20:55,074 INFO L125 PetriNetUnfolderBase]: For 258727/258750 co-relation queries the response was YES. [2024-06-28 00:20:55,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38594 conditions, 5066 events. 3100/5066 cut-off events. For 258727/258750 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 31242 event pairs, 624 based on Foata normal form. 14/5073 useless extension candidates. Maximal degree in co-relation 38463. Up to 4579 conditions per place. [2024-06-28 00:20:55,135 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 422 selfloop transitions, 102 changer transitions 0/529 dead transitions. [2024-06-28 00:20:55,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 529 transitions, 8890 flow [2024-06-28 00:20:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:20:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:20:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2024-06-28 00:20:55,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36813186813186816 [2024-06-28 00:20:55,137 INFO L175 Difference]: Start difference. First operand has 307 places, 479 transitions, 7242 flow. Second operand 13 states and 201 transitions. [2024-06-28 00:20:55,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 529 transitions, 8890 flow [2024-06-28 00:20:55,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 529 transitions, 8695 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 00:20:55,777 INFO L231 Difference]: Finished difference. Result has 317 places, 497 transitions, 7655 flow [2024-06-28 00:20:55,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7065, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7655, PETRI_PLACES=317, PETRI_TRANSITIONS=497} [2024-06-28 00:20:55,778 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places. [2024-06-28 00:20:55,778 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 497 transitions, 7655 flow [2024-06-28 00:20:55,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:55,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:55,778 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, 1] [2024-06-28 00:20:55,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 00:20:55,778 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:55,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:55,779 INFO L85 PathProgramCache]: Analyzing trace with hash 835901617, now seen corresponding path program 2 times [2024-06-28 00:20:55,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:55,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861854861] [2024-06-28 00:20:55,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:55,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:05,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-06-28 00:21:05,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:05,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861854861] [2024-06-28 00:21:05,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861854861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:05,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:05,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:05,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991012632] [2024-06-28 00:21:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:05,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:05,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:05,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:21:05,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 497 transitions, 7655 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:05,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:05,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:21:05,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:08,435 INFO L124 PetriNetUnfolderBase]: 3136/5124 cut-off events. [2024-06-28 00:21:08,436 INFO L125 PetriNetUnfolderBase]: For 271700/271723 co-relation queries the response was YES. [2024-06-28 00:21:08,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39258 conditions, 5124 events. 3136/5124 cut-off events. For 271700/271723 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 31647 event pairs, 617 based on Foata normal form. 15/5132 useless extension candidates. Maximal degree in co-relation 39124. Up to 4625 conditions per place. [2024-06-28 00:21:08,502 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 444 selfloop transitions, 86 changer transitions 0/535 dead transitions. [2024-06-28 00:21:08,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 535 transitions, 9099 flow [2024-06-28 00:21:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:21:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:21:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 184 transitions. [2024-06-28 00:21:08,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2024-06-28 00:21:08,503 INFO L175 Difference]: Start difference. First operand has 317 places, 497 transitions, 7655 flow. Second operand 12 states and 184 transitions. [2024-06-28 00:21:08,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 535 transitions, 9099 flow [2024-06-28 00:21:09,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 535 transitions, 8869 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-28 00:21:09,221 INFO L231 Difference]: Finished difference. Result has 322 places, 506 transitions, 7737 flow [2024-06-28 00:21:09,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7425, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7737, PETRI_PLACES=322, PETRI_TRANSITIONS=506} [2024-06-28 00:21:09,222 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-28 00:21:09,222 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 506 transitions, 7737 flow [2024-06-28 00:21:09,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:09,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:09,222 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, 1] [2024-06-28 00:21:09,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 00:21:09,223 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:09,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 835895665, now seen corresponding path program 9 times [2024-06-28 00:21:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542255956] [2024-06-28 00:21:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:19,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542255956] [2024-06-28 00:21:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542255956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254889043] [2024-06-28 00:21:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:19,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:19,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:21:19,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 506 transitions, 7737 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:19,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:19,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:21:19,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:21,825 INFO L124 PetriNetUnfolderBase]: 3133/5118 cut-off events. [2024-06-28 00:21:21,825 INFO L125 PetriNetUnfolderBase]: For 274823/274846 co-relation queries the response was YES. [2024-06-28 00:21:21,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39258 conditions, 5118 events. 3133/5118 cut-off events. For 274823/274846 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 31581 event pairs, 635 based on Foata normal form. 14/5125 useless extension candidates. Maximal degree in co-relation 39123. Up to 4626 conditions per place. [2024-06-28 00:21:21,891 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 428 selfloop transitions, 102 changer transitions 0/535 dead transitions. [2024-06-28 00:21:21,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 535 transitions, 8912 flow [2024-06-28 00:21:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:21:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:21:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-06-28 00:21:21,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-28 00:21:21,893 INFO L175 Difference]: Start difference. First operand has 322 places, 506 transitions, 7737 flow. Second operand 11 states and 175 transitions. [2024-06-28 00:21:21,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 535 transitions, 8912 flow [2024-06-28 00:21:22,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 535 transitions, 8805 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-28 00:21:22,552 INFO L231 Difference]: Finished difference. Result has 328 places, 506 transitions, 7840 flow [2024-06-28 00:21:22,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7630, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7840, PETRI_PLACES=328, PETRI_TRANSITIONS=506} [2024-06-28 00:21:22,553 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 285 predicate places. [2024-06-28 00:21:22,553 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 506 transitions, 7840 flow [2024-06-28 00:21:22,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:22,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:22,554 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, 1] [2024-06-28 00:21:22,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 00:21:22,554 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:22,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash 835896037, now seen corresponding path program 3 times [2024-06-28 00:21:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:22,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918606238] [2024-06-28 00:21:22,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:22,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:31,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-06-28 00:21:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918606238] [2024-06-28 00:21:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918606238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289194768] [2024-06-28 00:21:31,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:31,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:31,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:21:31,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 506 transitions, 7840 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:31,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:31,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:21:31,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:34,330 INFO L124 PetriNetUnfolderBase]: 3127/5106 cut-off events. [2024-06-28 00:21:34,330 INFO L125 PetriNetUnfolderBase]: For 281351/281374 co-relation queries the response was YES. [2024-06-28 00:21:34,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39403 conditions, 5106 events. 3127/5106 cut-off events. For 281351/281374 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 31475 event pairs, 620 based on Foata normal form. 15/5114 useless extension candidates. Maximal degree in co-relation 39266. Up to 4616 conditions per place. [2024-06-28 00:21:34,394 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 442 selfloop transitions, 86 changer transitions 0/533 dead transitions. [2024-06-28 00:21:34,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 533 transitions, 9033 flow [2024-06-28 00:21:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:21:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:21:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-28 00:21:34,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2024-06-28 00:21:34,396 INFO L175 Difference]: Start difference. First operand has 328 places, 506 transitions, 7840 flow. Second operand 10 states and 164 transitions. [2024-06-28 00:21:34,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 533 transitions, 9033 flow [2024-06-28 00:21:35,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 533 transitions, 8801 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-28 00:21:35,095 INFO L231 Difference]: Finished difference. Result has 328 places, 506 transitions, 7786 flow [2024-06-28 00:21:35,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7608, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7786, PETRI_PLACES=328, PETRI_TRANSITIONS=506} [2024-06-28 00:21:35,096 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 285 predicate places. [2024-06-28 00:21:35,096 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 506 transitions, 7786 flow [2024-06-28 00:21:35,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:35,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:35,096 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, 1] [2024-06-28 00:21:35,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 00:21:35,097 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:35,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash 70107341, now seen corresponding path program 4 times [2024-06-28 00:21:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:35,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924379756] [2024-06-28 00:21:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:42,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:42,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924379756] [2024-06-28 00:21:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924379756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:42,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895998399] [2024-06-28 00:21:42,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:42,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:42,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:42,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:21:42,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 506 transitions, 7786 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:42,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:42,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:21:42,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:45,512 INFO L124 PetriNetUnfolderBase]: 3188/5188 cut-off events. [2024-06-28 00:21:45,512 INFO L125 PetriNetUnfolderBase]: For 291436/291436 co-relation queries the response was YES. [2024-06-28 00:21:45,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40105 conditions, 5188 events. 3188/5188 cut-off events. For 291436/291436 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 32002 event pairs, 567 based on Foata normal form. 2/5187 useless extension candidates. Maximal degree in co-relation 39967. Up to 4374 conditions per place. [2024-06-28 00:21:45,578 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 364 selfloop transitions, 200 changer transitions 0/569 dead transitions. [2024-06-28 00:21:45,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 569 transitions, 9547 flow [2024-06-28 00:21:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-28 00:21:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-28 00:21:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 255 transitions. [2024-06-28 00:21:45,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3794642857142857 [2024-06-28 00:21:45,580 INFO L175 Difference]: Start difference. First operand has 328 places, 506 transitions, 7786 flow. Second operand 16 states and 255 transitions. [2024-06-28 00:21:45,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 569 transitions, 9547 flow [2024-06-28 00:21:46,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 569 transitions, 9375 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 00:21:46,369 INFO L231 Difference]: Finished difference. Result has 336 places, 525 transitions, 8279 flow [2024-06-28 00:21:46,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7614, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8279, PETRI_PLACES=336, PETRI_TRANSITIONS=525} [2024-06-28 00:21:46,370 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 293 predicate places. [2024-06-28 00:21:46,370 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 525 transitions, 8279 flow [2024-06-28 00:21:46,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:46,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:46,370 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, 1] [2024-06-28 00:21:46,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 00:21:46,370 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:46,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash 81069251, now seen corresponding path program 5 times [2024-06-28 00:21:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130311683] [2024-06-28 00:21:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:52,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:52,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130311683] [2024-06-28 00:21:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130311683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:52,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133210157] [2024-06-28 00:21:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:52,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:52,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:21:52,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 525 transitions, 8279 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:52,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:52,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:21:52,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:54,946 INFO L124 PetriNetUnfolderBase]: 3228/5252 cut-off events. [2024-06-28 00:21:54,946 INFO L125 PetriNetUnfolderBase]: For 301229/301229 co-relation queries the response was YES. [2024-06-28 00:21:54,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41044 conditions, 5252 events. 3228/5252 cut-off events. For 301229/301229 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 32459 event pairs, 562 based on Foata normal form. 2/5251 useless extension candidates. Maximal degree in co-relation 40905. Up to 4410 conditions per place. [2024-06-28 00:21:55,010 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 366 selfloop transitions, 205 changer transitions 0/576 dead transitions. [2024-06-28 00:21:55,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 576 transitions, 9982 flow [2024-06-28 00:21:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:21:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:21:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 214 transitions. [2024-06-28 00:21:55,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39194139194139194 [2024-06-28 00:21:55,012 INFO L175 Difference]: Start difference. First operand has 336 places, 525 transitions, 8279 flow. Second operand 13 states and 214 transitions. [2024-06-28 00:21:55,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 576 transitions, 9982 flow [2024-06-28 00:21:55,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 576 transitions, 9800 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-28 00:21:55,752 INFO L231 Difference]: Finished difference. Result has 347 places, 537 transitions, 8709 flow [2024-06-28 00:21:55,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8110, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8709, PETRI_PLACES=347, PETRI_TRANSITIONS=537} [2024-06-28 00:21:55,753 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 304 predicate places. [2024-06-28 00:21:55,753 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 537 transitions, 8709 flow [2024-06-28 00:21:55,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:55,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:55,753 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, 1] [2024-06-28 00:21:55,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 00:21:55,753 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:55,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 70107155, now seen corresponding path program 10 times [2024-06-28 00:21:55,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:55,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360188744] [2024-06-28 00:21:55,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360188744] [2024-06-28 00:22:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360188744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:02,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:22:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973575939] [2024-06-28 00:22:02,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:22:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:22:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:22:02,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:22:02,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 537 transitions, 8709 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:02,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:02,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:22:02,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:04,996 INFO L124 PetriNetUnfolderBase]: 3241/5280 cut-off events. [2024-06-28 00:22:04,996 INFO L125 PetriNetUnfolderBase]: For 312540/312540 co-relation queries the response was YES. [2024-06-28 00:22:05,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41610 conditions, 5280 events. 3241/5280 cut-off events. For 312540/312540 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 32741 event pairs, 598 based on Foata normal form. 1/5278 useless extension candidates. Maximal degree in co-relation 41468. Up to 4650 conditions per place. [2024-06-28 00:22:05,056 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 416 selfloop transitions, 159 changer transitions 0/580 dead transitions. [2024-06-28 00:22:05,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 580 transitions, 10329 flow [2024-06-28 00:22:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:22:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:22:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 222 transitions. [2024-06-28 00:22:05,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37755102040816324 [2024-06-28 00:22:05,058 INFO L175 Difference]: Start difference. First operand has 347 places, 537 transitions, 8709 flow. Second operand 14 states and 222 transitions. [2024-06-28 00:22:05,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 580 transitions, 10329 flow [2024-06-28 00:22:05,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 580 transitions, 9985 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-28 00:22:05,846 INFO L231 Difference]: Finished difference. Result has 352 places, 543 transitions, 8835 flow [2024-06-28 00:22:05,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8365, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8835, PETRI_PLACES=352, PETRI_TRANSITIONS=543} [2024-06-28 00:22:05,846 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 309 predicate places. [2024-06-28 00:22:05,847 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 543 transitions, 8835 flow [2024-06-28 00:22:05,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:05,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:05,847 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, 1] [2024-06-28 00:22:05,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 00:22:05,847 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:05,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:05,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1380906459, now seen corresponding path program 6 times [2024-06-28 00:22:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:05,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643799836] [2024-06-28 00:22:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643799836] [2024-06-28 00:22:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643799836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:11,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:22:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802794385] [2024-06-28 00:22:11,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:11,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:22:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:11,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:22:11,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:22:11,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:22:11,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 543 transitions, 8835 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:11,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:11,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:22:11,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:14,000 INFO L124 PetriNetUnfolderBase]: 3235/5264 cut-off events. [2024-06-28 00:22:14,000 INFO L125 PetriNetUnfolderBase]: For 318348/318348 co-relation queries the response was YES. [2024-06-28 00:22:14,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41459 conditions, 5264 events. 3235/5264 cut-off events. For 318348/318348 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32528 event pairs, 562 based on Foata normal form. 2/5263 useless extension candidates. Maximal degree in co-relation 41316. Up to 4423 conditions per place. [2024-06-28 00:22:14,060 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 369 selfloop transitions, 211 changer transitions 0/585 dead transitions. [2024-06-28 00:22:14,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 585 transitions, 10271 flow [2024-06-28 00:22:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 00:22:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 00:22:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 243 transitions. [2024-06-28 00:22:14,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-06-28 00:22:14,062 INFO L175 Difference]: Start difference. First operand has 352 places, 543 transitions, 8835 flow. Second operand 15 states and 243 transitions. [2024-06-28 00:22:14,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 585 transitions, 10271 flow [2024-06-28 00:22:14,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 585 transitions, 9945 flow, removed 37 selfloop flow, removed 9 redundant places. [2024-06-28 00:22:14,880 INFO L231 Difference]: Finished difference. Result has 358 places, 543 transitions, 8937 flow [2024-06-28 00:22:14,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8509, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8937, PETRI_PLACES=358, PETRI_TRANSITIONS=543} [2024-06-28 00:22:14,881 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 315 predicate places. [2024-06-28 00:22:14,881 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 543 transitions, 8937 flow [2024-06-28 00:22:14,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:14,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:14,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:14,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 00:22:14,881 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:14,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1369784961, now seen corresponding path program 1 times [2024-06-28 00:22:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:14,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441006501] [2024-06-28 00:22:14,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:14,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:25,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-06-28 00:22:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441006501] [2024-06-28 00:22:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441006501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:25,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:25,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:22:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314118852] [2024-06-28 00:22:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:25,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:22:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:25,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:22:25,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:22:25,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:22:25,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 543 transitions, 8937 flow. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:25,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:25,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:22:25,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:27,721 INFO L124 PetriNetUnfolderBase]: 3329/5420 cut-off events. [2024-06-28 00:22:27,721 INFO L125 PetriNetUnfolderBase]: For 338478/338484 co-relation queries the response was YES. [2024-06-28 00:22:27,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42714 conditions, 5420 events. 3329/5420 cut-off events. For 338478/338484 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 33711 event pairs, 562 based on Foata normal form. 7/5419 useless extension candidates. Maximal degree in co-relation 42570. Up to 4876 conditions per place. [2024-06-28 00:22:27,783 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 521 selfloop transitions, 65 changer transitions 0/591 dead transitions. [2024-06-28 00:22:27,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 591 transitions, 10567 flow [2024-06-28 00:22:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:22:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:22:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-06-28 00:22:27,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-28 00:22:27,785 INFO L175 Difference]: Start difference. First operand has 358 places, 543 transitions, 8937 flow. Second operand 11 states and 176 transitions. [2024-06-28 00:22:27,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 591 transitions, 10567 flow [2024-06-28 00:22:28,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 591 transitions, 10032 flow, removed 2 selfloop flow, removed 15 redundant places. [2024-06-28 00:22:28,731 INFO L231 Difference]: Finished difference. Result has 357 places, 560 transitions, 8890 flow [2024-06-28 00:22:28,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8430, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8890, PETRI_PLACES=357, PETRI_TRANSITIONS=560} [2024-06-28 00:22:28,732 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 314 predicate places. [2024-06-28 00:22:28,732 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 560 transitions, 8890 flow [2024-06-28 00:22:28,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:28,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:28,733 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, 1] [2024-06-28 00:22:28,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 00:22:28,733 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:28,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash -569150621, now seen corresponding path program 1 times [2024-06-28 00:22:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808817667] [2024-06-28 00:22:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:34,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:34,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808817667] [2024-06-28 00:22:34,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808817667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:34,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:34,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:22:34,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341164196] [2024-06-28 00:22:34,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:34,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:22:34,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:22:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:22:34,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:22:34,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 560 transitions, 8890 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:34,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:34,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:22:34,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:36,591 INFO L124 PetriNetUnfolderBase]: 3365/5470 cut-off events. [2024-06-28 00:22:36,591 INFO L125 PetriNetUnfolderBase]: For 354591/354591 co-relation queries the response was YES. [2024-06-28 00:22:36,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42886 conditions, 5470 events. 3365/5470 cut-off events. For 354591/354591 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 33999 event pairs, 578 based on Foata normal form. 10/5477 useless extension candidates. Maximal degree in co-relation 42738. Up to 4932 conditions per place. [2024-06-28 00:22:36,654 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 506 selfloop transitions, 80 changer transitions 0/591 dead transitions. [2024-06-28 00:22:36,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 591 transitions, 10232 flow [2024-06-28 00:22:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:22:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:22:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 00:22:36,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-28 00:22:36,656 INFO L175 Difference]: Start difference. First operand has 357 places, 560 transitions, 8890 flow. Second operand 9 states and 154 transitions. [2024-06-28 00:22:36,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 591 transitions, 10232 flow [2024-06-28 00:22:37,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 591 transitions, 10056 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-28 00:22:37,603 INFO L231 Difference]: Finished difference. Result has 361 places, 561 transitions, 8903 flow [2024-06-28 00:22:37,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8714, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8903, PETRI_PLACES=361, PETRI_TRANSITIONS=561} [2024-06-28 00:22:37,604 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 318 predicate places. [2024-06-28 00:22:37,604 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 561 transitions, 8903 flow [2024-06-28 00:22:37,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:37,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:37,604 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, 1] [2024-06-28 00:22:37,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 00:22:37,604 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:37,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1810889663, now seen corresponding path program 11 times [2024-06-28 00:22:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417519487] [2024-06-28 00:22:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:44,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417519487] [2024-06-28 00:22:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417519487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:44,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:22:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873781082] [2024-06-28 00:22:44,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:44,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:22:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:44,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:22:44,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:22:44,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:22:44,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 561 transitions, 8903 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:44,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:44,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:22:44,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:47,388 INFO L124 PetriNetUnfolderBase]: 3370/5494 cut-off events. [2024-06-28 00:22:47,388 INFO L125 PetriNetUnfolderBase]: For 346744/346807 co-relation queries the response was YES. [2024-06-28 00:22:47,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42943 conditions, 5494 events. 3370/5494 cut-off events. For 346744/346807 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 34366 event pairs, 702 based on Foata normal form. 46/5529 useless extension candidates. Maximal degree in co-relation 42796. Up to 4712 conditions per place. [2024-06-28 00:22:47,454 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 407 selfloop transitions, 191 changer transitions 0/603 dead transitions. [2024-06-28 00:22:47,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 603 transitions, 10552 flow [2024-06-28 00:22:47,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:22:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:22:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-28 00:22:47,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:22:47,456 INFO L175 Difference]: Start difference. First operand has 361 places, 561 transitions, 8903 flow. Second operand 11 states and 187 transitions. [2024-06-28 00:22:47,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 603 transitions, 10552 flow [2024-06-28 00:22:48,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 603 transitions, 10377 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 00:22:48,341 INFO L231 Difference]: Finished difference. Result has 366 places, 565 transitions, 9263 flow [2024-06-28 00:22:48,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8730, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9263, PETRI_PLACES=366, PETRI_TRANSITIONS=565} [2024-06-28 00:22:48,342 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 323 predicate places. [2024-06-28 00:22:48,342 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 565 transitions, 9263 flow [2024-06-28 00:22:48,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:48,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:48,342 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, 1] [2024-06-28 00:22:48,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 00:22:48,343 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:48,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:48,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1276728873, now seen corresponding path program 4 times [2024-06-28 00:22:48,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:48,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640252556] [2024-06-28 00:22:48,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:54,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:54,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640252556] [2024-06-28 00:22:54,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640252556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:54,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:54,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:22:54,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033474914] [2024-06-28 00:22:54,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:54,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:22:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:54,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:22:54,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:22:54,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:22:54,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 565 transitions, 9263 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:54,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:54,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:22:54,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:57,122 INFO L124 PetriNetUnfolderBase]: 3385/5515 cut-off events. [2024-06-28 00:22:57,122 INFO L125 PetriNetUnfolderBase]: For 359479/359542 co-relation queries the response was YES. [2024-06-28 00:22:57,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43553 conditions, 5515 events. 3385/5515 cut-off events. For 359479/359542 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 34495 event pairs, 698 based on Foata normal form. 47/5551 useless extension candidates. Maximal degree in co-relation 43403. Up to 4967 conditions per place. [2024-06-28 00:22:57,196 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 496 selfloop transitions, 94 changer transitions 0/595 dead transitions. [2024-06-28 00:22:57,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 595 transitions, 10748 flow [2024-06-28 00:22:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:22:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:22:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-28 00:22:57,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-28 00:22:57,198 INFO L175 Difference]: Start difference. First operand has 366 places, 565 transitions, 9263 flow. Second operand 10 states and 158 transitions. [2024-06-28 00:22:57,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 595 transitions, 10748 flow [2024-06-28 00:22:58,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 595 transitions, 10231 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-28 00:22:58,299 INFO L231 Difference]: Finished difference. Result has 367 places, 571 transitions, 9029 flow [2024-06-28 00:22:58,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8754, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9029, PETRI_PLACES=367, PETRI_TRANSITIONS=571} [2024-06-28 00:22:58,299 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 324 predicate places. [2024-06-28 00:22:58,300 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 571 transitions, 9029 flow [2024-06-28 00:22:58,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:58,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:58,300 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, 1] [2024-06-28 00:22:58,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 00:22:58,300 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:58,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1276729245, now seen corresponding path program 12 times [2024-06-28 00:22:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695010807] [2024-06-28 00:22:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695010807] [2024-06-28 00:23:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695010807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:23:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931190912] [2024-06-28 00:23:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:04,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:23:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:23:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:23:04,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:23:04,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 571 transitions, 9029 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:04,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:04,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:23:04,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:08,274 INFO L124 PetriNetUnfolderBase]: 3390/5524 cut-off events. [2024-06-28 00:23:08,275 INFO L125 PetriNetUnfolderBase]: For 362239/362294 co-relation queries the response was YES. [2024-06-28 00:23:08,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43300 conditions, 5524 events. 3390/5524 cut-off events. For 362239/362294 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 34586 event pairs, 696 based on Foata normal form. 40/5553 useless extension candidates. Maximal degree in co-relation 43150. Up to 4736 conditions per place. [2024-06-28 00:23:08,347 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 411 selfloop transitions, 198 changer transitions 0/614 dead transitions. [2024-06-28 00:23:08,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 614 transitions, 10680 flow [2024-06-28 00:23:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:23:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:23:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-06-28 00:23:08,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-28 00:23:08,349 INFO L175 Difference]: Start difference. First operand has 367 places, 571 transitions, 9029 flow. Second operand 12 states and 203 transitions. [2024-06-28 00:23:08,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 614 transitions, 10680 flow [2024-06-28 00:23:09,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 614 transitions, 10400 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-28 00:23:09,454 INFO L231 Difference]: Finished difference. Result has 371 places, 574 transitions, 9196 flow [2024-06-28 00:23:09,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8749, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9196, PETRI_PLACES=371, PETRI_TRANSITIONS=574} [2024-06-28 00:23:09,454 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 328 predicate places. [2024-06-28 00:23:09,454 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 574 transitions, 9196 flow [2024-06-28 00:23:09,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:09,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:09,454 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, 1] [2024-06-28 00:23:09,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 00:23:09,455 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:09,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1874105139, now seen corresponding path program 5 times [2024-06-28 00:23:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834192753] [2024-06-28 00:23:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834192753] [2024-06-28 00:23:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834192753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:16,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:16,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:23:16,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457098513] [2024-06-28 00:23:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:16,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:23:16,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:16,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:23:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:23:16,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:23:16,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 574 transitions, 9196 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:16,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:16,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:23:16,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:18,760 INFO L124 PetriNetUnfolderBase]: 3400/5536 cut-off events. [2024-06-28 00:23:18,760 INFO L125 PetriNetUnfolderBase]: For 374354/374409 co-relation queries the response was YES. [2024-06-28 00:23:18,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43719 conditions, 5536 events. 3400/5536 cut-off events. For 374354/374409 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 34657 event pairs, 696 based on Foata normal form. 41/5566 useless extension candidates. Maximal degree in co-relation 43569. Up to 4999 conditions per place. [2024-06-28 00:23:18,834 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 497 selfloop transitions, 92 changer transitions 0/594 dead transitions. [2024-06-28 00:23:18,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 594 transitions, 10469 flow [2024-06-28 00:23:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:23:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:23:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 00:23:18,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-28 00:23:18,836 INFO L175 Difference]: Start difference. First operand has 371 places, 574 transitions, 9196 flow. Second operand 8 states and 132 transitions. [2024-06-28 00:23:18,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 594 transitions, 10469 flow [2024-06-28 00:23:20,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 594 transitions, 10109 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-28 00:23:20,026 INFO L231 Difference]: Finished difference. Result has 370 places, 577 transitions, 9075 flow [2024-06-28 00:23:20,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8836, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9075, PETRI_PLACES=370, PETRI_TRANSITIONS=577} [2024-06-28 00:23:20,026 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 327 predicate places. [2024-06-28 00:23:20,026 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 577 transitions, 9075 flow [2024-06-28 00:23:20,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:20,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:20,026 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, 1] [2024-06-28 00:23:20,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 00:23:20,027 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:20,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash -922050123, now seen corresponding path program 6 times [2024-06-28 00:23:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:20,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815625102] [2024-06-28 00:23:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815625102] [2024-06-28 00:23:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815625102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:25,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:25,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:23:25,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017383557] [2024-06-28 00:23:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:25,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:23:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:23:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:23:25,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:23:25,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 577 transitions, 9075 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:25,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:25,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:23:25,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:27,180 INFO L124 PetriNetUnfolderBase]: 3487/5666 cut-off events. [2024-06-28 00:23:27,180 INFO L125 PetriNetUnfolderBase]: For 389989/390000 co-relation queries the response was YES. [2024-06-28 00:23:27,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44741 conditions, 5666 events. 3487/5666 cut-off events. For 389989/390000 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 35467 event pairs, 640 based on Foata normal form. 12/5674 useless extension candidates. Maximal degree in co-relation 44590. Up to 5006 conditions per place. [2024-06-28 00:23:27,250 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 490 selfloop transitions, 145 changer transitions 0/640 dead transitions. [2024-06-28 00:23:27,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 640 transitions, 11001 flow [2024-06-28 00:23:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:23:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:23:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-06-28 00:23:27,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41774891774891776 [2024-06-28 00:23:27,252 INFO L175 Difference]: Start difference. First operand has 370 places, 577 transitions, 9075 flow. Second operand 11 states and 193 transitions. [2024-06-28 00:23:27,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 640 transitions, 11001 flow [2024-06-28 00:23:28,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 640 transitions, 10801 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-28 00:23:28,398 INFO L231 Difference]: Finished difference. Result has 380 places, 602 transitions, 9641 flow [2024-06-28 00:23:28,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8890, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9641, PETRI_PLACES=380, PETRI_TRANSITIONS=602} [2024-06-28 00:23:28,399 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 337 predicate places. [2024-06-28 00:23:28,399 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 602 transitions, 9641 flow [2024-06-28 00:23:28,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:28,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:28,399 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, 1] [2024-06-28 00:23:28,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 00:23:28,400 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:28,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash -922466205, now seen corresponding path program 13 times [2024-06-28 00:23:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675270664] [2024-06-28 00:23:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675270664] [2024-06-28 00:23:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675270664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:23:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440640300] [2024-06-28 00:23:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:35,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:23:35,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:23:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:23:35,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:23:35,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 602 transitions, 9641 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:35,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:35,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:23:35,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:38,392 INFO L124 PetriNetUnfolderBase]: 3492/5686 cut-off events. [2024-06-28 00:23:38,392 INFO L125 PetriNetUnfolderBase]: For 403343/403394 co-relation queries the response was YES. [2024-06-28 00:23:38,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45606 conditions, 5686 events. 3492/5686 cut-off events. For 403343/403394 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 35707 event pairs, 697 based on Foata normal form. 37/5712 useless extension candidates. Maximal degree in co-relation 45450. Up to 4868 conditions per place. [2024-06-28 00:23:38,468 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 416 selfloop transitions, 215 changer transitions 0/636 dead transitions. [2024-06-28 00:23:38,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 636 transitions, 11322 flow [2024-06-28 00:23:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:23:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:23:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-28 00:23:38,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-28 00:23:38,470 INFO L175 Difference]: Start difference. First operand has 380 places, 602 transitions, 9641 flow. Second operand 11 states and 182 transitions. [2024-06-28 00:23:38,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 636 transitions, 11322 flow [2024-06-28 00:23:39,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 636 transitions, 11117 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-28 00:23:39,764 INFO L231 Difference]: Finished difference. Result has 385 places, 605 transitions, 9917 flow [2024-06-28 00:23:39,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9436, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9917, PETRI_PLACES=385, PETRI_TRANSITIONS=605} [2024-06-28 00:23:39,764 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 342 predicate places. [2024-06-28 00:23:39,764 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 605 transitions, 9917 flow [2024-06-28 00:23:39,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:39,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:39,765 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, 1] [2024-06-28 00:23:39,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 00:23:39,765 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:39,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash -879259979, now seen corresponding path program 7 times [2024-06-28 00:23:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:39,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730084424] [2024-06-28 00:23:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730084424] [2024-06-28 00:23:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730084424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:23:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236540982] [2024-06-28 00:23:45,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:45,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:23:45,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:23:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:23:45,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:23:45,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 605 transitions, 9917 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:45,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:45,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:23:45,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:47,767 INFO L124 PetriNetUnfolderBase]: 3510/5700 cut-off events. [2024-06-28 00:23:47,767 INFO L125 PetriNetUnfolderBase]: For 415396/415407 co-relation queries the response was YES. [2024-06-28 00:23:47,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46417 conditions, 5700 events. 3510/5700 cut-off events. For 415396/415407 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 35745 event pairs, 627 based on Foata normal form. 12/5708 useless extension candidates. Maximal degree in co-relation 46260. Up to 5106 conditions per place. [2024-06-28 00:23:47,842 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 517 selfloop transitions, 124 changer transitions 0/646 dead transitions. [2024-06-28 00:23:47,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 646 transitions, 11825 flow [2024-06-28 00:23:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:23:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:23:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-28 00:23:47,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3852813852813853 [2024-06-28 00:23:47,843 INFO L175 Difference]: Start difference. First operand has 385 places, 605 transitions, 9917 flow. Second operand 11 states and 178 transitions. [2024-06-28 00:23:47,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 646 transitions, 11825 flow [2024-06-28 00:23:49,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 646 transitions, 11425 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-28 00:23:49,112 INFO L231 Difference]: Finished difference. Result has 391 places, 620 transitions, 10106 flow [2024-06-28 00:23:49,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9521, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10106, PETRI_PLACES=391, PETRI_TRANSITIONS=620} [2024-06-28 00:23:49,112 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 348 predicate places. [2024-06-28 00:23:49,112 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 620 transitions, 10106 flow [2024-06-28 00:23:49,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:49,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:49,113 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, 1] [2024-06-28 00:23:49,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 00:23:49,113 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:49,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1637628769, now seen corresponding path program 8 times [2024-06-28 00:23:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468586434] [2024-06-28 00:23:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:54,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-06-28 00:23:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468586434] [2024-06-28 00:23:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468586434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:54,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:54,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:23:54,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812946089] [2024-06-28 00:23:54,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:23:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:23:54,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:23:54,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:23:54,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 620 transitions, 10106 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:54,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:54,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:23:54,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:56,678 INFO L124 PetriNetUnfolderBase]: 3609/5852 cut-off events. [2024-06-28 00:23:56,678 INFO L125 PetriNetUnfolderBase]: For 465029/465080 co-relation queries the response was YES. [2024-06-28 00:23:56,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48890 conditions, 5852 events. 3609/5852 cut-off events. For 465029/465080 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 36720 event pairs, 654 based on Foata normal form. 30/5871 useless extension candidates. Maximal degree in co-relation 48730. Up to 5044 conditions per place. [2024-06-28 00:23:56,759 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 460 selfloop transitions, 216 changer transitions 0/681 dead transitions. [2024-06-28 00:23:56,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 681 transitions, 12718 flow [2024-06-28 00:23:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:23:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:23:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-28 00:23:56,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2024-06-28 00:23:56,761 INFO L175 Difference]: Start difference. First operand has 391 places, 620 transitions, 10106 flow. Second operand 10 states and 164 transitions. [2024-06-28 00:23:56,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 681 transitions, 12718 flow [2024-06-28 00:23:58,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 681 transitions, 12438 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-28 00:23:58,159 INFO L231 Difference]: Finished difference. Result has 397 places, 663 transitions, 11096 flow [2024-06-28 00:23:58,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9851, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11096, PETRI_PLACES=397, PETRI_TRANSITIONS=663} [2024-06-28 00:23:58,160 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 354 predicate places. [2024-06-28 00:23:58,160 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 663 transitions, 11096 flow [2024-06-28 00:23:58,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:58,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:58,160 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, 1] [2024-06-28 00:23:58,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 00:23:58,160 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:58,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1643406859, now seen corresponding path program 9 times [2024-06-28 00:23:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:58,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365074729] [2024-06-28 00:23:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365074729] [2024-06-28 00:24:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365074729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:24:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842711931] [2024-06-28 00:24:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:04,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:24:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:04,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:24:04,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:24:04,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:24:04,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 663 transitions, 11096 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:04,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:04,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:24:04,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:06,861 INFO L124 PetriNetUnfolderBase]: 3603/5842 cut-off events. [2024-06-28 00:24:06,861 INFO L125 PetriNetUnfolderBase]: For 480439/480490 co-relation queries the response was YES. [2024-06-28 00:24:06,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49760 conditions, 5842 events. 3603/5842 cut-off events. For 480439/480490 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 36684 event pairs, 657 based on Foata normal form. 29/5860 useless extension candidates. Maximal degree in co-relation 49597. Up to 5351 conditions per place. [2024-06-28 00:24:06,946 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 591 selfloop transitions, 80 changer transitions 0/676 dead transitions. [2024-06-28 00:24:06,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 676 transitions, 12484 flow [2024-06-28 00:24:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:24:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:24:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-28 00:24:06,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-28 00:24:06,948 INFO L175 Difference]: Start difference. First operand has 397 places, 663 transitions, 11096 flow. Second operand 9 states and 135 transitions. [2024-06-28 00:24:06,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 676 transitions, 12484 flow [2024-06-28 00:24:08,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 676 transitions, 12219 flow, removed 104 selfloop flow, removed 2 redundant places. [2024-06-28 00:24:08,691 INFO L231 Difference]: Finished difference. Result has 404 places, 663 transitions, 10999 flow [2024-06-28 00:24:08,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10831, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10999, PETRI_PLACES=404, PETRI_TRANSITIONS=663} [2024-06-28 00:24:08,692 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 361 predicate places. [2024-06-28 00:24:08,692 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 663 transitions, 10999 flow [2024-06-28 00:24:08,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:08,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:08,692 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, 1] [2024-06-28 00:24:08,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 00:24:08,692 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:08,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1643407231, now seen corresponding path program 14 times [2024-06-28 00:24:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:08,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493409978] [2024-06-28 00:24:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493409978] [2024-06-28 00:24:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493409978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:24:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311561197] [2024-06-28 00:24:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:15,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:24:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:15,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:24:15,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:24:15,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:24:15,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 663 transitions, 10999 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:15,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:15,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:24:15,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:18,269 INFO L124 PetriNetUnfolderBase]: 3600/5838 cut-off events. [2024-06-28 00:24:18,270 INFO L125 PetriNetUnfolderBase]: For 481178/481229 co-relation queries the response was YES. [2024-06-28 00:24:18,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49226 conditions, 5838 events. 3600/5838 cut-off events. For 481178/481229 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 36607 event pairs, 657 based on Foata normal form. 37/5864 useless extension candidates. Maximal degree in co-relation 49061. Up to 5201 conditions per place. [2024-06-28 00:24:18,357 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 527 selfloop transitions, 152 changer transitions 0/684 dead transitions. [2024-06-28 00:24:18,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 684 transitions, 12569 flow [2024-06-28 00:24:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:24:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:24:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-28 00:24:18,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-28 00:24:18,359 INFO L175 Difference]: Start difference. First operand has 404 places, 663 transitions, 10999 flow. Second operand 11 states and 168 transitions. [2024-06-28 00:24:18,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 684 transitions, 12569 flow [2024-06-28 00:24:19,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 684 transitions, 12373 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 00:24:20,000 INFO L231 Difference]: Finished difference. Result has 408 places, 663 transitions, 11113 flow [2024-06-28 00:24:20,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10803, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11113, PETRI_PLACES=408, PETRI_TRANSITIONS=663} [2024-06-28 00:24:20,001 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 365 predicate places. [2024-06-28 00:24:20,001 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 663 transitions, 11113 flow [2024-06-28 00:24:20,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:20,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:20,002 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, 1] [2024-06-28 00:24:20,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 00:24:20,002 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:20,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1637866105, now seen corresponding path program 7 times [2024-06-28 00:24:20,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:20,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738728797] [2024-06-28 00:24:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:25,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:25,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738728797] [2024-06-28 00:24:25,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738728797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:25,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:25,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:24:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837040308] [2024-06-28 00:24:25,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:25,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:24:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:24:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:24:26,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:24:26,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 663 transitions, 11113 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:26,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:26,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:24:26,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:28,579 INFO L124 PetriNetUnfolderBase]: 3660/5921 cut-off events. [2024-06-28 00:24:28,579 INFO L125 PetriNetUnfolderBase]: For 498009/498012 co-relation queries the response was YES. [2024-06-28 00:24:28,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50167 conditions, 5921 events. 3660/5921 cut-off events. For 498009/498012 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 37116 event pairs, 581 based on Foata normal form. 5/5922 useless extension candidates. Maximal degree in co-relation 50001. Up to 5243 conditions per place. [2024-06-28 00:24:28,665 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 556 selfloop transitions, 188 changer transitions 0/749 dead transitions. [2024-06-28 00:24:28,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 749 transitions, 13655 flow [2024-06-28 00:24:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:24:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:24:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 197 transitions. [2024-06-28 00:24:28,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39087301587301587 [2024-06-28 00:24:28,667 INFO L175 Difference]: Start difference. First operand has 408 places, 663 transitions, 11113 flow. Second operand 12 states and 197 transitions. [2024-06-28 00:24:28,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 749 transitions, 13655 flow [2024-06-28 00:24:30,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 749 transitions, 13353 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-28 00:24:30,280 INFO L231 Difference]: Finished difference. Result has 413 places, 720 transitions, 12201 flow [2024-06-28 00:24:30,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10811, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12201, PETRI_PLACES=413, PETRI_TRANSITIONS=720} [2024-06-28 00:24:30,280 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 370 predicate places. [2024-06-28 00:24:30,280 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 720 transitions, 12201 flow [2024-06-28 00:24:30,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:30,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:30,281 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, 1] [2024-06-28 00:24:30,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 00:24:30,281 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:30,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1637865919, now seen corresponding path program 10 times [2024-06-28 00:24:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611597177] [2024-06-28 00:24:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611597177] [2024-06-28 00:24:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611597177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:24:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726541722] [2024-06-28 00:24:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:36,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:24:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:24:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:24:36,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:24:36,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 720 transitions, 12201 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:36,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:36,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:24:36,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:39,603 INFO L124 PetriNetUnfolderBase]: 3664/5939 cut-off events. [2024-06-28 00:24:39,604 INFO L125 PetriNetUnfolderBase]: For 519041/519052 co-relation queries the response was YES. [2024-06-28 00:24:39,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51090 conditions, 5939 events. 3664/5939 cut-off events. For 519041/519052 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 37421 event pairs, 594 based on Foata normal form. 14/5949 useless extension candidates. Maximal degree in co-relation 50922. Up to 5305 conditions per place. [2024-06-28 00:24:39,682 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 574 selfloop transitions, 188 changer transitions 0/767 dead transitions. [2024-06-28 00:24:39,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 767 transitions, 14489 flow [2024-06-28 00:24:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-28 00:24:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-28 00:24:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 247 transitions. [2024-06-28 00:24:39,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36755952380952384 [2024-06-28 00:24:39,684 INFO L175 Difference]: Start difference. First operand has 413 places, 720 transitions, 12201 flow. Second operand 16 states and 247 transitions. [2024-06-28 00:24:39,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 767 transitions, 14489 flow [2024-06-28 00:24:41,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 767 transitions, 14252 flow, removed 92 selfloop flow, removed 4 redundant places. [2024-06-28 00:24:41,401 INFO L231 Difference]: Finished difference. Result has 426 places, 737 transitions, 12723 flow [2024-06-28 00:24:41,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11964, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12723, PETRI_PLACES=426, PETRI_TRANSITIONS=737} [2024-06-28 00:24:41,402 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 383 predicate places. [2024-06-28 00:24:41,402 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 737 transitions, 12723 flow [2024-06-28 00:24:41,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:41,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:41,403 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, 1] [2024-06-28 00:24:41,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-28 00:24:41,403 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:41,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash 567469877, now seen corresponding path program 15 times [2024-06-28 00:24:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290364843] [2024-06-28 00:24:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:24:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:24:48,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:24:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290364843] [2024-06-28 00:24:48,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290364843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:24:48,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:24:48,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:24:48,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129398419] [2024-06-28 00:24:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:24:48,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:24:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:24:48,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:24:48,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:24:48,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:24:48,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 737 transitions, 12723 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:48,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:24:48,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:24:48,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:24:51,999 INFO L124 PetriNetUnfolderBase]: 3661/5936 cut-off events. [2024-06-28 00:24:51,999 INFO L125 PetriNetUnfolderBase]: For 529806/529857 co-relation queries the response was YES. [2024-06-28 00:24:52,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51363 conditions, 5936 events. 3661/5936 cut-off events. For 529806/529857 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 37307 event pairs, 621 based on Foata normal form. 37/5962 useless extension candidates. Maximal degree in co-relation 51192. Up to 5288 conditions per place. [2024-06-28 00:24:52,088 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 600 selfloop transitions, 157 changer transitions 0/762 dead transitions. [2024-06-28 00:24:52,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 762 transitions, 14635 flow [2024-06-28 00:24:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:24:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:24:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2024-06-28 00:24:52,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36446886446886445 [2024-06-28 00:24:52,090 INFO L175 Difference]: Start difference. First operand has 426 places, 737 transitions, 12723 flow. Second operand 13 states and 199 transitions. [2024-06-28 00:24:52,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 762 transitions, 14635 flow [2024-06-28 00:24:54,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 762 transitions, 14398 flow, removed 74 selfloop flow, removed 8 redundant places. [2024-06-28 00:24:54,223 INFO L231 Difference]: Finished difference. Result has 431 places, 737 transitions, 12807 flow [2024-06-28 00:24:54,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12486, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12807, PETRI_PLACES=431, PETRI_TRANSITIONS=737} [2024-06-28 00:24:54,223 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 388 predicate places. [2024-06-28 00:24:54,223 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 737 transitions, 12807 flow [2024-06-28 00:24:54,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:24:54,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:24:54,224 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, 1] [2024-06-28 00:24:54,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-28 00:24:54,224 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:24:54,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:24:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1650758881, now seen corresponding path program 16 times [2024-06-28 00:24:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:24:54,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756657450] [2024-06-28 00:24:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:24:54,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:24:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:03,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:03,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756657450] [2024-06-28 00:25:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756657450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:03,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:25:03,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098392592] [2024-06-28 00:25:03,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:03,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:25:03,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:03,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:25:03,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:25:03,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:25:03,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 737 transitions, 12807 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:03,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:03,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:25:03,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:06,939 INFO L124 PetriNetUnfolderBase]: 3658/5930 cut-off events. [2024-06-28 00:25:06,940 INFO L125 PetriNetUnfolderBase]: For 537801/537852 co-relation queries the response was YES. [2024-06-28 00:25:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51556 conditions, 5930 events. 3658/5930 cut-off events. For 537801/537852 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 37315 event pairs, 627 based on Foata normal form. 37/5956 useless extension candidates. Maximal degree in co-relation 51383. Up to 5285 conditions per place. [2024-06-28 00:25:07,031 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 600 selfloop transitions, 156 changer transitions 0/761 dead transitions. [2024-06-28 00:25:07,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 761 transitions, 14549 flow [2024-06-28 00:25:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:25:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:25:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2024-06-28 00:25:07,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663003663003663 [2024-06-28 00:25:07,033 INFO L175 Difference]: Start difference. First operand has 431 places, 737 transitions, 12807 flow. Second operand 13 states and 200 transitions. [2024-06-28 00:25:07,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 761 transitions, 14549 flow [2024-06-28 00:25:09,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 761 transitions, 14192 flow, removed 28 selfloop flow, removed 11 redundant places. [2024-06-28 00:25:09,225 INFO L231 Difference]: Finished difference. Result has 433 places, 737 transitions, 12769 flow [2024-06-28 00:25:09,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12450, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12769, PETRI_PLACES=433, PETRI_TRANSITIONS=737} [2024-06-28 00:25:09,225 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 390 predicate places. [2024-06-28 00:25:09,225 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 737 transitions, 12769 flow [2024-06-28 00:25:09,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:09,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:09,226 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, 1] [2024-06-28 00:25:09,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-28 00:25:09,226 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:09,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1650752929, now seen corresponding path program 11 times [2024-06-28 00:25:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516767464] [2024-06-28 00:25:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:17,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:17,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516767464] [2024-06-28 00:25:17,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516767464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:17,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:17,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:25:17,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532999627] [2024-06-28 00:25:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:17,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:25:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:17,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:25:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:25:17,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:25:17,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 737 transitions, 12769 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:17,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:17,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:25:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:20,415 INFO L124 PetriNetUnfolderBase]: 3680/5967 cut-off events. [2024-06-28 00:25:20,415 INFO L125 PetriNetUnfolderBase]: For 563780/563831 co-relation queries the response was YES. [2024-06-28 00:25:20,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51833 conditions, 5967 events. 3680/5967 cut-off events. For 563780/563831 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 37617 event pairs, 635 based on Foata normal form. 33/5989 useless extension candidates. Maximal degree in co-relation 51662. Up to 5406 conditions per place. [2024-06-28 00:25:20,496 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 645 selfloop transitions, 120 changer transitions 0/770 dead transitions. [2024-06-28 00:25:20,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 770 transitions, 14840 flow [2024-06-28 00:25:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:25:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:25:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-28 00:25:20,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.354978354978355 [2024-06-28 00:25:20,497 INFO L175 Difference]: Start difference. First operand has 433 places, 737 transitions, 12769 flow. Second operand 11 states and 164 transitions. [2024-06-28 00:25:20,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 770 transitions, 14840 flow [2024-06-28 00:25:22,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 770 transitions, 14481 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-28 00:25:22,438 INFO L231 Difference]: Finished difference. Result has 432 places, 749 transitions, 12931 flow [2024-06-28 00:25:22,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12410, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12931, PETRI_PLACES=432, PETRI_TRANSITIONS=749} [2024-06-28 00:25:22,439 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 389 predicate places. [2024-06-28 00:25:22,439 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 749 transitions, 12931 flow [2024-06-28 00:25:22,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:22,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:22,439 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, 1] [2024-06-28 00:25:22,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-28 00:25:22,440 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:22,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1650758509, now seen corresponding path program 12 times [2024-06-28 00:25:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:22,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169890430] [2024-06-28 00:25:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169890430] [2024-06-28 00:25:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169890430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:25:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118896360] [2024-06-28 00:25:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:29,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:25:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:25:29,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:25:29,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:25:29,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 749 transitions, 12931 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:29,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:29,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:25:29,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:32,506 INFO L124 PetriNetUnfolderBase]: 3668/5951 cut-off events. [2024-06-28 00:25:32,507 INFO L125 PetriNetUnfolderBase]: For 552105/552156 co-relation queries the response was YES. [2024-06-28 00:25:32,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51374 conditions, 5951 events. 3668/5951 cut-off events. For 552105/552156 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 37527 event pairs, 632 based on Foata normal form. 31/5971 useless extension candidates. Maximal degree in co-relation 51202. Up to 5396 conditions per place. [2024-06-28 00:25:32,596 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 647 selfloop transitions, 120 changer transitions 0/772 dead transitions. [2024-06-28 00:25:32,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 772 transitions, 14604 flow [2024-06-28 00:25:32,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:25:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:25:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2024-06-28 00:25:32,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3443223443223443 [2024-06-28 00:25:32,599 INFO L175 Difference]: Start difference. First operand has 432 places, 749 transitions, 12931 flow. Second operand 13 states and 188 transitions. [2024-06-28 00:25:32,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 772 transitions, 14604 flow [2024-06-28 00:25:34,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 772 transitions, 14305 flow, removed 132 selfloop flow, removed 4 redundant places. [2024-06-28 00:25:34,723 INFO L231 Difference]: Finished difference. Result has 441 places, 749 transitions, 12898 flow [2024-06-28 00:25:34,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12644, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12898, PETRI_PLACES=441, PETRI_TRANSITIONS=749} [2024-06-28 00:25:34,723 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 398 predicate places. [2024-06-28 00:25:34,723 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 749 transitions, 12898 flow [2024-06-28 00:25:34,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:34,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:34,724 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, 1] [2024-06-28 00:25:34,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-28 00:25:34,724 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:34,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:34,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1185685709, now seen corresponding path program 8 times [2024-06-28 00:25:34,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:34,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346959810] [2024-06-28 00:25:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:34,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346959810] [2024-06-28 00:25:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346959810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:25:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523317808] [2024-06-28 00:25:40,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:40,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:25:40,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:40,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:25:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:25:40,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:25:40,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 749 transitions, 12898 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:40,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:40,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:25:40,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:43,446 INFO L124 PetriNetUnfolderBase]: 3678/5952 cut-off events. [2024-06-28 00:25:43,447 INFO L125 PetriNetUnfolderBase]: For 553043/553052 co-relation queries the response was YES. [2024-06-28 00:25:43,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51585 conditions, 5952 events. 3678/5952 cut-off events. For 553043/553052 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 37341 event pairs, 590 based on Foata normal form. 3/5944 useless extension candidates. Maximal degree in co-relation 51411. Up to 5280 conditions per place. [2024-06-28 00:25:43,527 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 630 selfloop transitions, 148 changer transitions 0/783 dead transitions. [2024-06-28 00:25:43,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 783 transitions, 14792 flow [2024-06-28 00:25:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-28 00:25:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-28 00:25:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 236 transitions. [2024-06-28 00:25:43,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2024-06-28 00:25:43,528 INFO L175 Difference]: Start difference. First operand has 441 places, 749 transitions, 12898 flow. Second operand 16 states and 236 transitions. [2024-06-28 00:25:43,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 783 transitions, 14792 flow [2024-06-28 00:25:45,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 783 transitions, 14443 flow, removed 13 selfloop flow, removed 15 redundant places. [2024-06-28 00:25:45,458 INFO L231 Difference]: Finished difference. Result has 442 places, 752 transitions, 12889 flow [2024-06-28 00:25:45,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12549, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12889, PETRI_PLACES=442, PETRI_TRANSITIONS=752} [2024-06-28 00:25:45,459 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 399 predicate places. [2024-06-28 00:25:45,459 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 752 transitions, 12889 flow [2024-06-28 00:25:45,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:45,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:45,459 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, 1] [2024-06-28 00:25:45,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-28 00:25:45,459 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:45,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2077552895, now seen corresponding path program 17 times [2024-06-28 00:25:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132455133] [2024-06-28 00:25:45,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:25:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:25:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:25:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132455133] [2024-06-28 00:25:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132455133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:25:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:25:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:25:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153856491] [2024-06-28 00:25:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:25:51,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:25:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:25:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:25:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:25:51,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:25:51,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 752 transitions, 12889 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:51,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:25:51,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:25:51,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:25:54,765 INFO L124 PetriNetUnfolderBase]: 3675/5952 cut-off events. [2024-06-28 00:25:54,766 INFO L125 PetriNetUnfolderBase]: For 555797/555806 co-relation queries the response was YES. [2024-06-28 00:25:54,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51655 conditions, 5952 events. 3675/5952 cut-off events. For 555797/555806 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 37373 event pairs, 582 based on Foata normal form. 2/5943 useless extension candidates. Maximal degree in co-relation 51480. Up to 5238 conditions per place. [2024-06-28 00:25:54,858 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 586 selfloop transitions, 186 changer transitions 0/777 dead transitions. [2024-06-28 00:25:54,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 777 transitions, 14671 flow [2024-06-28 00:25:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 00:25:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 00:25:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 222 transitions. [2024-06-28 00:25:54,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-28 00:25:54,860 INFO L175 Difference]: Start difference. First operand has 442 places, 752 transitions, 12889 flow. Second operand 15 states and 222 transitions. [2024-06-28 00:25:54,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 777 transitions, 14671 flow [2024-06-28 00:25:57,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 777 transitions, 14379 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-28 00:25:57,348 INFO L231 Difference]: Finished difference. Result has 449 places, 752 transitions, 12975 flow [2024-06-28 00:25:57,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12597, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12975, PETRI_PLACES=449, PETRI_TRANSITIONS=752} [2024-06-28 00:25:57,349 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 406 predicate places. [2024-06-28 00:25:57,349 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 752 transitions, 12975 flow [2024-06-28 00:25:57,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:25:57,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:25:57,349 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, 1] [2024-06-28 00:25:57,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-28 00:25:57,349 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:25:57,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:25:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1196647619, now seen corresponding path program 9 times [2024-06-28 00:25:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:25:57,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207629867] [2024-06-28 00:25:57,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:25:57,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:25:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:03,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207629867] [2024-06-28 00:26:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207629867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:03,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:26:03,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065064848] [2024-06-28 00:26:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:03,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:26:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:26:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:26:03,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:26:03,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 752 transitions, 12975 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:03,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:03,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:26:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:05,508 INFO L124 PetriNetUnfolderBase]: 3715/6008 cut-off events. [2024-06-28 00:26:05,508 INFO L125 PetriNetUnfolderBase]: For 571310/571319 co-relation queries the response was YES. [2024-06-28 00:26:05,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52169 conditions, 6008 events. 3715/6008 cut-off events. For 571310/571319 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 37690 event pairs, 590 based on Foata normal form. 3/6000 useless extension candidates. Maximal degree in co-relation 51994. Up to 5281 conditions per place. [2024-06-28 00:26:05,587 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 618 selfloop transitions, 173 changer transitions 0/796 dead transitions. [2024-06-28 00:26:05,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 796 transitions, 15102 flow [2024-06-28 00:26:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:26:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:26:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2024-06-28 00:26:05,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.373015873015873 [2024-06-28 00:26:05,588 INFO L175 Difference]: Start difference. First operand has 449 places, 752 transitions, 12975 flow. Second operand 12 states and 188 transitions. [2024-06-28 00:26:05,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 796 transitions, 15102 flow [2024-06-28 00:26:07,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 796 transitions, 14711 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-06-28 00:26:07,711 INFO L231 Difference]: Finished difference. Result has 449 places, 768 transitions, 13202 flow [2024-06-28 00:26:07,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12584, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13202, PETRI_PLACES=449, PETRI_TRANSITIONS=768} [2024-06-28 00:26:07,711 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 406 predicate places. [2024-06-28 00:26:07,711 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 768 transitions, 13202 flow [2024-06-28 00:26:07,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:07,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:07,712 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, 1] [2024-06-28 00:26:07,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-28 00:26:07,712 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:07,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:07,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1332164013, now seen corresponding path program 13 times [2024-06-28 00:26:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:07,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201791436] [2024-06-28 00:26:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:13,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201791436] [2024-06-28 00:26:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201791436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:13,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:13,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:26:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849687965] [2024-06-28 00:26:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:13,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:26:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:13,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:26:13,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:26:13,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:26:13,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 768 transitions, 13202 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:13,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:13,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:26:13,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:16,483 INFO L124 PetriNetUnfolderBase]: 3730/6046 cut-off events. [2024-06-28 00:26:16,483 INFO L125 PetriNetUnfolderBase]: For 587979/587996 co-relation queries the response was YES. [2024-06-28 00:26:16,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52562 conditions, 6046 events. 3730/6046 cut-off events. For 587979/587996 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 38207 event pairs, 623 based on Foata normal form. 16/6058 useless extension candidates. Maximal degree in co-relation 52385. Up to 5210 conditions per place. [2024-06-28 00:26:16,573 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 533 selfloop transitions, 265 changer transitions 0/803 dead transitions. [2024-06-28 00:26:16,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 803 transitions, 15376 flow [2024-06-28 00:26:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:26:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:26:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 216 transitions. [2024-06-28 00:26:16,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2024-06-28 00:26:16,576 INFO L175 Difference]: Start difference. First operand has 449 places, 768 transitions, 13202 flow. Second operand 14 states and 216 transitions. [2024-06-28 00:26:16,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 803 transitions, 15376 flow [2024-06-28 00:26:19,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 803 transitions, 15034 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-28 00:26:19,092 INFO L231 Difference]: Finished difference. Result has 454 places, 774 transitions, 13533 flow [2024-06-28 00:26:19,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12860, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13533, PETRI_PLACES=454, PETRI_TRANSITIONS=774} [2024-06-28 00:26:19,093 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 411 predicate places. [2024-06-28 00:26:19,093 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 774 transitions, 13533 flow [2024-06-28 00:26:19,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:19,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:19,093 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, 1] [2024-06-28 00:26:19,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-28 00:26:19,094 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:19,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1332164199, now seen corresponding path program 10 times [2024-06-28 00:26:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:19,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696578454] [2024-06-28 00:26:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696578454] [2024-06-28 00:26:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696578454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:26:25,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354434834] [2024-06-28 00:26:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:25,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:26:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:25,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:26:25,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:26:25,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:26:25,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 774 transitions, 13533 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:25,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:25,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:26:25,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:28,041 INFO L124 PetriNetUnfolderBase]: 3745/6067 cut-off events. [2024-06-28 00:26:28,041 INFO L125 PetriNetUnfolderBase]: For 596703/596720 co-relation queries the response was YES. [2024-06-28 00:26:28,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53134 conditions, 6067 events. 3745/6067 cut-off events. For 596703/596720 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 38346 event pairs, 607 based on Foata normal form. 15/6078 useless extension candidates. Maximal degree in co-relation 52956. Up to 5421 conditions per place. [2024-06-28 00:26:28,129 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 657 selfloop transitions, 157 changer transitions 0/819 dead transitions. [2024-06-28 00:26:28,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 819 transitions, 15684 flow [2024-06-28 00:26:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:26:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:26:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-06-28 00:26:28,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2024-06-28 00:26:28,131 INFO L175 Difference]: Start difference. First operand has 454 places, 774 transitions, 13533 flow. Second operand 11 states and 180 transitions. [2024-06-28 00:26:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 819 transitions, 15684 flow [2024-06-28 00:26:30,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 819 transitions, 15173 flow, removed 55 selfloop flow, removed 11 redundant places. [2024-06-28 00:26:30,470 INFO L231 Difference]: Finished difference. Result has 454 places, 795 transitions, 13816 flow [2024-06-28 00:26:30,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13048, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13816, PETRI_PLACES=454, PETRI_TRANSITIONS=795} [2024-06-28 00:26:30,471 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 411 predicate places. [2024-06-28 00:26:30,471 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 795 transitions, 13816 flow [2024-06-28 00:26:30,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:30,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:30,471 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, 1] [2024-06-28 00:26:30,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-28 00:26:30,471 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:30,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1196767775, now seen corresponding path program 14 times [2024-06-28 00:26:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777250517] [2024-06-28 00:26:30,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:30,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777250517] [2024-06-28 00:26:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777250517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:37,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:26:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73146746] [2024-06-28 00:26:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:37,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:26:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:37,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:26:37,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:26:37,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:26:37,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 795 transitions, 13816 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:37,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:37,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:26:37,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:40,630 INFO L124 PetriNetUnfolderBase]: 3736/6055 cut-off events. [2024-06-28 00:26:40,631 INFO L125 PetriNetUnfolderBase]: For 580099/580150 co-relation queries the response was YES. [2024-06-28 00:26:40,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52674 conditions, 6055 events. 3736/6055 cut-off events. For 580099/580150 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 38216 event pairs, 626 based on Foata normal form. 30/6074 useless extension candidates. Maximal degree in co-relation 52497. Up to 5475 conditions per place. [2024-06-28 00:26:40,725 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 680 selfloop transitions, 131 changer transitions 0/816 dead transitions. [2024-06-28 00:26:40,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 816 transitions, 15553 flow [2024-06-28 00:26:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:26:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:26:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-28 00:26:40,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36147186147186144 [2024-06-28 00:26:40,726 INFO L175 Difference]: Start difference. First operand has 454 places, 795 transitions, 13816 flow. Second operand 11 states and 167 transitions. [2024-06-28 00:26:40,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 816 transitions, 15553 flow [2024-06-28 00:26:43,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 816 transitions, 15191 flow, removed 72 selfloop flow, removed 9 redundant places. [2024-06-28 00:26:43,359 INFO L231 Difference]: Finished difference. Result has 456 places, 795 transitions, 13748 flow [2024-06-28 00:26:43,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13458, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13748, PETRI_PLACES=456, PETRI_TRANSITIONS=795} [2024-06-28 00:26:43,359 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 413 predicate places. [2024-06-28 00:26:43,359 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 795 transitions, 13748 flow [2024-06-28 00:26:43,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:43,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:43,360 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, 1] [2024-06-28 00:26:43,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-28 00:26:43,360 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:43,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash 696162341, now seen corresponding path program 11 times [2024-06-28 00:26:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:43,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118930067] [2024-06-28 00:26:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:48,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118930067] [2024-06-28 00:26:48,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118930067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:48,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:48,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:26:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065348903] [2024-06-28 00:26:48,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:48,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:26:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:26:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:26:48,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:26:48,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 795 transitions, 13748 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:48,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:48,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:26:48,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:26:51,026 INFO L124 PetriNetUnfolderBase]: 3730/6038 cut-off events. [2024-06-28 00:26:51,026 INFO L125 PetriNetUnfolderBase]: For 553893/553895 co-relation queries the response was YES. [2024-06-28 00:26:51,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52023 conditions, 6038 events. 3730/6038 cut-off events. For 553893/553895 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 38087 event pairs, 575 based on Foata normal form. 4/6039 useless extension candidates. Maximal degree in co-relation 51847. Up to 4976 conditions per place. [2024-06-28 00:26:51,121 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 531 selfloop transitions, 290 changer transitions 0/826 dead transitions. [2024-06-28 00:26:51,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 826 transitions, 15774 flow [2024-06-28 00:26:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:26:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:26:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-06-28 00:26:51,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2024-06-28 00:26:51,123 INFO L175 Difference]: Start difference. First operand has 456 places, 795 transitions, 13748 flow. Second operand 11 states and 184 transitions. [2024-06-28 00:26:51,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 826 transitions, 15774 flow [2024-06-28 00:26:53,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 826 transitions, 15237 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-06-28 00:26:53,544 INFO L231 Difference]: Finished difference. Result has 454 places, 798 transitions, 13902 flow [2024-06-28 00:26:53,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13213, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13902, PETRI_PLACES=454, PETRI_TRANSITIONS=798} [2024-06-28 00:26:53,545 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 411 predicate places. [2024-06-28 00:26:53,545 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 798 transitions, 13902 flow [2024-06-28 00:26:53,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:53,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:26:53,545 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, 1] [2024-06-28 00:26:53,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-28 00:26:53,546 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:26:53,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:26:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1185922859, now seen corresponding path program 12 times [2024-06-28 00:26:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:26:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690658529] [2024-06-28 00:26:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:26:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:26:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:26:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:26:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:26:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690658529] [2024-06-28 00:26:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690658529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:26:59,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:26:59,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:26:59,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175642808] [2024-06-28 00:26:59,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:26:59,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:26:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:26:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:26:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:26:59,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:26:59,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 798 transitions, 13902 flow. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:26:59,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:26:59,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:26:59,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:27:02,018 INFO L124 PetriNetUnfolderBase]: 3724/6026 cut-off events. [2024-06-28 00:27:02,018 INFO L125 PetriNetUnfolderBase]: For 549881/549890 co-relation queries the response was YES. [2024-06-28 00:27:02,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52273 conditions, 6026 events. 3724/6026 cut-off events. For 549881/549890 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 37920 event pairs, 575 based on Foata normal form. 3/6018 useless extension candidates. Maximal degree in co-relation 52097. Up to 5298 conditions per place. [2024-06-28 00:27:02,112 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 643 selfloop transitions, 180 changer transitions 0/828 dead transitions. [2024-06-28 00:27:02,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 828 transitions, 15675 flow [2024-06-28 00:27:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 00:27:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 00:27:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 214 transitions. [2024-06-28 00:27:02,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36394557823129253 [2024-06-28 00:27:02,113 INFO L175 Difference]: Start difference. First operand has 454 places, 798 transitions, 13902 flow. Second operand 14 states and 214 transitions. [2024-06-28 00:27:02,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 828 transitions, 15675 flow [2024-06-28 00:27:04,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 828 transitions, 15175 flow, removed 47 selfloop flow, removed 8 redundant places. [2024-06-28 00:27:04,282 INFO L231 Difference]: Finished difference. Result has 460 places, 798 transitions, 13769 flow [2024-06-28 00:27:04,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=13402, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13769, PETRI_PLACES=460, PETRI_TRANSITIONS=798} [2024-06-28 00:27:04,283 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 417 predicate places. [2024-06-28 00:27:04,283 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 798 transitions, 13769 flow [2024-06-28 00:27:04,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:27:04,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:27:04,283 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, 1] [2024-06-28 00:27:04,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-28 00:27:04,283 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:27:04,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:27:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash 696559079, now seen corresponding path program 2 times [2024-06-28 00:27:04,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:27:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224165999] [2024-06-28 00:27:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:27:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:27:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:27:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:27:10,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:27:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224165999] [2024-06-28 00:27:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224165999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:27:10,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:27:10,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:27:10,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235983398] [2024-06-28 00:27:10,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:27:10,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:27:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:27:10,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:27:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:27:10,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:27:10,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 798 transitions, 13769 flow. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:27:10,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:27:10,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:27:10,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15