./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:51:39,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:51:39,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:51:39,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:51:39,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:51:39,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:51:39,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:51:39,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:51:39,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:51:39,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:51:39,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:51:39,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:51:39,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:51:39,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:51:39,611 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:51:39,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:51:39,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:51:39,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:51:39,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:51:39,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:51:39,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:51:39,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:51:39,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:51:39,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:51:39,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:51:39,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:51:39,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:51:39,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:51:39,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:51:39,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:51:39,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:51:39,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:51:39,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:51:39,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:51:39,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:51:39,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:51:39,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:51:39,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:51:39,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:51:39,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:51:39,617 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:51:39,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:51:39,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:51:39,628 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:51:39,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:51:39,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:51:39,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:51:39,850 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:51:39,850 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:51:39,851 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 22:51:39,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:51:39,961 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:51:39,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:51:41,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:51:41,194 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:51:41,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:51:41,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26912397d/af3b8007a25c4b388f84214a4b0d2b55/FLAGd1d75a537 [2024-06-27 22:51:41,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26912397d/af3b8007a25c4b388f84214a4b0d2b55 [2024-06-27 22:51:41,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:51:41,230 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:51:41,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:51:41,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:51:41,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:51:41,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:51:39" (1/2) ... [2024-06-27 22:51:41,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a08511 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:51:41, skipping insertion in model container [2024-06-27 22:51:41,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:51:39" (1/2) ... [2024-06-27 22:51:41,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ac23ba5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:51:41, skipping insertion in model container [2024-06-27 22:51:41,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:51:41" (2/2) ... [2024-06-27 22:51:41,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a08511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41, skipping insertion in model container [2024-06-27 22:51:41,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:51:41" (2/2) ... [2024-06-27 22:51:41,240 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:51:41,259 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:51:41,262 INFO L97 edCorrectnessWitness]: Location invariant before [L811-L811] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:51:41,262 INFO L97 edCorrectnessWitness]: Location invariant before [L810-L810] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:51:41,262 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:51:41,262 INFO L106 edCorrectnessWitness]: ghost_update [L808-L808] multithreaded = 1; [2024-06-27 22:51:41,303 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:51:41,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-06-27 22:51:41,590 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:51:41,603 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:51:41,632 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:51:41,771 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:51:41,873 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:51:41,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41 WrapperNode [2024-06-27 22:51:41,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:51:41,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:51:41,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:51:41,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:51:41,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:41,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:41,949 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 109 [2024-06-27 22:51:41,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:51:41,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:51:41,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:51:41,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:51:41,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:41,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:41,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:41,995 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:51:42,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:42,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:42,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:42,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:42,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:42,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:42,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:51:42,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:51:42,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:51:42,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:51:42,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (1/1) ... [2024-06-27 22:51:42,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:51:42,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:51:42,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:51:42,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:51:42,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:51:42,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:51:42,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:51:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:51:42,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:51:42,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:51:42,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:51:42,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:51:42,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:51:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:51:42,132 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:51:42,241 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:51:42,242 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:51:42,661 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:51:42,661 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:51:42,777 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:51:42,777 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:51:42,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:51:42 BoogieIcfgContainer [2024-06-27 22:51:42,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:51:42,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:51:42,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:51:42,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:51:42,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:51:39" (1/4) ... [2024-06-27 22:51:42,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3155f2bd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:51:42, skipping insertion in model container [2024-06-27 22:51:42,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:51:41" (2/4) ... [2024-06-27 22:51:42,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3155f2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:51:42, skipping insertion in model container [2024-06-27 22:51:42,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:41" (3/4) ... [2024-06-27 22:51:42,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3155f2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:51:42, skipping insertion in model container [2024-06-27 22:51:42,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:51:42" (4/4) ... [2024-06-27 22:51:42,787 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:51:42,800 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:51:42,801 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:51:42,801 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:51:42,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:51:42,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:51:42,933 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 22:51:42,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:51:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-27 22:51:42,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:51:42,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-27 22:51:42,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:51:42,964 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;@71635d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:51:42,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:51:42,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:51:42,969 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:51:42,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:51:42,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:42,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:51:42,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:42,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash 307898557, now seen corresponding path program 1 times [2024-06-27 22:51:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544610110] [2024-06-27 22:51:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544610110] [2024-06-27 22:51:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544610110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:44,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:51:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125279085] [2024-06-27 22:51:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:44,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:51:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:51:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:51:44,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-27 22:51:44,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:44,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:44,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-27 22:51:44,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:44,494 INFO L124 PetriNetUnfolderBase]: 346/727 cut-off events. [2024-06-27 22:51:44,495 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 22:51:44,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 727 events. 346/727 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3861 event pairs, 268 based on Foata normal form. 35/709 useless extension candidates. Maximal degree in co-relation 1325. Up to 560 conditions per place. [2024-06-27 22:51:44,503 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 31 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2024-06-27 22:51:44,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 165 flow [2024-06-27 22:51:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:51:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:51:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 22:51:44,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-06-27 22:51:44,514 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 75 transitions. [2024-06-27 22:51:44,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 165 flow [2024-06-27 22:51:44,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:51:44,518 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 91 flow [2024-06-27 22:51:44,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-06-27 22:51:44,522 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-27 22:51:44,522 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 91 flow [2024-06-27 22:51:44,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:44,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:44,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:44,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:51:44,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:44,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash -461382653, now seen corresponding path program 1 times [2024-06-27 22:51:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:44,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564474433] [2024-06-27 22:51:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564474433] [2024-06-27 22:51:45,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564474433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:45,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:45,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:51:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226103195] [2024-06-27 22:51:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:45,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:51:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:51:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:51:45,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-27 22:51:45,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:45,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:45,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-27 22:51:45,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:45,588 INFO L124 PetriNetUnfolderBase]: 370/748 cut-off events. [2024-06-27 22:51:45,588 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-06-27 22:51:45,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 748 events. 370/748 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3981 event pairs, 171 based on Foata normal form. 4/703 useless extension candidates. Maximal degree in co-relation 1538. Up to 586 conditions per place. [2024-06-27 22:51:45,593 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 37 selfloop transitions, 6 changer transitions 1/54 dead transitions. [2024-06-27 22:51:45,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 228 flow [2024-06-27 22:51:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:51:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:51:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-27 22:51:45,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2024-06-27 22:51:45,596 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 91 flow. Second operand 4 states and 92 transitions. [2024-06-27 22:51:45,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 228 flow [2024-06-27 22:51:45,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:45,600 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 135 flow [2024-06-27 22:51:45,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-27 22:51:45,600 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-06-27 22:51:45,601 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 135 flow [2024-06-27 22:51:45,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:45,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:45,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:45,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:51:45,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:45,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1417959006, now seen corresponding path program 1 times [2024-06-27 22:51:45,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:45,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161809964] [2024-06-27 22:51:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:46,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:46,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161809964] [2024-06-27 22:51:46,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161809964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:46,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:51:46,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690989022] [2024-06-27 22:51:46,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:46,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:51:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:46,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:51:46,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:51:46,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:51:46,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:46,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:46,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:51:46,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:46,602 INFO L124 PetriNetUnfolderBase]: 444/879 cut-off events. [2024-06-27 22:51:46,602 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-06-27 22:51:46,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 879 events. 444/879 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4684 event pairs, 188 based on Foata normal form. 2/828 useless extension candidates. Maximal degree in co-relation 2061. Up to 709 conditions per place. [2024-06-27 22:51:46,607 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 48 selfloop transitions, 8 changer transitions 2/67 dead transitions. [2024-06-27 22:51:46,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 329 flow [2024-06-27 22:51:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-06-27 22:51:46,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2024-06-27 22:51:46,612 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 135 flow. Second operand 5 states and 108 transitions. [2024-06-27 22:51:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 329 flow [2024-06-27 22:51:46,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 320 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:46,616 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 192 flow [2024-06-27 22:51:46,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-27 22:51:46,617 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2024-06-27 22:51:46,617 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 192 flow [2024-06-27 22:51:46,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:46,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:46,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:46,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:51:46,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:46,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1782812486, now seen corresponding path program 1 times [2024-06-27 22:51:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:46,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963278338] [2024-06-27 22:51:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963278338] [2024-06-27 22:51:47,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963278338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:47,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:51:47,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288186971] [2024-06-27 22:51:47,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:47,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:51:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:47,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:51:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:51:47,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:51:47,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:47,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:47,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:51:47,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:47,943 INFO L124 PetriNetUnfolderBase]: 441/790 cut-off events. [2024-06-27 22:51:47,943 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2024-06-27 22:51:47,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 790 events. 441/790 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3935 event pairs, 104 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 2120. Up to 671 conditions per place. [2024-06-27 22:51:47,948 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 58 selfloop transitions, 15 changer transitions 3/85 dead transitions. [2024-06-27 22:51:47,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 452 flow [2024-06-27 22:51:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:51:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:51:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-27 22:51:47,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6238095238095238 [2024-06-27 22:51:47,949 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 192 flow. Second operand 6 states and 131 transitions. [2024-06-27 22:51:47,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 452 flow [2024-06-27 22:51:47,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 452 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:47,952 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 289 flow [2024-06-27 22:51:47,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-06-27 22:51:47,953 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2024-06-27 22:51:47,953 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 289 flow [2024-06-27 22:51:47,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:47,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:47,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:47,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:51:47,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:47,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1153927743, now seen corresponding path program 1 times [2024-06-27 22:51:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240808386] [2024-06-27 22:51:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240808386] [2024-06-27 22:51:49,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240808386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:49,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:49,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367236529] [2024-06-27 22:51:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:49,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:49,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:51:49,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 289 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:49,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:49,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:51:49,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:49,358 INFO L124 PetriNetUnfolderBase]: 437/782 cut-off events. [2024-06-27 22:51:49,358 INFO L125 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES. [2024-06-27 22:51:49,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 782 events. 437/782 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3878 event pairs, 65 based on Foata normal form. 4/761 useless extension candidates. Maximal degree in co-relation 2390. Up to 629 conditions per place. [2024-06-27 22:51:49,363 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 61 selfloop transitions, 16 changer transitions 4/90 dead transitions. [2024-06-27 22:51:49,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 531 flow [2024-06-27 22:51:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:51:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:51:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-06-27 22:51:49,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 22:51:49,364 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 289 flow. Second operand 7 states and 147 transitions. [2024-06-27 22:51:49,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 531 flow [2024-06-27 22:51:49,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 527 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:49,367 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 311 flow [2024-06-27 22:51:49,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2024-06-27 22:51:49,368 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2024-06-27 22:51:49,368 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 311 flow [2024-06-27 22:51:49,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:49,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:49,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:49,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:51:49,369 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:49,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1524948978, now seen corresponding path program 1 times [2024-06-27 22:51:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:49,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70455051] [2024-06-27 22:51:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:50,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70455051] [2024-06-27 22:51:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70455051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:50,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:50,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477159571] [2024-06-27 22:51:50,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:50,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:50,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:50,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:51:50,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 311 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:50,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:50,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:51:50,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:50,975 INFO L124 PetriNetUnfolderBase]: 558/1066 cut-off events. [2024-06-27 22:51:50,976 INFO L125 PetriNetUnfolderBase]: For 1697/1697 co-relation queries the response was YES. [2024-06-27 22:51:50,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 1066 events. 558/1066 cut-off events. For 1697/1697 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5677 event pairs, 277 based on Foata normal form. 1/1014 useless extension candidates. Maximal degree in co-relation 3240. Up to 840 conditions per place. [2024-06-27 22:51:50,982 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 59 selfloop transitions, 26 changer transitions 0/92 dead transitions. [2024-06-27 22:51:50,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 674 flow [2024-06-27 22:51:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:51:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:51:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-27 22:51:50,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:51:50,983 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 311 flow. Second operand 7 states and 126 transitions. [2024-06-27 22:51:50,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 674 flow [2024-06-27 22:51:50,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 621 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 22:51:50,987 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 493 flow [2024-06-27 22:51:50,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=493, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2024-06-27 22:51:50,987 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 31 predicate places. [2024-06-27 22:51:50,987 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 493 flow [2024-06-27 22:51:50,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:50,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:50,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:50,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:51:50,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:50,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -733553542, now seen corresponding path program 2 times [2024-06-27 22:51:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209070457] [2024-06-27 22:51:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:52,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:52,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209070457] [2024-06-27 22:51:52,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209070457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:52,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:52,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:52,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581906570] [2024-06-27 22:51:52,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:52,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:52,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:52,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:52,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:52,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:51:52,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 493 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:52,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:52,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:51:52,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:52,584 INFO L124 PetriNetUnfolderBase]: 595/1148 cut-off events. [2024-06-27 22:51:52,584 INFO L125 PetriNetUnfolderBase]: For 2378/2380 co-relation queries the response was YES. [2024-06-27 22:51:52,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 1148 events. 595/1148 cut-off events. For 2378/2380 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6127 event pairs, 161 based on Foata normal form. 3/1094 useless extension candidates. Maximal degree in co-relation 3837. Up to 862 conditions per place. [2024-06-27 22:51:52,590 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 76 selfloop transitions, 47 changer transitions 0/130 dead transitions. [2024-06-27 22:51:52,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 130 transitions, 1069 flow [2024-06-27 22:51:52,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:51:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:51:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 22:51:52,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:51:52,592 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 493 flow. Second operand 7 states and 133 transitions. [2024-06-27 22:51:52,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 130 transitions, 1069 flow [2024-06-27 22:51:52,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 130 transitions, 1029 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:52,598 INFO L231 Difference]: Finished difference. Result has 80 places, 105 transitions, 872 flow [2024-06-27 22:51:52,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=872, PETRI_PLACES=80, PETRI_TRANSITIONS=105} [2024-06-27 22:51:52,599 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2024-06-27 22:51:52,599 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 105 transitions, 872 flow [2024-06-27 22:51:52,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:52,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:52,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:52,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:51:52,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:52,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1696688814, now seen corresponding path program 3 times [2024-06-27 22:51:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:52,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781018376] [2024-06-27 22:51:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:53,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781018376] [2024-06-27 22:51:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781018376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:53,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393810438] [2024-06-27 22:51:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:54,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:51:54,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 105 transitions, 872 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:54,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:54,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:51:54,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:54,461 INFO L124 PetriNetUnfolderBase]: 635/1222 cut-off events. [2024-06-27 22:51:54,462 INFO L125 PetriNetUnfolderBase]: For 3845/3845 co-relation queries the response was YES. [2024-06-27 22:51:54,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4702 conditions, 1222 events. 635/1222 cut-off events. For 3845/3845 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6555 event pairs, 223 based on Foata normal form. 1/1166 useless extension candidates. Maximal degree in co-relation 4661. Up to 901 conditions per place. [2024-06-27 22:51:54,469 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 79 selfloop transitions, 72 changer transitions 0/158 dead transitions. [2024-06-27 22:51:54,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 158 transitions, 1586 flow [2024-06-27 22:51:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:51:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:51:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 22:51:54,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2024-06-27 22:51:54,471 INFO L175 Difference]: Start difference. First operand has 80 places, 105 transitions, 872 flow. Second operand 8 states and 143 transitions. [2024-06-27 22:51:54,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 158 transitions, 1586 flow [2024-06-27 22:51:54,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 158 transitions, 1539 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:54,480 INFO L231 Difference]: Finished difference. Result has 90 places, 135 transitions, 1379 flow [2024-06-27 22:51:54,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1379, PETRI_PLACES=90, PETRI_TRANSITIONS=135} [2024-06-27 22:51:54,483 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 51 predicate places. [2024-06-27 22:51:54,483 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 135 transitions, 1379 flow [2024-06-27 22:51:54,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:54,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:54,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:54,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:51:54,484 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:54,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash 493346010, now seen corresponding path program 4 times [2024-06-27 22:51:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:54,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882423483] [2024-06-27 22:51:54,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:54,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882423483] [2024-06-27 22:51:55,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882423483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:55,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:55,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:55,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310995669] [2024-06-27 22:51:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:55,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:55,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:51:55,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 135 transitions, 1379 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:55,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:55,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:51:55,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:56,225 INFO L124 PetriNetUnfolderBase]: 641/1229 cut-off events. [2024-06-27 22:51:56,226 INFO L125 PetriNetUnfolderBase]: For 4646/4646 co-relation queries the response was YES. [2024-06-27 22:51:56,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5165 conditions, 1229 events. 641/1229 cut-off events. For 4646/4646 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6623 event pairs, 233 based on Foata normal form. 1/1173 useless extension candidates. Maximal degree in co-relation 5118. Up to 982 conditions per place. [2024-06-27 22:51:56,233 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 121 selfloop transitions, 37 changer transitions 0/165 dead transitions. [2024-06-27 22:51:56,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 165 transitions, 1878 flow [2024-06-27 22:51:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:51:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:51:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 22:51:56,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-27 22:51:56,237 INFO L175 Difference]: Start difference. First operand has 90 places, 135 transitions, 1379 flow. Second operand 8 states and 137 transitions. [2024-06-27 22:51:56,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 165 transitions, 1878 flow [2024-06-27 22:51:56,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 165 transitions, 1794 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:51:56,249 INFO L231 Difference]: Finished difference. Result has 96 places, 145 transitions, 1517 flow [2024-06-27 22:51:56,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1517, PETRI_PLACES=96, PETRI_TRANSITIONS=145} [2024-06-27 22:51:56,250 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 57 predicate places. [2024-06-27 22:51:56,250 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 145 transitions, 1517 flow [2024-06-27 22:51:56,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:56,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:56,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:56,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:51:56,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:56,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1107575986, now seen corresponding path program 5 times [2024-06-27 22:51:56,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119275229] [2024-06-27 22:51:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:56,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:57,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119275229] [2024-06-27 22:51:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119275229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:57,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337973208] [2024-06-27 22:51:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:57,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:51:57,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 145 transitions, 1517 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:57,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:57,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:51:57,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:57,797 INFO L124 PetriNetUnfolderBase]: 669/1275 cut-off events. [2024-06-27 22:51:57,798 INFO L125 PetriNetUnfolderBase]: For 5438/5438 co-relation queries the response was YES. [2024-06-27 22:51:57,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 1275 events. 669/1275 cut-off events. For 5438/5438 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6878 event pairs, 256 based on Foata normal form. 1/1217 useless extension candidates. Maximal degree in co-relation 5447. Up to 1017 conditions per place. [2024-06-27 22:51:57,806 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 126 selfloop transitions, 45 changer transitions 0/178 dead transitions. [2024-06-27 22:51:57,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 178 transitions, 2154 flow [2024-06-27 22:51:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:51:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:51:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-27 22:51:57,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-06-27 22:51:57,808 INFO L175 Difference]: Start difference. First operand has 96 places, 145 transitions, 1517 flow. Second operand 7 states and 122 transitions. [2024-06-27 22:51:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 178 transitions, 2154 flow [2024-06-27 22:51:57,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 178 transitions, 2016 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 22:51:57,820 INFO L231 Difference]: Finished difference. Result has 99 places, 162 transitions, 1744 flow [2024-06-27 22:51:57,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1744, PETRI_PLACES=99, PETRI_TRANSITIONS=162} [2024-06-27 22:51:57,821 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2024-06-27 22:51:57,821 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 162 transitions, 1744 flow [2024-06-27 22:51:57,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:57,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:57,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:57,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:51:57,822 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:57,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 560613566, now seen corresponding path program 1 times [2024-06-27 22:51:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:57,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861581604] [2024-06-27 22:51:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:58,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:58,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861581604] [2024-06-27 22:51:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861581604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800538598] [2024-06-27 22:51:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:58,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:58,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:51:58,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 162 transitions, 1744 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:58,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:58,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:51:58,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:59,344 INFO L124 PetriNetUnfolderBase]: 675/1288 cut-off events. [2024-06-27 22:51:59,345 INFO L125 PetriNetUnfolderBase]: For 5674/5674 co-relation queries the response was YES. [2024-06-27 22:51:59,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5541 conditions, 1288 events. 675/1288 cut-off events. For 5674/5674 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6993 event pairs, 258 based on Foata normal form. 2/1233 useless extension candidates. Maximal degree in co-relation 5491. Up to 1044 conditions per place. [2024-06-27 22:51:59,354 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 157 selfloop transitions, 17 changer transitions 1/182 dead transitions. [2024-06-27 22:51:59,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 182 transitions, 2182 flow [2024-06-27 22:51:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:51:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:51:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-27 22:51:59,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-27 22:51:59,356 INFO L175 Difference]: Start difference. First operand has 99 places, 162 transitions, 1744 flow. Second operand 7 states and 115 transitions. [2024-06-27 22:51:59,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 182 transitions, 2182 flow [2024-06-27 22:51:59,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 182 transitions, 2095 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 22:51:59,372 INFO L231 Difference]: Finished difference. Result has 103 places, 167 transitions, 1750 flow [2024-06-27 22:51:59,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1750, PETRI_PLACES=103, PETRI_TRANSITIONS=167} [2024-06-27 22:51:59,373 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 64 predicate places. [2024-06-27 22:51:59,373 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 167 transitions, 1750 flow [2024-06-27 22:51:59,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:59,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:59,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:59,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:51:59,374 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:59,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2142688306, now seen corresponding path program 6 times [2024-06-27 22:51:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:59,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93696534] [2024-06-27 22:51:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93696534] [2024-06-27 22:52:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93696534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:52:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960294871] [2024-06-27 22:52:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:00,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:52:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:52:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:52:00,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:00,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 167 transitions, 1750 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:00,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:00,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:00,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:00,747 INFO L124 PetriNetUnfolderBase]: 673/1285 cut-off events. [2024-06-27 22:52:00,747 INFO L125 PetriNetUnfolderBase]: For 5990/5990 co-relation queries the response was YES. [2024-06-27 22:52:00,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 1285 events. 673/1285 cut-off events. For 5990/5990 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6990 event pairs, 252 based on Foata normal form. 1/1229 useless extension candidates. Maximal degree in co-relation 5566. Up to 1040 conditions per place. [2024-06-27 22:52:00,755 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 139 selfloop transitions, 34 changer transitions 0/180 dead transitions. [2024-06-27 22:52:00,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 180 transitions, 2145 flow [2024-06-27 22:52:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:52:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:52:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 22:52:00,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-27 22:52:00,756 INFO L175 Difference]: Start difference. First operand has 103 places, 167 transitions, 1750 flow. Second operand 6 states and 106 transitions. [2024-06-27 22:52:00,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 180 transitions, 2145 flow [2024-06-27 22:52:00,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 180 transitions, 2095 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 22:52:00,769 INFO L231 Difference]: Finished difference. Result has 105 places, 167 transitions, 1789 flow [2024-06-27 22:52:00,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1789, PETRI_PLACES=105, PETRI_TRANSITIONS=167} [2024-06-27 22:52:00,770 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 66 predicate places. [2024-06-27 22:52:00,770 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 1789 flow [2024-06-27 22:52:00,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:00,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:00,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:00,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:52:00,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:00,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1616475852, now seen corresponding path program 1 times [2024-06-27 22:52:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603046283] [2024-06-27 22:52:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:00,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-27 22:52:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603046283] [2024-06-27 22:52:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603046283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:52:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152546830] [2024-06-27 22:52:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:00,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:52:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:52:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:52:01,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-27 22:52:01,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 167 transitions, 1789 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:01,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:01,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-27 22:52:01,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:01,159 INFO L124 PetriNetUnfolderBase]: 422/919 cut-off events. [2024-06-27 22:52:01,159 INFO L125 PetriNetUnfolderBase]: For 4643/4678 co-relation queries the response was YES. [2024-06-27 22:52:01,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 919 events. 422/919 cut-off events. For 4643/4678 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5346 event pairs, 118 based on Foata normal form. 27/880 useless extension candidates. Maximal degree in co-relation 4012. Up to 558 conditions per place. [2024-06-27 22:52:01,170 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 114 selfloop transitions, 9 changer transitions 0/176 dead transitions. [2024-06-27 22:52:01,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 176 transitions, 2069 flow [2024-06-27 22:52:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:52:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:52:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-27 22:52:01,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-06-27 22:52:01,171 INFO L175 Difference]: Start difference. First operand has 105 places, 167 transitions, 1789 flow. Second operand 3 states and 79 transitions. [2024-06-27 22:52:01,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 176 transitions, 2069 flow [2024-06-27 22:52:01,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 176 transitions, 2008 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 22:52:01,183 INFO L231 Difference]: Finished difference. Result has 103 places, 166 transitions, 1742 flow [2024-06-27 22:52:01,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1742, PETRI_PLACES=103, PETRI_TRANSITIONS=166} [2024-06-27 22:52:01,184 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 64 predicate places. [2024-06-27 22:52:01,184 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 166 transitions, 1742 flow [2024-06-27 22:52:01,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:01,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:01,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:01,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:52:01,185 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:01,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1265322152, now seen corresponding path program 1 times [2024-06-27 22:52:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703972553] [2024-06-27 22:52:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703972553] [2024-06-27 22:52:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703972553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:02,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:02,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420051045] [2024-06-27 22:52:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:02,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:02,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:02,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:02,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:02,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:02,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 166 transitions, 1742 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:02,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:02,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:02,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:03,186 INFO L124 PetriNetUnfolderBase]: 679/1295 cut-off events. [2024-06-27 22:52:03,187 INFO L125 PetriNetUnfolderBase]: For 6314/6314 co-relation queries the response was YES. [2024-06-27 22:52:03,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5698 conditions, 1295 events. 679/1295 cut-off events. For 6314/6314 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6988 event pairs, 200 based on Foata normal form. 1/1253 useless extension candidates. Maximal degree in co-relation 5647. Up to 837 conditions per place. [2024-06-27 22:52:03,194 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 115 selfloop transitions, 89 changer transitions 7/218 dead transitions. [2024-06-27 22:52:03,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 218 transitions, 2416 flow [2024-06-27 22:52:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:52:03,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2024-06-27 22:52:03,195 INFO L175 Difference]: Start difference. First operand has 103 places, 166 transitions, 1742 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:52:03,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 218 transitions, 2416 flow [2024-06-27 22:52:03,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 218 transitions, 2396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:52:03,209 INFO L231 Difference]: Finished difference. Result has 113 places, 180 transitions, 2119 flow [2024-06-27 22:52:03,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2119, PETRI_PLACES=113, PETRI_TRANSITIONS=180} [2024-06-27 22:52:03,210 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2024-06-27 22:52:03,210 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 180 transitions, 2119 flow [2024-06-27 22:52:03,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:03,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:03,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:03,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:52:03,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:03,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash 560882925, now seen corresponding path program 1 times [2024-06-27 22:52:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:03,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782231074] [2024-06-27 22:52:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782231074] [2024-06-27 22:52:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782231074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:05,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:05,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930522259] [2024-06-27 22:52:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:05,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:05,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 180 transitions, 2119 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:05,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:05,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:05,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:05,491 INFO L124 PetriNetUnfolderBase]: 594/1168 cut-off events. [2024-06-27 22:52:05,491 INFO L125 PetriNetUnfolderBase]: For 7334/7334 co-relation queries the response was YES. [2024-06-27 22:52:05,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5696 conditions, 1168 events. 594/1168 cut-off events. For 7334/7334 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6365 event pairs, 206 based on Foata normal form. 2/1125 useless extension candidates. Maximal degree in co-relation 5640. Up to 904 conditions per place. [2024-06-27 22:52:05,500 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 174 selfloop transitions, 16 changer transitions 0/197 dead transitions. [2024-06-27 22:52:05,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 197 transitions, 2557 flow [2024-06-27 22:52:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:52:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:52:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-27 22:52:05,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 22:52:05,501 INFO L175 Difference]: Start difference. First operand has 113 places, 180 transitions, 2119 flow. Second operand 7 states and 112 transitions. [2024-06-27 22:52:05,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 197 transitions, 2557 flow [2024-06-27 22:52:05,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 197 transitions, 2533 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-27 22:52:05,519 INFO L231 Difference]: Finished difference. Result has 118 places, 180 transitions, 2132 flow [2024-06-27 22:52:05,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2132, PETRI_PLACES=118, PETRI_TRANSITIONS=180} [2024-06-27 22:52:05,520 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 79 predicate places. [2024-06-27 22:52:05,520 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 180 transitions, 2132 flow [2024-06-27 22:52:05,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:05,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:05,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:05,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:52:05,521 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:05,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1604718054, now seen corresponding path program 2 times [2024-06-27 22:52:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:05,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543837145] [2024-06-27 22:52:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543837145] [2024-06-27 22:52:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543837145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:06,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:52:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048863786] [2024-06-27 22:52:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:06,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:52:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:06,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:52:06,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:52:06,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:06,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 180 transitions, 2132 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-27 22:52:06,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:06,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:06,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:07,003 INFO L124 PetriNetUnfolderBase]: 619/1132 cut-off events. [2024-06-27 22:52:07,003 INFO L125 PetriNetUnfolderBase]: For 7551/7551 co-relation queries the response was YES. [2024-06-27 22:52:07,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5819 conditions, 1132 events. 619/1132 cut-off events. For 7551/7551 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5888 event pairs, 117 based on Foata normal form. 1/1108 useless extension candidates. Maximal degree in co-relation 5760. Up to 659 conditions per place. [2024-06-27 22:52:07,010 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 119 selfloop transitions, 94 changer transitions 0/220 dead transitions. [2024-06-27 22:52:07,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 220 transitions, 2778 flow [2024-06-27 22:52:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:52:07,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2024-06-27 22:52:07,012 INFO L175 Difference]: Start difference. First operand has 118 places, 180 transitions, 2132 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:52:07,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 220 transitions, 2778 flow [2024-06-27 22:52:07,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 220 transitions, 2731 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:52:07,030 INFO L231 Difference]: Finished difference. Result has 123 places, 194 transitions, 2507 flow [2024-06-27 22:52:07,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2507, PETRI_PLACES=123, PETRI_TRANSITIONS=194} [2024-06-27 22:52:07,030 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2024-06-27 22:52:07,031 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 194 transitions, 2507 flow [2024-06-27 22:52:07,031 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-27 22:52:07,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:07,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:52:07,031 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:07,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1298653352, now seen corresponding path program 3 times [2024-06-27 22:52:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110021689] [2024-06-27 22:52:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:08,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:08,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110021689] [2024-06-27 22:52:08,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110021689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:08,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:08,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:52:08,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568641093] [2024-06-27 22:52:08,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:08,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:52:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:52:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:52:08,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:52:08,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 194 transitions, 2507 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:08,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:08,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:52:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:09,035 INFO L124 PetriNetUnfolderBase]: 600/1174 cut-off events. [2024-06-27 22:52:09,036 INFO L125 PetriNetUnfolderBase]: For 9326/9326 co-relation queries the response was YES. [2024-06-27 22:52:09,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6242 conditions, 1174 events. 600/1174 cut-off events. For 9326/9326 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6428 event pairs, 123 based on Foata normal form. 1/1130 useless extension candidates. Maximal degree in co-relation 6182. Up to 631 conditions per place. [2024-06-27 22:52:09,042 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 115 selfloop transitions, 98 changer transitions 0/225 dead transitions. [2024-06-27 22:52:09,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 225 transitions, 3105 flow [2024-06-27 22:52:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 22:52:09,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-27 22:52:09,047 INFO L175 Difference]: Start difference. First operand has 123 places, 194 transitions, 2507 flow. Second operand 8 states and 149 transitions. [2024-06-27 22:52:09,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 225 transitions, 3105 flow [2024-06-27 22:52:09,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 225 transitions, 3020 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 22:52:09,066 INFO L231 Difference]: Finished difference. Result has 126 places, 198 transitions, 2678 flow [2024-06-27 22:52:09,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2430, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2678, PETRI_PLACES=126, PETRI_TRANSITIONS=198} [2024-06-27 22:52:09,067 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 87 predicate places. [2024-06-27 22:52:09,067 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 198 transitions, 2678 flow [2024-06-27 22:52:09,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:09,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:09,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:52:09,068 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:09,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1265321997, now seen corresponding path program 1 times [2024-06-27 22:52:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383782576] [2024-06-27 22:52:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:10,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:10,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383782576] [2024-06-27 22:52:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383782576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:10,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:10,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175330855] [2024-06-27 22:52:10,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:10,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:10,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:10,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:10,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:10,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 198 transitions, 2678 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:10,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:10,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:10,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:10,858 INFO L124 PetriNetUnfolderBase]: 680/1235 cut-off events. [2024-06-27 22:52:10,858 INFO L125 PetriNetUnfolderBase]: For 10195/10195 co-relation queries the response was YES. [2024-06-27 22:52:10,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7059 conditions, 1235 events. 680/1235 cut-off events. For 10195/10195 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6521 event pairs, 147 based on Foata normal form. 2/1209 useless extension candidates. Maximal degree in co-relation 6999. Up to 794 conditions per place. [2024-06-27 22:52:10,892 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 137 selfloop transitions, 101 changer transitions 0/245 dead transitions. [2024-06-27 22:52:10,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 245 transitions, 3447 flow [2024-06-27 22:52:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 22:52:10,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-27 22:52:10,894 INFO L175 Difference]: Start difference. First operand has 126 places, 198 transitions, 2678 flow. Second operand 9 states and 163 transitions. [2024-06-27 22:52:10,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 245 transitions, 3447 flow [2024-06-27 22:52:10,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 245 transitions, 3287 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 22:52:10,915 INFO L231 Difference]: Finished difference. Result has 132 places, 215 transitions, 2981 flow [2024-06-27 22:52:10,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2518, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2981, PETRI_PLACES=132, PETRI_TRANSITIONS=215} [2024-06-27 22:52:10,916 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 93 predicate places. [2024-06-27 22:52:10,916 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 215 transitions, 2981 flow [2024-06-27 22:52:10,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:10,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:10,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:10,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:52:10,917 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:10,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1374635832, now seen corresponding path program 4 times [2024-06-27 22:52:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811162189] [2024-06-27 22:52:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811162189] [2024-06-27 22:52:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811162189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955657946] [2024-06-27 22:52:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:12,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:12,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:12,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:12,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:52:12,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 215 transitions, 2981 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:12,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:12,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:52:12,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:12,751 INFO L124 PetriNetUnfolderBase]: 672/1243 cut-off events. [2024-06-27 22:52:12,752 INFO L125 PetriNetUnfolderBase]: For 11333/11333 co-relation queries the response was YES. [2024-06-27 22:52:12,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7349 conditions, 1243 events. 672/1243 cut-off events. For 11333/11333 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6763 event pairs, 119 based on Foata normal form. 1/1206 useless extension candidates. Maximal degree in co-relation 7286. Up to 818 conditions per place. [2024-06-27 22:52:12,760 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 132 selfloop transitions, 101 changer transitions 0/246 dead transitions. [2024-06-27 22:52:12,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 246 transitions, 3617 flow [2024-06-27 22:52:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 22:52:12,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:52:12,775 INFO L175 Difference]: Start difference. First operand has 132 places, 215 transitions, 2981 flow. Second operand 8 states and 144 transitions. [2024-06-27 22:52:12,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 246 transitions, 3617 flow [2024-06-27 22:52:12,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 246 transitions, 3553 flow, removed 25 selfloop flow, removed 2 redundant places. [2024-06-27 22:52:12,803 INFO L231 Difference]: Finished difference. Result has 138 places, 223 transitions, 3244 flow [2024-06-27 22:52:12,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2917, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3244, PETRI_PLACES=138, PETRI_TRANSITIONS=223} [2024-06-27 22:52:12,803 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 99 predicate places. [2024-06-27 22:52:12,803 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 223 transitions, 3244 flow [2024-06-27 22:52:12,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:12,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:12,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:12,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:52:12,804 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:12,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1057744357, now seen corresponding path program 2 times [2024-06-27 22:52:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:12,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156866526] [2024-06-27 22:52:12,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:14,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-27 22:52:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:14,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156866526] [2024-06-27 22:52:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156866526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:14,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419980148] [2024-06-27 22:52:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:14,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:14,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:14,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 223 transitions, 3244 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:14,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:14,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:14,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:14,840 INFO L124 PetriNetUnfolderBase]: 789/1420 cut-off events. [2024-06-27 22:52:14,840 INFO L125 PetriNetUnfolderBase]: For 14107/14107 co-relation queries the response was YES. [2024-06-27 22:52:14,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 1420 events. 789/1420 cut-off events. For 14107/14107 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7712 event pairs, 157 based on Foata normal form. 2/1391 useless extension candidates. Maximal degree in co-relation 8598. Up to 895 conditions per place. [2024-06-27 22:52:14,849 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 152 selfloop transitions, 121 changer transitions 0/280 dead transitions. [2024-06-27 22:52:14,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 280 transitions, 4242 flow [2024-06-27 22:52:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 22:52:14,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2024-06-27 22:52:14,852 INFO L175 Difference]: Start difference. First operand has 138 places, 223 transitions, 3244 flow. Second operand 9 states and 164 transitions. [2024-06-27 22:52:14,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 280 transitions, 4242 flow [2024-06-27 22:52:14,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 280 transitions, 4133 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 22:52:14,882 INFO L231 Difference]: Finished difference. Result has 145 places, 249 transitions, 3737 flow [2024-06-27 22:52:14,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3135, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3737, PETRI_PLACES=145, PETRI_TRANSITIONS=249} [2024-06-27 22:52:14,883 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 106 predicate places. [2024-06-27 22:52:14,883 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 249 transitions, 3737 flow [2024-06-27 22:52:14,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:14,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:14,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:14,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:52:14,884 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:14,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1886135969, now seen corresponding path program 3 times [2024-06-27 22:52:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592092355] [2024-06-27 22:52:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:16,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:16,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592092355] [2024-06-27 22:52:16,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592092355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:16,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:16,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:16,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306975239] [2024-06-27 22:52:16,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:16,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:16,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:16,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:16,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 249 transitions, 3737 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:16,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:16,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:16,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:17,054 INFO L124 PetriNetUnfolderBase]: 877/1640 cut-off events. [2024-06-27 22:52:17,055 INFO L125 PetriNetUnfolderBase]: For 17300/17300 co-relation queries the response was YES. [2024-06-27 22:52:17,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9975 conditions, 1640 events. 877/1640 cut-off events. For 17300/17300 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9530 event pairs, 188 based on Foata normal form. 2/1589 useless extension candidates. Maximal degree in co-relation 9906. Up to 1135 conditions per place. [2024-06-27 22:52:17,065 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 241 selfloop transitions, 78 changer transitions 0/326 dead transitions. [2024-06-27 22:52:17,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 326 transitions, 5001 flow [2024-06-27 22:52:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:52:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:52:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-27 22:52:17,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2024-06-27 22:52:17,066 INFO L175 Difference]: Start difference. First operand has 145 places, 249 transitions, 3737 flow. Second operand 11 states and 196 transitions. [2024-06-27 22:52:17,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 326 transitions, 5001 flow [2024-06-27 22:52:17,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 326 transitions, 4840 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 22:52:17,100 INFO L231 Difference]: Finished difference. Result has 155 places, 278 transitions, 4163 flow [2024-06-27 22:52:17,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3587, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4163, PETRI_PLACES=155, PETRI_TRANSITIONS=278} [2024-06-27 22:52:17,101 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2024-06-27 22:52:17,101 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 278 transitions, 4163 flow [2024-06-27 22:52:17,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:17,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:17,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:17,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:52:17,102 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:17,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1378354902, now seen corresponding path program 5 times [2024-06-27 22:52:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328228915] [2024-06-27 22:52:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328228915] [2024-06-27 22:52:18,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328228915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:18,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:18,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679221072] [2024-06-27 22:52:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:18,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:18,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:18,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:18,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:52:18,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 278 transitions, 4163 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:18,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:18,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:52:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:19,004 INFO L124 PetriNetUnfolderBase]: 876/1661 cut-off events. [2024-06-27 22:52:19,005 INFO L125 PetriNetUnfolderBase]: For 18504/18512 co-relation queries the response was YES. [2024-06-27 22:52:19,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10113 conditions, 1661 events. 876/1661 cut-off events. For 18504/18512 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9926 event pairs, 165 based on Foata normal form. 1/1594 useless extension candidates. Maximal degree in co-relation 10040. Up to 1225 conditions per place. [2024-06-27 22:52:19,032 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 228 selfloop transitions, 68 changer transitions 0/311 dead transitions. [2024-06-27 22:52:19,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 311 transitions, 5002 flow [2024-06-27 22:52:19,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 22:52:19,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:52:19,045 INFO L175 Difference]: Start difference. First operand has 155 places, 278 transitions, 4163 flow. Second operand 8 states and 140 transitions. [2024-06-27 22:52:19,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 311 transitions, 5002 flow [2024-06-27 22:52:19,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 311 transitions, 4866 flow, removed 39 selfloop flow, removed 3 redundant places. [2024-06-27 22:52:19,092 INFO L231 Difference]: Finished difference. Result has 161 places, 290 transitions, 4402 flow [2024-06-27 22:52:19,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4027, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4402, PETRI_PLACES=161, PETRI_TRANSITIONS=290} [2024-06-27 22:52:19,093 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2024-06-27 22:52:19,093 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 290 transitions, 4402 flow [2024-06-27 22:52:19,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:19,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:19,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:19,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:52:19,094 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:19,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1919209559, now seen corresponding path program 4 times [2024-06-27 22:52:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782901722] [2024-06-27 22:52:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782901722] [2024-06-27 22:52:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782901722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090078848] [2024-06-27 22:52:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:20,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:20,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:20,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:20,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:20,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 290 transitions, 4402 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:20,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:20,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:20,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:21,269 INFO L124 PetriNetUnfolderBase]: 903/1699 cut-off events. [2024-06-27 22:52:21,270 INFO L125 PetriNetUnfolderBase]: For 19141/19141 co-relation queries the response was YES. [2024-06-27 22:52:21,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10406 conditions, 1699 events. 903/1699 cut-off events. For 19141/19141 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10062 event pairs, 173 based on Foata normal form. 2/1645 useless extension candidates. Maximal degree in co-relation 10331. Up to 1265 conditions per place. [2024-06-27 22:52:21,283 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 246 selfloop transitions, 70 changer transitions 0/323 dead transitions. [2024-06-27 22:52:21,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 323 transitions, 5215 flow [2024-06-27 22:52:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 22:52:21,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:52:21,286 INFO L175 Difference]: Start difference. First operand has 161 places, 290 transitions, 4402 flow. Second operand 9 states and 160 transitions. [2024-06-27 22:52:21,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 323 transitions, 5215 flow [2024-06-27 22:52:21,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 323 transitions, 5059 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-27 22:52:21,338 INFO L231 Difference]: Finished difference. Result has 166 places, 294 transitions, 4444 flow [2024-06-27 22:52:21,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4250, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4444, PETRI_PLACES=166, PETRI_TRANSITIONS=294} [2024-06-27 22:52:21,339 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 127 predicate places. [2024-06-27 22:52:21,339 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 294 transitions, 4444 flow [2024-06-27 22:52:21,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:21,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:21,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:21,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:52:21,340 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:21,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -28600547, now seen corresponding path program 5 times [2024-06-27 22:52:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25008227] [2024-06-27 22:52:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:22,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-27 22:52:22,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:22,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25008227] [2024-06-27 22:52:22,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25008227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:22,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:22,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:22,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558426209] [2024-06-27 22:52:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:22,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:22,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:22,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:22,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 294 transitions, 4444 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:22,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:22,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:23,099 INFO L124 PetriNetUnfolderBase]: 1027/1948 cut-off events. [2024-06-27 22:52:23,099 INFO L125 PetriNetUnfolderBase]: For 21223/21223 co-relation queries the response was YES. [2024-06-27 22:52:23,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11658 conditions, 1948 events. 1027/1948 cut-off events. For 21223/21223 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12138 event pairs, 242 based on Foata normal form. 2/1878 useless extension candidates. Maximal degree in co-relation 11582. Up to 1194 conditions per place. [2024-06-27 22:52:23,112 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 253 selfloop transitions, 112 changer transitions 0/372 dead transitions. [2024-06-27 22:52:23,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 372 transitions, 5998 flow [2024-06-27 22:52:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:52:23,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:52:23,114 INFO L175 Difference]: Start difference. First operand has 166 places, 294 transitions, 4444 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:52:23,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 372 transitions, 5998 flow [2024-06-27 22:52:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 372 transitions, 5932 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 22:52:23,165 INFO L231 Difference]: Finished difference. Result has 175 places, 333 transitions, 5320 flow [2024-06-27 22:52:23,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4385, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5320, PETRI_PLACES=175, PETRI_TRANSITIONS=333} [2024-06-27 22:52:23,166 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 136 predicate places. [2024-06-27 22:52:23,166 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 333 transitions, 5320 flow [2024-06-27 22:52:23,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:23,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:23,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:23,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:52:23,167 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:23,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -28632587, now seen corresponding path program 6 times [2024-06-27 22:52:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336451443] [2024-06-27 22:52:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:24,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336451443] [2024-06-27 22:52:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336451443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:52:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966169602] [2024-06-27 22:52:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:24,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:52:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:24,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:52:24,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:52:24,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:24,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 333 transitions, 5320 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:24,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:24,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:24,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:25,219 INFO L124 PetriNetUnfolderBase]: 1143/2159 cut-off events. [2024-06-27 22:52:25,220 INFO L125 PetriNetUnfolderBase]: For 26456/26456 co-relation queries the response was YES. [2024-06-27 22:52:25,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13793 conditions, 2159 events. 1143/2159 cut-off events. For 26456/26456 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13697 event pairs, 250 based on Foata normal form. 2/2083 useless extension candidates. Maximal degree in co-relation 13712. Up to 1485 conditions per place. [2024-06-27 22:52:25,237 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 298 selfloop transitions, 97 changer transitions 0/402 dead transitions. [2024-06-27 22:52:25,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 402 transitions, 6899 flow [2024-06-27 22:52:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:52:25,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:52:25,239 INFO L175 Difference]: Start difference. First operand has 175 places, 333 transitions, 5320 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:52:25,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 402 transitions, 6899 flow [2024-06-27 22:52:25,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 402 transitions, 6840 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-27 22:52:25,306 INFO L231 Difference]: Finished difference. Result has 183 places, 360 transitions, 6010 flow [2024-06-27 22:52:25,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5261, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6010, PETRI_PLACES=183, PETRI_TRANSITIONS=360} [2024-06-27 22:52:25,307 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 144 predicate places. [2024-06-27 22:52:25,307 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 360 transitions, 6010 flow [2024-06-27 22:52:25,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:25,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:25,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:25,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:52:25,308 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:25,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -28627007, now seen corresponding path program 7 times [2024-06-27 22:52:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838214457] [2024-06-27 22:52:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:26,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:26,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838214457] [2024-06-27 22:52:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838214457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:26,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:26,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682137413] [2024-06-27 22:52:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:26,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:26,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:26,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:26,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:26,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:26,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 360 transitions, 6010 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:26,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:26,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:26,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:27,513 INFO L124 PetriNetUnfolderBase]: 1139/2153 cut-off events. [2024-06-27 22:52:27,514 INFO L125 PetriNetUnfolderBase]: For 28239/28239 co-relation queries the response was YES. [2024-06-27 22:52:27,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14185 conditions, 2153 events. 1139/2153 cut-off events. For 28239/28239 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13653 event pairs, 250 based on Foata normal form. 2/2077 useless extension candidates. Maximal degree in co-relation 14101. Up to 1482 conditions per place. [2024-06-27 22:52:27,531 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 298 selfloop transitions, 102 changer transitions 0/407 dead transitions. [2024-06-27 22:52:27,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 407 transitions, 7124 flow [2024-06-27 22:52:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:52:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:52:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-27 22:52:27,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-27 22:52:27,533 INFO L175 Difference]: Start difference. First operand has 183 places, 360 transitions, 6010 flow. Second operand 10 states and 174 transitions. [2024-06-27 22:52:27,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 407 transitions, 7124 flow [2024-06-27 22:52:27,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 407 transitions, 7000 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-27 22:52:27,605 INFO L231 Difference]: Finished difference. Result has 190 places, 362 transitions, 6154 flow [2024-06-27 22:52:27,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5886, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6154, PETRI_PLACES=190, PETRI_TRANSITIONS=362} [2024-06-27 22:52:27,606 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 151 predicate places. [2024-06-27 22:52:27,606 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 362 transitions, 6154 flow [2024-06-27 22:52:27,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:27,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:27,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:27,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:52:27,607 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:27,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash 199152501, now seen corresponding path program 8 times [2024-06-27 22:52:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:27,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91437369] [2024-06-27 22:52:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91437369] [2024-06-27 22:52:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91437369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:28,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:28,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049972083] [2024-06-27 22:52:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:28,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:28,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:28,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 362 transitions, 6154 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:28,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:28,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:28,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:29,369 INFO L124 PetriNetUnfolderBase]: 1160/2194 cut-off events. [2024-06-27 22:52:29,369 INFO L125 PetriNetUnfolderBase]: For 29022/29022 co-relation queries the response was YES. [2024-06-27 22:52:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14682 conditions, 2194 events. 1160/2194 cut-off events. For 29022/29022 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13994 event pairs, 281 based on Foata normal form. 3/2118 useless extension candidates. Maximal degree in co-relation 14595. Up to 1720 conditions per place. [2024-06-27 22:52:29,387 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 353 selfloop transitions, 39 changer transitions 0/399 dead transitions. [2024-06-27 22:52:29,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 399 transitions, 7303 flow [2024-06-27 22:52:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-27 22:52:29,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-27 22:52:29,391 INFO L175 Difference]: Start difference. First operand has 190 places, 362 transitions, 6154 flow. Second operand 8 states and 129 transitions. [2024-06-27 22:52:29,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 399 transitions, 7303 flow [2024-06-27 22:52:29,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 399 transitions, 7077 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:52:29,471 INFO L231 Difference]: Finished difference. Result has 191 places, 372 transitions, 6224 flow [2024-06-27 22:52:29,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5928, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6224, PETRI_PLACES=191, PETRI_TRANSITIONS=372} [2024-06-27 22:52:29,472 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 152 predicate places. [2024-06-27 22:52:29,472 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 372 transitions, 6224 flow [2024-06-27 22:52:29,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:29,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:29,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:29,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:52:29,472 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:29,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1002408226, now seen corresponding path program 6 times [2024-06-27 22:52:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:29,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933889877] [2024-06-27 22:52:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933889877] [2024-06-27 22:52:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933889877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861374836] [2024-06-27 22:52:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:30,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:30,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:30,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 372 transitions, 6224 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:30,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:30,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:31,273 INFO L124 PetriNetUnfolderBase]: 1177/2224 cut-off events. [2024-06-27 22:52:31,274 INFO L125 PetriNetUnfolderBase]: For 27989/27989 co-relation queries the response was YES. [2024-06-27 22:52:31,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14697 conditions, 2224 events. 1177/2224 cut-off events. For 27989/27989 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14204 event pairs, 264 based on Foata normal form. 1/2144 useless extension candidates. Maximal degree in co-relation 14609. Up to 1763 conditions per place. [2024-06-27 22:52:31,290 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 345 selfloop transitions, 51 changer transitions 0/403 dead transitions. [2024-06-27 22:52:31,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 403 transitions, 7238 flow [2024-06-27 22:52:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:52:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:52:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-27 22:52:31,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-27 22:52:31,292 INFO L175 Difference]: Start difference. First operand has 191 places, 372 transitions, 6224 flow. Second operand 7 states and 125 transitions. [2024-06-27 22:52:31,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 403 transitions, 7238 flow [2024-06-27 22:52:31,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 403 transitions, 7092 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-27 22:52:31,368 INFO L231 Difference]: Finished difference. Result has 194 places, 380 transitions, 6353 flow [2024-06-27 22:52:31,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6078, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6353, PETRI_PLACES=194, PETRI_TRANSITIONS=380} [2024-06-27 22:52:31,373 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 155 predicate places. [2024-06-27 22:52:31,373 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 380 transitions, 6353 flow [2024-06-27 22:52:31,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:31,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:31,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:31,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:52:31,374 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:31,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 198945111, now seen corresponding path program 9 times [2024-06-27 22:52:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:31,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750454905] [2024-06-27 22:52:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750454905] [2024-06-27 22:52:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750454905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:32,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:52:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985758639] [2024-06-27 22:52:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:32,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:52:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:32,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:52:32,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:52:32,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:32,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 380 transitions, 6353 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:32,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:32,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:32,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:33,499 INFO L124 PetriNetUnfolderBase]: 1215/2295 cut-off events. [2024-06-27 22:52:33,499 INFO L125 PetriNetUnfolderBase]: For 29710/29710 co-relation queries the response was YES. [2024-06-27 22:52:33,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15261 conditions, 2295 events. 1215/2295 cut-off events. For 29710/29710 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14767 event pairs, 269 based on Foata normal form. 2/2213 useless extension candidates. Maximal degree in co-relation 15170. Up to 1637 conditions per place. [2024-06-27 22:52:33,518 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 326 selfloop transitions, 88 changer transitions 0/421 dead transitions. [2024-06-27 22:52:33,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 421 transitions, 7622 flow [2024-06-27 22:52:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-27 22:52:33,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-27 22:52:33,519 INFO L175 Difference]: Start difference. First operand has 194 places, 380 transitions, 6353 flow. Second operand 8 states and 138 transitions. [2024-06-27 22:52:33,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 421 transitions, 7622 flow [2024-06-27 22:52:33,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 421 transitions, 7533 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-27 22:52:33,605 INFO L231 Difference]: Finished difference. Result has 199 places, 388 transitions, 6615 flow [2024-06-27 22:52:33,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6272, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6615, PETRI_PLACES=199, PETRI_TRANSITIONS=388} [2024-06-27 22:52:33,606 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 160 predicate places. [2024-06-27 22:52:33,607 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 388 transitions, 6615 flow [2024-06-27 22:52:33,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:33,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:33,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:33,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:52:33,607 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:33,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 198950691, now seen corresponding path program 10 times [2024-06-27 22:52:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:33,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122781877] [2024-06-27 22:52:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:34,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122781877] [2024-06-27 22:52:34,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122781877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:34,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:34,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468528103] [2024-06-27 22:52:34,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:34,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:34,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:34,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:34,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:34,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:34,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 388 transitions, 6615 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:34,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:34,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:34,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:35,557 INFO L124 PetriNetUnfolderBase]: 1211/2301 cut-off events. [2024-06-27 22:52:35,557 INFO L125 PetriNetUnfolderBase]: For 30037/30037 co-relation queries the response was YES. [2024-06-27 22:52:35,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15278 conditions, 2301 events. 1211/2301 cut-off events. For 30037/30037 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14898 event pairs, 267 based on Foata normal form. 2/2218 useless extension candidates. Maximal degree in co-relation 15186. Up to 1634 conditions per place. [2024-06-27 22:52:35,576 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 342 selfloop transitions, 77 changer transitions 0/426 dead transitions. [2024-06-27 22:52:35,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 426 transitions, 7759 flow [2024-06-27 22:52:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:52:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:52:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 22:52:35,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-27 22:52:35,577 INFO L175 Difference]: Start difference. First operand has 199 places, 388 transitions, 6615 flow. Second operand 7 states and 127 transitions. [2024-06-27 22:52:35,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 426 transitions, 7759 flow [2024-06-27 22:52:35,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 426 transitions, 7328 flow, removed 60 selfloop flow, removed 8 redundant places. [2024-06-27 22:52:35,664 INFO L231 Difference]: Finished difference. Result has 198 places, 388 transitions, 6358 flow [2024-06-27 22:52:35,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6190, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6358, PETRI_PLACES=198, PETRI_TRANSITIONS=388} [2024-06-27 22:52:35,665 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 159 predicate places. [2024-06-27 22:52:35,665 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 388 transitions, 6358 flow [2024-06-27 22:52:35,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:35,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:35,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:35,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:52:35,666 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:35,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1953510469, now seen corresponding path program 1 times [2024-06-27 22:52:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:35,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137741155] [2024-06-27 22:52:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:36,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-27 22:52:36,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137741155] [2024-06-27 22:52:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137741155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:36,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:36,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:52:36,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37119234] [2024-06-27 22:52:36,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:36,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:52:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:52:36,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:52:36,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:52:36,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 388 transitions, 6358 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:36,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:36,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:52:36,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:37,335 INFO L124 PetriNetUnfolderBase]: 1144/2240 cut-off events. [2024-06-27 22:52:37,335 INFO L125 PetriNetUnfolderBase]: For 28428/28433 co-relation queries the response was YES. [2024-06-27 22:52:37,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14287 conditions, 2240 events. 1144/2240 cut-off events. For 28428/28433 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14862 event pairs, 120 based on Foata normal form. 4/2158 useless extension candidates. Maximal degree in co-relation 14196. Up to 1125 conditions per place. [2024-06-27 22:52:37,355 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 209 selfloop transitions, 128 changer transitions 0/421 dead transitions. [2024-06-27 22:52:37,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 421 transitions, 7264 flow [2024-06-27 22:52:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-27 22:52:37,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-06-27 22:52:37,356 INFO L175 Difference]: Start difference. First operand has 198 places, 388 transitions, 6358 flow. Second operand 8 states and 155 transitions. [2024-06-27 22:52:37,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 421 transitions, 7264 flow [2024-06-27 22:52:37,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 421 transitions, 7135 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 22:52:37,445 INFO L231 Difference]: Finished difference. Result has 205 places, 394 transitions, 6710 flow [2024-06-27 22:52:37,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6229, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6710, PETRI_PLACES=205, PETRI_TRANSITIONS=394} [2024-06-27 22:52:37,445 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 166 predicate places. [2024-06-27 22:52:37,446 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 394 transitions, 6710 flow [2024-06-27 22:52:37,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:37,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:37,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:37,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:52:37,446 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:37,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1792282493, now seen corresponding path program 1 times [2024-06-27 22:52:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701592144] [2024-06-27 22:52:37,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:39,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701592144] [2024-06-27 22:52:39,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701592144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:39,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:39,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:52:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496252899] [2024-06-27 22:52:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:39,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:52:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:39,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:52:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:52:39,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:39,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 394 transitions, 6710 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:39,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:39,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:39,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:40,197 INFO L124 PetriNetUnfolderBase]: 1360/2607 cut-off events. [2024-06-27 22:52:40,197 INFO L125 PetriNetUnfolderBase]: For 34476/34476 co-relation queries the response was YES. [2024-06-27 22:52:40,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16693 conditions, 2607 events. 1360/2607 cut-off events. For 34476/34476 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17480 event pairs, 166 based on Foata normal form. 2/2510 useless extension candidates. Maximal degree in co-relation 16599. Up to 1187 conditions per place. [2024-06-27 22:52:40,217 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 243 selfloop transitions, 244 changer transitions 0/494 dead transitions. [2024-06-27 22:52:40,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 494 transitions, 8656 flow [2024-06-27 22:52:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:52:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:52:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2024-06-27 22:52:40,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2024-06-27 22:52:40,219 INFO L175 Difference]: Start difference. First operand has 205 places, 394 transitions, 6710 flow. Second operand 12 states and 219 transitions. [2024-06-27 22:52:40,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 494 transitions, 8656 flow [2024-06-27 22:52:40,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 494 transitions, 8512 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 22:52:40,317 INFO L231 Difference]: Finished difference. Result has 218 places, 443 transitions, 8082 flow [2024-06-27 22:52:40,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6578, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8082, PETRI_PLACES=218, PETRI_TRANSITIONS=443} [2024-06-27 22:52:40,318 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 179 predicate places. [2024-06-27 22:52:40,318 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 443 transitions, 8082 flow [2024-06-27 22:52:40,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:40,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:40,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:40,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:52:40,319 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:40,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash 302013167, now seen corresponding path program 2 times [2024-06-27 22:52:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110208935] [2024-06-27 22:52:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:41,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110208935] [2024-06-27 22:52:41,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110208935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:41,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:41,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:52:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718514793] [2024-06-27 22:52:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:41,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:52:41,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:52:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:52:42,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:42,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 443 transitions, 8082 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:42,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:42,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:42,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:43,159 INFO L124 PetriNetUnfolderBase]: 1706/3363 cut-off events. [2024-06-27 22:52:43,159 INFO L125 PetriNetUnfolderBase]: For 53144/53144 co-relation queries the response was YES. [2024-06-27 22:52:43,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22630 conditions, 3363 events. 1706/3363 cut-off events. For 53144/53144 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24314 event pairs, 282 based on Foata normal form. 2/3223 useless extension candidates. Maximal degree in co-relation 22530. Up to 1320 conditions per place. [2024-06-27 22:52:43,186 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 309 selfloop transitions, 264 changer transitions 0/580 dead transitions. [2024-06-27 22:52:43,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 580 transitions, 10870 flow [2024-06-27 22:52:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:52:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:52:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 22:52:43,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5542857142857143 [2024-06-27 22:52:43,189 INFO L175 Difference]: Start difference. First operand has 218 places, 443 transitions, 8082 flow. Second operand 10 states and 194 transitions. [2024-06-27 22:52:43,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 580 transitions, 10870 flow [2024-06-27 22:52:43,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 580 transitions, 10405 flow, removed 193 selfloop flow, removed 4 redundant places. [2024-06-27 22:52:43,355 INFO L231 Difference]: Finished difference. Result has 226 places, 511 transitions, 9387 flow [2024-06-27 22:52:43,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7773, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9387, PETRI_PLACES=226, PETRI_TRANSITIONS=511} [2024-06-27 22:52:43,356 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 187 predicate places. [2024-06-27 22:52:43,356 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 511 transitions, 9387 flow [2024-06-27 22:52:43,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:43,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:43,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:43,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:52:43,356 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:43,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1603547047, now seen corresponding path program 3 times [2024-06-27 22:52:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:43,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341327239] [2024-06-27 22:52:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:45,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-27 22:52:45,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:45,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341327239] [2024-06-27 22:52:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341327239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:45,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:52:45,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251244779] [2024-06-27 22:52:45,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:45,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:52:45,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:45,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:52:45,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:52:45,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:45,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 511 transitions, 9387 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:45,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:45,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:45,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:46,124 INFO L124 PetriNetUnfolderBase]: 1728/3419 cut-off events. [2024-06-27 22:52:46,124 INFO L125 PetriNetUnfolderBase]: For 57287/57287 co-relation queries the response was YES. [2024-06-27 22:52:46,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23433 conditions, 3419 events. 1728/3419 cut-off events. For 57287/57287 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24883 event pairs, 298 based on Foata normal form. 2/3275 useless extension candidates. Maximal degree in co-relation 23330. Up to 1667 conditions per place. [2024-06-27 22:52:46,158 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 304 selfloop transitions, 263 changer transitions 0/574 dead transitions. [2024-06-27 22:52:46,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 574 transitions, 11055 flow [2024-06-27 22:52:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:52:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:52:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 22:52:46,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342857142857143 [2024-06-27 22:52:46,159 INFO L175 Difference]: Start difference. First operand has 226 places, 511 transitions, 9387 flow. Second operand 10 states and 187 transitions. [2024-06-27 22:52:46,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 574 transitions, 11055 flow [2024-06-27 22:52:46,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 574 transitions, 10879 flow, removed 54 selfloop flow, removed 3 redundant places. [2024-06-27 22:52:46,398 INFO L231 Difference]: Finished difference. Result has 234 places, 517 transitions, 9931 flow [2024-06-27 22:52:46,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9215, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9931, PETRI_PLACES=234, PETRI_TRANSITIONS=517} [2024-06-27 22:52:46,398 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 195 predicate places. [2024-06-27 22:52:46,398 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 517 transitions, 9931 flow [2024-06-27 22:52:46,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:46,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:46,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:46,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:52:46,399 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:46,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1603546923, now seen corresponding path program 2 times [2024-06-27 22:52:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530396729] [2024-06-27 22:52:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530396729] [2024-06-27 22:52:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530396729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:52:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119863486] [2024-06-27 22:52:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:48,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:52:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:48,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:52:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:52:48,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:52:48,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 517 transitions, 9931 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:48,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:48,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:52:48,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:49,190 INFO L124 PetriNetUnfolderBase]: 1733/3458 cut-off events. [2024-06-27 22:52:49,190 INFO L125 PetriNetUnfolderBase]: For 61516/61519 co-relation queries the response was YES. [2024-06-27 22:52:49,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24242 conditions, 3458 events. 1733/3458 cut-off events. For 61516/61519 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 25495 event pairs, 269 based on Foata normal form. 2/3292 useless extension candidates. Maximal degree in co-relation 24136. Up to 1273 conditions per place. [2024-06-27 22:52:49,224 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 264 selfloop transitions, 297 changer transitions 0/578 dead transitions. [2024-06-27 22:52:49,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 578 transitions, 11616 flow [2024-06-27 22:52:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 22:52:49,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546031746031746 [2024-06-27 22:52:49,225 INFO L175 Difference]: Start difference. First operand has 234 places, 517 transitions, 9931 flow. Second operand 9 states and 172 transitions. [2024-06-27 22:52:49,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 578 transitions, 11616 flow [2024-06-27 22:52:49,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 578 transitions, 11161 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 22:52:49,426 INFO L231 Difference]: Finished difference. Result has 239 places, 536 transitions, 10564 flow [2024-06-27 22:52:49,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9480, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10564, PETRI_PLACES=239, PETRI_TRANSITIONS=536} [2024-06-27 22:52:49,427 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 200 predicate places. [2024-06-27 22:52:49,427 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 536 transitions, 10564 flow [2024-06-27 22:52:49,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:49,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:49,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:49,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:52:49,428 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:49,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash -570275073, now seen corresponding path program 3 times [2024-06-27 22:52:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812916638] [2024-06-27 22:52:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812916638] [2024-06-27 22:52:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812916638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:50,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:52:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468326441] [2024-06-27 22:52:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:50,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:52:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:52:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:52:50,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:52:50,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 536 transitions, 10564 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:50,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:50,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:52:50,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:51,930 INFO L124 PetriNetUnfolderBase]: 1788/3579 cut-off events. [2024-06-27 22:52:51,930 INFO L125 PetriNetUnfolderBase]: For 70203/70210 co-relation queries the response was YES. [2024-06-27 22:52:51,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25465 conditions, 3579 events. 1788/3579 cut-off events. For 70203/70210 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 26681 event pairs, 280 based on Foata normal form. 6/3407 useless extension candidates. Maximal degree in co-relation 25356. Up to 1910 conditions per place. [2024-06-27 22:52:51,974 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 322 selfloop transitions, 245 changer transitions 0/584 dead transitions. [2024-06-27 22:52:51,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 584 transitions, 12084 flow [2024-06-27 22:52:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:52:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:52:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 22:52:51,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2024-06-27 22:52:51,976 INFO L175 Difference]: Start difference. First operand has 239 places, 536 transitions, 10564 flow. Second operand 9 states and 166 transitions. [2024-06-27 22:52:51,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 584 transitions, 12084 flow [2024-06-27 22:52:52,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 584 transitions, 11755 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-06-27 22:52:52,256 INFO L231 Difference]: Finished difference. Result has 244 places, 549 transitions, 11039 flow [2024-06-27 22:52:52,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=10255, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11039, PETRI_PLACES=244, PETRI_TRANSITIONS=549} [2024-06-27 22:52:52,256 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 205 predicate places. [2024-06-27 22:52:52,256 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 549 transitions, 11039 flow [2024-06-27 22:52:52,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:52,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:52,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:52,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:52:52,257 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:52,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1600750413, now seen corresponding path program 4 times [2024-06-27 22:52:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:52,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602305145] [2024-06-27 22:52:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602305145] [2024-06-27 22:52:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602305145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:53,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:53,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:52:53,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905630708] [2024-06-27 22:52:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:53,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:52:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:53,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:52:53,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:52:53,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:53,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 549 transitions, 11039 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:53,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:53,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:53,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:54,954 INFO L124 PetriNetUnfolderBase]: 1920/3795 cut-off events. [2024-06-27 22:52:54,954 INFO L125 PetriNetUnfolderBase]: For 71900/71900 co-relation queries the response was YES. [2024-06-27 22:52:54,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27743 conditions, 3795 events. 1920/3795 cut-off events. For 71900/71900 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28108 event pairs, 310 based on Foata normal form. 2/3633 useless extension candidates. Maximal degree in co-relation 27632. Up to 2022 conditions per place. [2024-06-27 22:52:55,069 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 349 selfloop transitions, 264 changer transitions 0/620 dead transitions. [2024-06-27 22:52:55,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 620 transitions, 12898 flow [2024-06-27 22:52:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:52:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:52:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 22:52:55,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-27 22:52:55,071 INFO L175 Difference]: Start difference. First operand has 244 places, 549 transitions, 11039 flow. Second operand 10 states and 189 transitions. [2024-06-27 22:52:55,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 620 transitions, 12898 flow [2024-06-27 22:52:55,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 620 transitions, 12394 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-06-27 22:52:55,307 INFO L231 Difference]: Finished difference. Result has 251 places, 566 transitions, 11544 flow [2024-06-27 22:52:55,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=10565, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11544, PETRI_PLACES=251, PETRI_TRANSITIONS=566} [2024-06-27 22:52:55,308 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 212 predicate places. [2024-06-27 22:52:55,308 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 566 transitions, 11544 flow [2024-06-27 22:52:55,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:55,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:55,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:55,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:52:55,308 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:55,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash -603347857, now seen corresponding path program 4 times [2024-06-27 22:52:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:55,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249054008] [2024-06-27 22:52:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:56,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:56,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249054008] [2024-06-27 22:52:56,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249054008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:56,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:56,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:52:56,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812586943] [2024-06-27 22:52:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:56,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:52:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:56,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:52:56,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:52:57,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:52:57,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 566 transitions, 11544 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:57,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:57,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:52:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:58,250 INFO L124 PetriNetUnfolderBase]: 1956/3873 cut-off events. [2024-06-27 22:52:58,251 INFO L125 PetriNetUnfolderBase]: For 74960/74960 co-relation queries the response was YES. [2024-06-27 22:52:58,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28184 conditions, 3873 events. 1956/3873 cut-off events. For 74960/74960 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28998 event pairs, 323 based on Foata normal form. 12/3719 useless extension candidates. Maximal degree in co-relation 28070. Up to 2019 conditions per place. [2024-06-27 22:52:58,290 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 380 selfloop transitions, 236 changer transitions 0/623 dead transitions. [2024-06-27 22:52:58,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 623 transitions, 13176 flow [2024-06-27 22:52:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:52:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:52:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-27 22:52:58,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:52:58,292 INFO L175 Difference]: Start difference. First operand has 251 places, 566 transitions, 11544 flow. Second operand 10 states and 190 transitions. [2024-06-27 22:52:58,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 623 transitions, 13176 flow [2024-06-27 22:52:58,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 623 transitions, 12853 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 22:52:58,586 INFO L231 Difference]: Finished difference. Result has 257 places, 567 transitions, 11736 flow [2024-06-27 22:52:58,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11229, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11736, PETRI_PLACES=257, PETRI_TRANSITIONS=567} [2024-06-27 22:52:58,587 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 218 predicate places. [2024-06-27 22:52:58,587 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 567 transitions, 11736 flow [2024-06-27 22:52:58,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:58,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:58,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:58,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:52:58,588 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:58,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1566802737, now seen corresponding path program 5 times [2024-06-27 22:52:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:58,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878979828] [2024-06-27 22:52:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:58,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:00,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878979828] [2024-06-27 22:53:00,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878979828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:00,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:00,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:00,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837184278] [2024-06-27 22:53:00,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:00,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:00,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:00,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 567 transitions, 11736 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:00,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:00,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:00,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:01,700 INFO L124 PetriNetUnfolderBase]: 2105/4197 cut-off events. [2024-06-27 22:53:01,701 INFO L125 PetriNetUnfolderBase]: For 83594/83594 co-relation queries the response was YES. [2024-06-27 22:53:01,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30070 conditions, 4197 events. 2105/4197 cut-off events. For 83594/83594 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 32000 event pairs, 271 based on Foata normal form. 2/4018 useless extension candidates. Maximal degree in co-relation 29955. Up to 1088 conditions per place. [2024-06-27 22:53:01,747 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 285 selfloop transitions, 340 changer transitions 0/632 dead transitions. [2024-06-27 22:53:01,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 632 transitions, 13681 flow [2024-06-27 22:53:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-27 22:53:01,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 22:53:01,748 INFO L175 Difference]: Start difference. First operand has 257 places, 567 transitions, 11736 flow. Second operand 9 states and 175 transitions. [2024-06-27 22:53:01,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 632 transitions, 13681 flow [2024-06-27 22:53:02,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 632 transitions, 13137 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 22:53:02,058 INFO L231 Difference]: Finished difference. Result has 259 places, 579 transitions, 12395 flow [2024-06-27 22:53:02,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11192, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12395, PETRI_PLACES=259, PETRI_TRANSITIONS=579} [2024-06-27 22:53:02,060 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 220 predicate places. [2024-06-27 22:53:02,061 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 579 transitions, 12395 flow [2024-06-27 22:53:02,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:02,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:02,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:02,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:53:02,061 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:02,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash -338757477, now seen corresponding path program 6 times [2024-06-27 22:53:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515364034] [2024-06-27 22:53:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:03,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:03,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515364034] [2024-06-27 22:53:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515364034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894620834] [2024-06-27 22:53:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:03,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:03,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:03,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:03,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:03,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 579 transitions, 12395 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:03,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:03,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:03,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:05,179 INFO L124 PetriNetUnfolderBase]: 2127/4269 cut-off events. [2024-06-27 22:53:05,179 INFO L125 PetriNetUnfolderBase]: For 89876/89876 co-relation queries the response was YES. [2024-06-27 22:53:05,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31390 conditions, 4269 events. 2127/4269 cut-off events. For 89876/89876 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32803 event pairs, 343 based on Foata normal form. 2/4080 useless extension candidates. Maximal degree in co-relation 31272. Up to 1900 conditions per place. [2024-06-27 22:53:05,220 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 286 selfloop transitions, 337 changer transitions 0/630 dead transitions. [2024-06-27 22:53:05,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 630 transitions, 14084 flow [2024-06-27 22:53:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 22:53:05,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2024-06-27 22:53:05,221 INFO L175 Difference]: Start difference. First operand has 259 places, 579 transitions, 12395 flow. Second operand 9 states and 169 transitions. [2024-06-27 22:53:05,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 630 transitions, 14084 flow [2024-06-27 22:53:05,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 630 transitions, 13800 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 22:53:05,563 INFO L231 Difference]: Finished difference. Result has 263 places, 581 transitions, 12847 flow [2024-06-27 22:53:05,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12117, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12847, PETRI_PLACES=263, PETRI_TRANSITIONS=581} [2024-06-27 22:53:05,564 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 224 predicate places. [2024-06-27 22:53:05,565 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 581 transitions, 12847 flow [2024-06-27 22:53:05,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:05,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:05,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:05,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:53:05,565 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:05,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash -335960843, now seen corresponding path program 5 times [2024-06-27 22:53:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406103307] [2024-06-27 22:53:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:07,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:07,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406103307] [2024-06-27 22:53:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406103307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:07,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394065327] [2024-06-27 22:53:07,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:07,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:07,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:07,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 581 transitions, 12847 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:07,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:07,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:07,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:08,484 INFO L124 PetriNetUnfolderBase]: 2184/4408 cut-off events. [2024-06-27 22:53:08,485 INFO L125 PetriNetUnfolderBase]: For 93727/93727 co-relation queries the response was YES. [2024-06-27 22:53:08,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33112 conditions, 4408 events. 2184/4408 cut-off events. For 93727/93727 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 34071 event pairs, 366 based on Foata normal form. 2/4211 useless extension candidates. Maximal degree in co-relation 32993. Up to 2306 conditions per place. [2024-06-27 22:53:08,532 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 338 selfloop transitions, 301 changer transitions 0/646 dead transitions. [2024-06-27 22:53:08,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 646 transitions, 14783 flow [2024-06-27 22:53:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 22:53:08,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2024-06-27 22:53:08,534 INFO L175 Difference]: Start difference. First operand has 263 places, 581 transitions, 12847 flow. Second operand 9 states and 169 transitions. [2024-06-27 22:53:08,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 646 transitions, 14783 flow [2024-06-27 22:53:08,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 646 transitions, 14109 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 22:53:08,926 INFO L231 Difference]: Finished difference. Result has 266 places, 593 transitions, 13113 flow [2024-06-27 22:53:08,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12173, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13113, PETRI_PLACES=266, PETRI_TRANSITIONS=593} [2024-06-27 22:53:08,927 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 227 predicate places. [2024-06-27 22:53:08,927 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 593 transitions, 13113 flow [2024-06-27 22:53:08,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:08,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:08,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:08,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:53:08,928 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:08,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -335960967, now seen corresponding path program 7 times [2024-06-27 22:53:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748274629] [2024-06-27 22:53:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:10,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:10,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748274629] [2024-06-27 22:53:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748274629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:10,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:10,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406977879] [2024-06-27 22:53:10,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:10,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:10,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:10,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:10,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:53:10,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 593 transitions, 13113 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:10,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:10,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:53:10,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:11,861 INFO L124 PetriNetUnfolderBase]: 2145/4338 cut-off events. [2024-06-27 22:53:11,862 INFO L125 PetriNetUnfolderBase]: For 96069/96083 co-relation queries the response was YES. [2024-06-27 22:53:11,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32822 conditions, 4338 events. 2145/4338 cut-off events. For 96069/96083 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 33915 event pairs, 435 based on Foata normal form. 2/4120 useless extension candidates. Maximal degree in co-relation 32701. Up to 3054 conditions per place. [2024-06-27 22:53:11,911 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 450 selfloop transitions, 158 changer transitions 0/626 dead transitions. [2024-06-27 22:53:11,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 626 transitions, 14516 flow [2024-06-27 22:53:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 22:53:11,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:53:11,912 INFO L175 Difference]: Start difference. First operand has 266 places, 593 transitions, 13113 flow. Second operand 9 states and 160 transitions. [2024-06-27 22:53:11,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 626 transitions, 14516 flow [2024-06-27 22:53:12,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 626 transitions, 14333 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-27 22:53:12,312 INFO L231 Difference]: Finished difference. Result has 272 places, 597 transitions, 13349 flow [2024-06-27 22:53:12,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12930, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13349, PETRI_PLACES=272, PETRI_TRANSITIONS=597} [2024-06-27 22:53:12,313 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 233 predicate places. [2024-06-27 22:53:12,313 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 597 transitions, 13349 flow [2024-06-27 22:53:12,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:12,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:12,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:53:12,314 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:12,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1659328275, now seen corresponding path program 6 times [2024-06-27 22:53:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040218186] [2024-06-27 22:53:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040218186] [2024-06-27 22:53:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040218186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:14,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:14,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:14,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843984734] [2024-06-27 22:53:14,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:14,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:14,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:53:14,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 597 transitions, 13349 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:14,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:14,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:53:14,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:15,488 INFO L124 PetriNetUnfolderBase]: 2209/4434 cut-off events. [2024-06-27 22:53:15,488 INFO L125 PetriNetUnfolderBase]: For 100202/100213 co-relation queries the response was YES. [2024-06-27 22:53:15,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34010 conditions, 4434 events. 2209/4434 cut-off events. For 100202/100213 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 34701 event pairs, 519 based on Foata normal form. 3/4224 useless extension candidates. Maximal degree in co-relation 33887. Up to 3006 conditions per place. [2024-06-27 22:53:15,541 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 483 selfloop transitions, 154 changer transitions 0/655 dead transitions. [2024-06-27 22:53:15,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 655 transitions, 15154 flow [2024-06-27 22:53:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:53:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:53:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2024-06-27 22:53:15,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038961038961038 [2024-06-27 22:53:15,542 INFO L175 Difference]: Start difference. First operand has 272 places, 597 transitions, 13349 flow. Second operand 11 states and 194 transitions. [2024-06-27 22:53:15,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 655 transitions, 15154 flow [2024-06-27 22:53:15,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 655 transitions, 14870 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:53:15,973 INFO L231 Difference]: Finished difference. Result has 277 places, 609 transitions, 13686 flow [2024-06-27 22:53:15,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13065, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13686, PETRI_PLACES=277, PETRI_TRANSITIONS=609} [2024-06-27 22:53:15,975 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 238 predicate places. [2024-06-27 22:53:15,975 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 609 transitions, 13686 flow [2024-06-27 22:53:15,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:15,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:15,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:15,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:53:15,976 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:15,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -220665023, now seen corresponding path program 7 times [2024-06-27 22:53:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239410653] [2024-06-27 22:53:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:17,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:17,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239410653] [2024-06-27 22:53:17,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239410653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:17,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:17,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:17,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384353234] [2024-06-27 22:53:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:17,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:17,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:53:17,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 609 transitions, 13686 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:17,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:17,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:53:17,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:18,782 INFO L124 PetriNetUnfolderBase]: 2275/4566 cut-off events. [2024-06-27 22:53:18,782 INFO L125 PetriNetUnfolderBase]: For 105539/105550 co-relation queries the response was YES. [2024-06-27 22:53:18,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35252 conditions, 4566 events. 2275/4566 cut-off events. For 105539/105550 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 35901 event pairs, 531 based on Foata normal form. 3/4349 useless extension candidates. Maximal degree in co-relation 35128. Up to 3105 conditions per place. [2024-06-27 22:53:18,833 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 496 selfloop transitions, 147 changer transitions 0/661 dead transitions. [2024-06-27 22:53:18,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 661 transitions, 15515 flow [2024-06-27 22:53:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 22:53:18,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2024-06-27 22:53:18,835 INFO L175 Difference]: Start difference. First operand has 277 places, 609 transitions, 13686 flow. Second operand 9 states and 164 transitions. [2024-06-27 22:53:18,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 661 transitions, 15515 flow [2024-06-27 22:53:19,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 661 transitions, 15146 flow, removed 42 selfloop flow, removed 9 redundant places. [2024-06-27 22:53:19,291 INFO L231 Difference]: Finished difference. Result has 277 places, 621 transitions, 13948 flow [2024-06-27 22:53:19,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13317, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13948, PETRI_PLACES=277, PETRI_TRANSITIONS=621} [2024-06-27 22:53:19,292 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 238 predicate places. [2024-06-27 22:53:19,292 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 621 transitions, 13948 flow [2024-06-27 22:53:19,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:19,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:19,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:19,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:53:19,293 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:19,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash -220669797, now seen corresponding path program 8 times [2024-06-27 22:53:19,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:19,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857683506] [2024-06-27 22:53:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:19,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857683506] [2024-06-27 22:53:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857683506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456491756] [2024-06-27 22:53:20,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:20,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:21,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:53:21,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 621 transitions, 13948 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:21,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:21,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:53:21,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:22,482 INFO L124 PetriNetUnfolderBase]: 2307/4644 cut-off events. [2024-06-27 22:53:22,482 INFO L125 PetriNetUnfolderBase]: For 108352/108371 co-relation queries the response was YES. [2024-06-27 22:53:22,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35642 conditions, 4644 events. 2307/4644 cut-off events. For 108352/108371 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 36764 event pairs, 553 based on Foata normal form. 2/4413 useless extension candidates. Maximal degree in co-relation 35517. Up to 3476 conditions per place. [2024-06-27 22:53:22,527 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 543 selfloop transitions, 91 changer transitions 0/652 dead transitions. [2024-06-27 22:53:22,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 652 transitions, 15405 flow [2024-06-27 22:53:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 22:53:22,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-27 22:53:22,530 INFO L175 Difference]: Start difference. First operand has 277 places, 621 transitions, 13948 flow. Second operand 9 states and 156 transitions. [2024-06-27 22:53:22,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 652 transitions, 15405 flow [2024-06-27 22:53:22,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 652 transitions, 15026 flow, removed 54 selfloop flow, removed 7 redundant places. [2024-06-27 22:53:22,957 INFO L231 Difference]: Finished difference. Result has 279 places, 625 transitions, 13856 flow [2024-06-27 22:53:22,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13569, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13856, PETRI_PLACES=279, PETRI_TRANSITIONS=625} [2024-06-27 22:53:22,961 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 240 predicate places. [2024-06-27 22:53:22,961 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 625 transitions, 13856 flow [2024-06-27 22:53:22,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:22,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:22,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:22,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:53:22,963 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:22,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -220485099, now seen corresponding path program 1 times [2024-06-27 22:53:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346361579] [2024-06-27 22:53:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:24,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346361579] [2024-06-27 22:53:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346361579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:24,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:24,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266772861] [2024-06-27 22:53:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:24,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:24,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:24,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 625 transitions, 13856 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:24,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:24,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:24,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:26,229 INFO L124 PetriNetUnfolderBase]: 2400/4738 cut-off events. [2024-06-27 22:53:26,230 INFO L125 PetriNetUnfolderBase]: For 110604/110604 co-relation queries the response was YES. [2024-06-27 22:53:26,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36400 conditions, 4738 events. 2400/4738 cut-off events. For 110604/110604 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 36871 event pairs, 613 based on Foata normal form. 2/4546 useless extension candidates. Maximal degree in co-relation 36274. Up to 3748 conditions per place. [2024-06-27 22:53:26,279 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 588 selfloop transitions, 59 changer transitions 0/654 dead transitions. [2024-06-27 22:53:26,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 654 transitions, 15332 flow [2024-06-27 22:53:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 22:53:26,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-27 22:53:26,287 INFO L175 Difference]: Start difference. First operand has 279 places, 625 transitions, 13856 flow. Second operand 9 states and 156 transitions. [2024-06-27 22:53:26,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 654 transitions, 15332 flow [2024-06-27 22:53:26,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 654 transitions, 15168 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 22:53:26,740 INFO L231 Difference]: Finished difference. Result has 282 places, 627 transitions, 13850 flow [2024-06-27 22:53:26,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13692, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13850, PETRI_PLACES=282, PETRI_TRANSITIONS=627} [2024-06-27 22:53:26,741 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 243 predicate places. [2024-06-27 22:53:26,741 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 627 transitions, 13850 flow [2024-06-27 22:53:26,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:26,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:26,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:26,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:53:26,742 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:26,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1684950991, now seen corresponding path program 8 times [2024-06-27 22:53:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031111251] [2024-06-27 22:53:26,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031111251] [2024-06-27 22:53:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031111251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:28,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281840921] [2024-06-27 22:53:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:28,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:28,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:28,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:28,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 627 transitions, 13850 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:28,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:28,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:28,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:29,884 INFO L124 PetriNetUnfolderBase]: 2463/4867 cut-off events. [2024-06-27 22:53:29,885 INFO L125 PetriNetUnfolderBase]: For 110742/110742 co-relation queries the response was YES. [2024-06-27 22:53:29,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37338 conditions, 4867 events. 2463/4867 cut-off events. For 110742/110742 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 38057 event pairs, 533 based on Foata normal form. 2/4669 useless extension candidates. Maximal degree in co-relation 37211. Up to 3183 conditions per place. [2024-06-27 22:53:29,938 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 501 selfloop transitions, 188 changer transitions 0/696 dead transitions. [2024-06-27 22:53:29,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 696 transitions, 16005 flow [2024-06-27 22:53:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-27 22:53:29,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-27 22:53:29,939 INFO L175 Difference]: Start difference. First operand has 282 places, 627 transitions, 13850 flow. Second operand 9 states and 165 transitions. [2024-06-27 22:53:29,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 696 transitions, 16005 flow [2024-06-27 22:53:30,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 696 transitions, 15884 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 22:53:30,555 INFO L231 Difference]: Finished difference. Result has 288 places, 641 transitions, 14580 flow [2024-06-27 22:53:30,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13734, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14580, PETRI_PLACES=288, PETRI_TRANSITIONS=641} [2024-06-27 22:53:30,556 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-27 22:53:30,556 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 641 transitions, 14580 flow [2024-06-27 22:53:30,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:30,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:30,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:30,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:53:30,557 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:30,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash -887429103, now seen corresponding path program 2 times [2024-06-27 22:53:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:30,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622583634] [2024-06-27 22:53:30,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:30,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:32,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622583634] [2024-06-27 22:53:32,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622583634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:32,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:32,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:32,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884360548] [2024-06-27 22:53:32,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:32,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:32,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:32,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:32,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:32,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 641 transitions, 14580 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:32,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:32,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:32,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:33,927 INFO L124 PetriNetUnfolderBase]: 2485/4907 cut-off events. [2024-06-27 22:53:33,927 INFO L125 PetriNetUnfolderBase]: For 123473/123473 co-relation queries the response was YES. [2024-06-27 22:53:33,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38501 conditions, 4907 events. 2485/4907 cut-off events. For 123473/123473 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 38506 event pairs, 753 based on Foata normal form. 2/4705 useless extension candidates. Maximal degree in co-relation 38371. Up to 3826 conditions per place. [2024-06-27 22:53:33,982 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 599 selfloop transitions, 66 changer transitions 0/672 dead transitions. [2024-06-27 22:53:33,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 672 transitions, 16112 flow [2024-06-27 22:53:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 22:53:33,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2024-06-27 22:53:33,983 INFO L175 Difference]: Start difference. First operand has 288 places, 641 transitions, 14580 flow. Second operand 9 states and 149 transitions. [2024-06-27 22:53:33,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 672 transitions, 16112 flow [2024-06-27 22:53:34,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 672 transitions, 15967 flow, removed 66 selfloop flow, removed 2 redundant places. [2024-06-27 22:53:34,514 INFO L231 Difference]: Finished difference. Result has 295 places, 643 transitions, 14599 flow [2024-06-27 22:53:34,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14435, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14599, PETRI_PLACES=295, PETRI_TRANSITIONS=643} [2024-06-27 22:53:34,515 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 256 predicate places. [2024-06-27 22:53:34,515 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 643 transitions, 14599 flow [2024-06-27 22:53:34,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:34,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:34,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:53:34,516 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:34,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1861012031, now seen corresponding path program 9 times [2024-06-27 22:53:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874411405] [2024-06-27 22:53:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:35,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:35,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874411405] [2024-06-27 22:53:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874411405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:35,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:35,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498716020] [2024-06-27 22:53:35,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:35,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:35,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:36,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:36,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 643 transitions, 14599 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:36,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:36,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:36,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:37,510 INFO L124 PetriNetUnfolderBase]: 2576/5087 cut-off events. [2024-06-27 22:53:37,511 INFO L125 PetriNetUnfolderBase]: For 126667/126667 co-relation queries the response was YES. [2024-06-27 22:53:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39844 conditions, 5087 events. 2576/5087 cut-off events. For 126667/126667 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 40230 event pairs, 794 based on Foata normal form. 4/4884 useless extension candidates. Maximal degree in co-relation 39712. Up to 3941 conditions per place. [2024-06-27 22:53:37,571 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 623 selfloop transitions, 76 changer transitions 0/706 dead transitions. [2024-06-27 22:53:37,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 706 transitions, 16818 flow [2024-06-27 22:53:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:53:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:53:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-27 22:53:37,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44935064935064933 [2024-06-27 22:53:37,573 INFO L175 Difference]: Start difference. First operand has 295 places, 643 transitions, 14599 flow. Second operand 11 states and 173 transitions. [2024-06-27 22:53:37,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 706 transitions, 16818 flow [2024-06-27 22:53:38,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 706 transitions, 16684 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 22:53:38,310 INFO L231 Difference]: Finished difference. Result has 302 places, 665 transitions, 15253 flow [2024-06-27 22:53:38,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14465, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15253, PETRI_PLACES=302, PETRI_TRANSITIONS=665} [2024-06-27 22:53:38,311 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 263 predicate places. [2024-06-27 22:53:38,311 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 665 transitions, 15253 flow [2024-06-27 22:53:38,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:38,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:38,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:38,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:53:38,312 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:38,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1861018975, now seen corresponding path program 3 times [2024-06-27 22:53:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:38,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629812749] [2024-06-27 22:53:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:38,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:39,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:39,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629812749] [2024-06-27 22:53:39,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629812749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:39,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:39,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281273964] [2024-06-27 22:53:39,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:39,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:39,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:39,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 665 transitions, 15253 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:39,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:39,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:39,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:41,254 INFO L124 PetriNetUnfolderBase]: 2592/5103 cut-off events. [2024-06-27 22:53:41,254 INFO L125 PetriNetUnfolderBase]: For 128519/128519 co-relation queries the response was YES. [2024-06-27 22:53:41,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40398 conditions, 5103 events. 2592/5103 cut-off events. For 128519/128519 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 40312 event pairs, 814 based on Foata normal form. 2/4896 useless extension candidates. Maximal degree in co-relation 40262. Up to 4119 conditions per place. [2024-06-27 22:53:41,311 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 654 selfloop transitions, 30 changer transitions 0/691 dead transitions. [2024-06-27 22:53:41,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 691 transitions, 16820 flow [2024-06-27 22:53:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:53:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:53:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 22:53:41,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:53:41,313 INFO L175 Difference]: Start difference. First operand has 302 places, 665 transitions, 15253 flow. Second operand 8 states and 133 transitions. [2024-06-27 22:53:41,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 691 transitions, 16820 flow [2024-06-27 22:53:41,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 691 transitions, 16536 flow, removed 110 selfloop flow, removed 5 redundant places. [2024-06-27 22:53:41,896 INFO L231 Difference]: Finished difference. Result has 305 places, 666 transitions, 15056 flow [2024-06-27 22:53:41,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14969, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15056, PETRI_PLACES=305, PETRI_TRANSITIONS=666} [2024-06-27 22:53:41,900 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 266 predicate places. [2024-06-27 22:53:41,900 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 666 transitions, 15056 flow [2024-06-27 22:53:41,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:41,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:41,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:41,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:53:41,901 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:41,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2137612459, now seen corresponding path program 4 times [2024-06-27 22:53:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:41,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168130206] [2024-06-27 22:53:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168130206] [2024-06-27 22:53:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168130206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:43,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252380191] [2024-06-27 22:53:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:43,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:43,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:43,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 666 transitions, 15056 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:43,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:43,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:43,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:44,839 INFO L124 PetriNetUnfolderBase]: 2612/5145 cut-off events. [2024-06-27 22:53:44,840 INFO L125 PetriNetUnfolderBase]: For 127776/127776 co-relation queries the response was YES. [2024-06-27 22:53:44,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40101 conditions, 5145 events. 2612/5145 cut-off events. For 127776/127776 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 40767 event pairs, 764 based on Foata normal form. 2/4934 useless extension candidates. Maximal degree in co-relation 39964. Up to 4158 conditions per place. [2024-06-27 22:53:44,901 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 664 selfloop transitions, 20 changer transitions 0/691 dead transitions. [2024-06-27 22:53:44,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 691 transitions, 16592 flow [2024-06-27 22:53:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:53:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:53:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-27 22:53:44,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-27 22:53:44,903 INFO L175 Difference]: Start difference. First operand has 305 places, 666 transitions, 15056 flow. Second operand 8 states and 129 transitions. [2024-06-27 22:53:44,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 691 transitions, 16592 flow [2024-06-27 22:53:45,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 691 transitions, 16521 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 22:53:45,528 INFO L231 Difference]: Finished difference. Result has 307 places, 669 transitions, 15082 flow [2024-06-27 22:53:45,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14985, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15082, PETRI_PLACES=307, PETRI_TRANSITIONS=669} [2024-06-27 22:53:45,529 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 268 predicate places. [2024-06-27 22:53:45,529 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 669 transitions, 15082 flow [2024-06-27 22:53:45,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:45,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:45,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:45,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:53:45,530 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:45,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1872512239, now seen corresponding path program 5 times [2024-06-27 22:53:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488646108] [2024-06-27 22:53:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:47,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:47,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488646108] [2024-06-27 22:53:47,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488646108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:47,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:47,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:47,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77003351] [2024-06-27 22:53:47,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:47,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:47,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:47,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:47,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:47,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:47,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 669 transitions, 15082 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:47,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:47,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:47,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:48,661 INFO L124 PetriNetUnfolderBase]: 2613/5158 cut-off events. [2024-06-27 22:53:48,661 INFO L125 PetriNetUnfolderBase]: For 128445/128445 co-relation queries the response was YES. [2024-06-27 22:53:48,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40142 conditions, 5158 events. 2613/5158 cut-off events. For 128445/128445 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 40993 event pairs, 779 based on Foata normal form. 2/4946 useless extension candidates. Maximal degree in co-relation 40003. Up to 4011 conditions per place. [2024-06-27 22:53:48,722 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 622 selfloop transitions, 66 changer transitions 0/695 dead transitions. [2024-06-27 22:53:48,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 695 transitions, 16641 flow [2024-06-27 22:53:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:53:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:53:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 22:53:48,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:53:48,724 INFO L175 Difference]: Start difference. First operand has 307 places, 669 transitions, 15082 flow. Second operand 8 states and 133 transitions. [2024-06-27 22:53:48,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 695 transitions, 16641 flow [2024-06-27 22:53:49,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 695 transitions, 16576 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 22:53:49,428 INFO L231 Difference]: Finished difference. Result has 310 places, 670 transitions, 15186 flow [2024-06-27 22:53:49,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=15017, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15186, PETRI_PLACES=310, PETRI_TRANSITIONS=670} [2024-06-27 22:53:49,429 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 271 predicate places. [2024-06-27 22:53:49,430 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 670 transitions, 15186 flow [2024-06-27 22:53:49,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:49,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:49,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:49,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:53:49,430 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:49,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1872505295, now seen corresponding path program 10 times [2024-06-27 22:53:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149401813] [2024-06-27 22:53:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149401813] [2024-06-27 22:53:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149401813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:50,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030747077] [2024-06-27 22:53:50,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:50,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:50,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:50,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 670 transitions, 15186 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:50,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:50,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:50,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:52,673 INFO L124 PetriNetUnfolderBase]: 2679/5304 cut-off events. [2024-06-27 22:53:52,674 INFO L125 PetriNetUnfolderBase]: For 135017/135017 co-relation queries the response was YES. [2024-06-27 22:53:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41433 conditions, 5304 events. 2679/5304 cut-off events. For 135017/135017 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 42447 event pairs, 766 based on Foata normal form. 3/5083 useless extension candidates. Maximal degree in co-relation 41293. Up to 3988 conditions per place. [2024-06-27 22:53:52,750 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 630 selfloop transitions, 95 changer transitions 0/732 dead transitions. [2024-06-27 22:53:52,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 732 transitions, 17455 flow [2024-06-27 22:53:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:53:52,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 22:53:52,751 INFO L175 Difference]: Start difference. First operand has 310 places, 670 transitions, 15186 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:53:52,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 732 transitions, 17455 flow [2024-06-27 22:53:53,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 732 transitions, 17385 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:53:53,437 INFO L231 Difference]: Finished difference. Result has 315 places, 682 transitions, 15685 flow [2024-06-27 22:53:53,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=15116, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15685, PETRI_PLACES=315, PETRI_TRANSITIONS=682} [2024-06-27 22:53:53,438 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 276 predicate places. [2024-06-27 22:53:53,438 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 682 transitions, 15685 flow [2024-06-27 22:53:53,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:53,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:53,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:53,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:53:53,439 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:53,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:53,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1009885259, now seen corresponding path program 11 times [2024-06-27 22:53:53,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:53,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316966246] [2024-06-27 22:53:53,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:53,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316966246] [2024-06-27 22:53:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316966246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:54,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:53:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042082028] [2024-06-27 22:53:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:54,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:53:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:53:54,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:53:55,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:55,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 682 transitions, 15685 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:55,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:55,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:55,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:56,620 INFO L124 PetriNetUnfolderBase]: 2735/5410 cut-off events. [2024-06-27 22:53:56,620 INFO L125 PetriNetUnfolderBase]: For 137979/137979 co-relation queries the response was YES. [2024-06-27 22:53:56,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42374 conditions, 5410 events. 2735/5410 cut-off events. For 137979/137979 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 43338 event pairs, 751 based on Foata normal form. 2/5187 useless extension candidates. Maximal degree in co-relation 42233. Up to 4128 conditions per place. [2024-06-27 22:53:56,690 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 618 selfloop transitions, 130 changer transitions 0/755 dead transitions. [2024-06-27 22:53:56,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 755 transitions, 18095 flow [2024-06-27 22:53:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 22:53:56,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-27 22:53:56,691 INFO L175 Difference]: Start difference. First operand has 315 places, 682 transitions, 15685 flow. Second operand 9 states and 159 transitions. [2024-06-27 22:53:56,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 755 transitions, 18095 flow [2024-06-27 22:53:57,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 755 transitions, 17766 flow, removed 78 selfloop flow, removed 7 redundant places. [2024-06-27 22:53:57,437 INFO L231 Difference]: Finished difference. Result has 320 places, 713 transitions, 16408 flow [2024-06-27 22:53:57,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=15356, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16408, PETRI_PLACES=320, PETRI_TRANSITIONS=713} [2024-06-27 22:53:57,438 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 281 predicate places. [2024-06-27 22:53:57,438 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 713 transitions, 16408 flow [2024-06-27 22:53:57,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:57,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:57,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:57,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:53:57,438 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:53:57,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1009885135, now seen corresponding path program 9 times [2024-06-27 22:53:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:57,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201501669] [2024-06-27 22:53:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:57,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:58,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:58,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201501669] [2024-06-27 22:53:58,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201501669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:58,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:58,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:58,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208237858] [2024-06-27 22:53:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:58,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:58,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:58,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:53:58,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 713 transitions, 16408 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:58,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:58,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:53:58,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:00,459 INFO L124 PetriNetUnfolderBase]: 2777/5494 cut-off events. [2024-06-27 22:54:00,459 INFO L125 PetriNetUnfolderBase]: For 138796/138796 co-relation queries the response was YES. [2024-06-27 22:54:00,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43633 conditions, 5494 events. 2777/5494 cut-off events. For 138796/138796 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 44223 event pairs, 773 based on Foata normal form. 2/5268 useless extension candidates. Maximal degree in co-relation 43488. Up to 4303 conditions per place. [2024-06-27 22:54:00,532 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 667 selfloop transitions, 76 changer transitions 0/750 dead transitions. [2024-06-27 22:54:00,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 750 transitions, 18208 flow [2024-06-27 22:54:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:54:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:54:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 22:54:00,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2024-06-27 22:54:00,533 INFO L175 Difference]: Start difference. First operand has 320 places, 713 transitions, 16408 flow. Second operand 8 states and 143 transitions. [2024-06-27 22:54:00,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 750 transitions, 18208 flow [2024-06-27 22:54:01,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 750 transitions, 18035 flow, removed 78 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:01,311 INFO L231 Difference]: Finished difference. Result has 325 places, 719 transitions, 16533 flow [2024-06-27 22:54:01,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=16235, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16533, PETRI_PLACES=325, PETRI_TRANSITIONS=719} [2024-06-27 22:54:01,312 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 286 predicate places. [2024-06-27 22:54:01,312 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 719 transitions, 16533 flow [2024-06-27 22:54:01,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:01,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:01,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:01,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:54:01,313 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:01,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1872332315, now seen corresponding path program 12 times [2024-06-27 22:54:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243515411] [2024-06-27 22:54:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:02,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243515411] [2024-06-27 22:54:02,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243515411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:02,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:02,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:54:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128763145] [2024-06-27 22:54:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:02,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:54:02,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:54:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:54:02,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:02,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 719 transitions, 16533 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:02,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:02,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:02,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:04,449 INFO L124 PetriNetUnfolderBase]: 2771/5491 cut-off events. [2024-06-27 22:54:04,449 INFO L125 PetriNetUnfolderBase]: For 136800/136800 co-relation queries the response was YES. [2024-06-27 22:54:04,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43364 conditions, 5491 events. 2771/5491 cut-off events. For 136800/136800 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 44343 event pairs, 798 based on Foata normal form. 3/5263 useless extension candidates. Maximal degree in co-relation 43217. Up to 4151 conditions per place. [2024-06-27 22:54:04,515 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 650 selfloop transitions, 106 changer transitions 0/763 dead transitions. [2024-06-27 22:54:04,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 763 transitions, 18445 flow [2024-06-27 22:54:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:54:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:54:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:54:04,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:54:04,517 INFO L175 Difference]: Start difference. First operand has 325 places, 719 transitions, 16533 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:54:04,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 763 transitions, 18445 flow [2024-06-27 22:54:05,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 763 transitions, 18237 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-27 22:54:05,331 INFO L231 Difference]: Finished difference. Result has 328 places, 719 transitions, 16558 flow [2024-06-27 22:54:05,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=16327, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16558, PETRI_PLACES=328, PETRI_TRANSITIONS=719} [2024-06-27 22:54:05,332 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 289 predicate places. [2024-06-27 22:54:05,332 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 719 transitions, 16558 flow [2024-06-27 22:54:05,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:05,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:05,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:05,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:54:05,332 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:05,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 890242750, now seen corresponding path program 1 times [2024-06-27 22:54:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971097173] [2024-06-27 22:54:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971097173] [2024-06-27 22:54:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971097173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391357109] [2024-06-27 22:54:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:05,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:05,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:54:05,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 719 transitions, 16558 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:05,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:05,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:54:05,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:06,288 INFO L124 PetriNetUnfolderBase]: 1682/3350 cut-off events. [2024-06-27 22:54:06,288 INFO L125 PetriNetUnfolderBase]: For 79112/79279 co-relation queries the response was YES. [2024-06-27 22:54:06,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26587 conditions, 3350 events. 1682/3350 cut-off events. For 79112/79279 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23610 event pairs, 289 based on Foata normal form. 333/3487 useless extension candidates. Maximal degree in co-relation 26454. Up to 1082 conditions per place. [2024-06-27 22:54:06,329 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 193 selfloop transitions, 176 changer transitions 0/440 dead transitions. [2024-06-27 22:54:06,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 440 transitions, 11031 flow [2024-06-27 22:54:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-27 22:54:06,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-06-27 22:54:06,331 INFO L175 Difference]: Start difference. First operand has 328 places, 719 transitions, 16558 flow. Second operand 4 states and 95 transitions. [2024-06-27 22:54:06,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 440 transitions, 11031 flow [2024-06-27 22:54:06,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 440 transitions, 8067 flow, removed 168 selfloop flow, removed 83 redundant places. [2024-06-27 22:54:06,679 INFO L231 Difference]: Finished difference. Result has 248 places, 405 transitions, 7624 flow [2024-06-27 22:54:06,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6914, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7624, PETRI_PLACES=248, PETRI_TRANSITIONS=405} [2024-06-27 22:54:06,682 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 209 predicate places. [2024-06-27 22:54:06,682 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 405 transitions, 7624 flow [2024-06-27 22:54:06,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:06,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:06,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:06,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:54:06,683 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:06,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1405290744, now seen corresponding path program 1 times [2024-06-27 22:54:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:06,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294366594] [2024-06-27 22:54:06,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294366594] [2024-06-27 22:54:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294366594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215472137] [2024-06-27 22:54:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:08,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:08,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:54:08,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 405 transitions, 7624 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:08,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:08,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:54:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:09,368 INFO L124 PetriNetUnfolderBase]: 1505/3040 cut-off events. [2024-06-27 22:54:09,368 INFO L125 PetriNetUnfolderBase]: For 60580/60597 co-relation queries the response was YES. [2024-06-27 22:54:09,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21316 conditions, 3040 events. 1505/3040 cut-off events. For 60580/60597 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 21255 event pairs, 296 based on Foata normal form. 11/2769 useless extension candidates. Maximal degree in co-relation 21217. Up to 1270 conditions per place. [2024-06-27 22:54:09,397 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 151 selfloop transitions, 273 changer transitions 0/443 dead transitions. [2024-06-27 22:54:09,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 443 transitions, 8818 flow [2024-06-27 22:54:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:54:09,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:54:09,398 INFO L175 Difference]: Start difference. First operand has 248 places, 405 transitions, 7624 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:54:09,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 443 transitions, 8818 flow [2024-06-27 22:54:09,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 443 transitions, 8630 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:09,669 INFO L231 Difference]: Finished difference. Result has 254 places, 405 transitions, 7990 flow [2024-06-27 22:54:09,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7436, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7990, PETRI_PLACES=254, PETRI_TRANSITIONS=405} [2024-06-27 22:54:09,669 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 215 predicate places. [2024-06-27 22:54:09,670 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 405 transitions, 7990 flow [2024-06-27 22:54:09,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:09,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:09,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:09,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:54:09,670 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:09,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -240752074, now seen corresponding path program 2 times [2024-06-27 22:54:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113717254] [2024-06-27 22:54:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:11,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113717254] [2024-06-27 22:54:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113717254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:11,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936056726] [2024-06-27 22:54:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:11,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:11,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:11,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:11,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 405 transitions, 7990 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:11,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:11,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:11,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:12,669 INFO L124 PetriNetUnfolderBase]: 1745/3538 cut-off events. [2024-06-27 22:54:12,670 INFO L125 PetriNetUnfolderBase]: For 81220/81223 co-relation queries the response was YES. [2024-06-27 22:54:12,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25473 conditions, 3538 events. 1745/3538 cut-off events. For 81220/81223 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 25387 event pairs, 475 based on Foata normal form. 11/3247 useless extension candidates. Maximal degree in co-relation 25373. Up to 2475 conditions per place. [2024-06-27 22:54:12,778 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 319 selfloop transitions, 125 changer transitions 0/452 dead transitions. [2024-06-27 22:54:12,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 452 transitions, 9376 flow [2024-06-27 22:54:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:54:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:54:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 211 transitions. [2024-06-27 22:54:12,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46373626373626375 [2024-06-27 22:54:12,781 INFO L175 Difference]: Start difference. First operand has 254 places, 405 transitions, 7990 flow. Second operand 13 states and 211 transitions. [2024-06-27 22:54:12,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 452 transitions, 9376 flow [2024-06-27 22:54:13,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 452 transitions, 8836 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:13,061 INFO L231 Difference]: Finished difference. Result has 260 places, 407 transitions, 7744 flow [2024-06-27 22:54:13,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7450, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7744, PETRI_PLACES=260, PETRI_TRANSITIONS=407} [2024-06-27 22:54:13,062 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 221 predicate places. [2024-06-27 22:54:13,062 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 407 transitions, 7744 flow [2024-06-27 22:54:13,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:13,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:13,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:13,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:54:13,063 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:13,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1271219044, now seen corresponding path program 3 times [2024-06-27 22:54:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579744071] [2024-06-27 22:54:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579744071] [2024-06-27 22:54:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579744071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:14,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:14,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143905024] [2024-06-27 22:54:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:14,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:14,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:14,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:14,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:14,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 407 transitions, 7744 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:14,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:15,961 INFO L124 PetriNetUnfolderBase]: 1688/3400 cut-off events. [2024-06-27 22:54:15,962 INFO L125 PetriNetUnfolderBase]: For 62605/62608 co-relation queries the response was YES. [2024-06-27 22:54:15,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23626 conditions, 3400 events. 1688/3400 cut-off events. For 62605/62608 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24053 event pairs, 473 based on Foata normal form. 13/3118 useless extension candidates. Maximal degree in co-relation 23524. Up to 2551 conditions per place. [2024-06-27 22:54:15,993 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 312 selfloop transitions, 121 changer transitions 0/441 dead transitions. [2024-06-27 22:54:15,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 441 transitions, 8880 flow [2024-06-27 22:54:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:54:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:54:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2024-06-27 22:54:15,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-27 22:54:15,995 INFO L175 Difference]: Start difference. First operand has 260 places, 407 transitions, 7744 flow. Second operand 12 states and 191 transitions. [2024-06-27 22:54:15,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 441 transitions, 8880 flow [2024-06-27 22:54:16,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 441 transitions, 8630 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:54:16,265 INFO L231 Difference]: Finished difference. Result has 263 places, 407 transitions, 7740 flow [2024-06-27 22:54:16,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7494, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7740, PETRI_PLACES=263, PETRI_TRANSITIONS=407} [2024-06-27 22:54:16,267 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 224 predicate places. [2024-06-27 22:54:16,267 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 407 transitions, 7740 flow [2024-06-27 22:54:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:16,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:16,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:54:16,268 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:16,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1527487978, now seen corresponding path program 4 times [2024-06-27 22:54:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108801662] [2024-06-27 22:54:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108801662] [2024-06-27 22:54:17,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108801662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:17,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:17,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599539931] [2024-06-27 22:54:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:17,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:17,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:17,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:17,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:54:17,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 407 transitions, 7740 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:17,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:17,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:54:17,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:18,704 INFO L124 PetriNetUnfolderBase]: 1716/3618 cut-off events. [2024-06-27 22:54:18,704 INFO L125 PetriNetUnfolderBase]: For 76194/76212 co-relation queries the response was YES. [2024-06-27 22:54:18,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24556 conditions, 3618 events. 1716/3618 cut-off events. For 76194/76212 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 27115 event pairs, 468 based on Foata normal form. 15/3311 useless extension candidates. Maximal degree in co-relation 24453. Up to 1705 conditions per place. [2024-06-27 22:54:18,737 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 150 selfloop transitions, 275 changer transitions 0/444 dead transitions. [2024-06-27 22:54:18,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 444 transitions, 8966 flow [2024-06-27 22:54:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-27 22:54:18,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 22:54:18,738 INFO L175 Difference]: Start difference. First operand has 263 places, 407 transitions, 7740 flow. Second operand 10 states and 182 transitions. [2024-06-27 22:54:18,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 444 transitions, 8966 flow [2024-06-27 22:54:19,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 444 transitions, 8794 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:19,058 INFO L231 Difference]: Finished difference. Result has 265 places, 407 transitions, 8128 flow [2024-06-27 22:54:19,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7568, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8128, PETRI_PLACES=265, PETRI_TRANSITIONS=407} [2024-06-27 22:54:19,058 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 226 predicate places. [2024-06-27 22:54:19,059 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 407 transitions, 8128 flow [2024-06-27 22:54:19,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:19,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:19,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:19,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:54:19,059 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:19,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1829654140, now seen corresponding path program 5 times [2024-06-27 22:54:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241936945] [2024-06-27 22:54:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:20,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241936945] [2024-06-27 22:54:20,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241936945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:20,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:20,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:20,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034666232] [2024-06-27 22:54:20,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:20,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:20,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:20,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:20,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:54:20,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 407 transitions, 8128 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:20,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:20,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:54:20,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:21,862 INFO L124 PetriNetUnfolderBase]: 1703/3597 cut-off events. [2024-06-27 22:54:21,863 INFO L125 PetriNetUnfolderBase]: For 69675/69689 co-relation queries the response was YES. [2024-06-27 22:54:21,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24606 conditions, 3597 events. 1703/3597 cut-off events. For 69675/69689 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 27041 event pairs, 520 based on Foata normal form. 17/3286 useless extension candidates. Maximal degree in co-relation 24502. Up to 2059 conditions per place. [2024-06-27 22:54:21,898 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 142 selfloop transitions, 273 changer transitions 0/434 dead transitions. [2024-06-27 22:54:21,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 434 transitions, 9134 flow [2024-06-27 22:54:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-27 22:54:21,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-27 22:54:21,900 INFO L175 Difference]: Start difference. First operand has 265 places, 407 transitions, 8128 flow. Second operand 10 states and 174 transitions. [2024-06-27 22:54:21,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 434 transitions, 9134 flow [2024-06-27 22:54:22,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 434 transitions, 8586 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 22:54:22,252 INFO L231 Difference]: Finished difference. Result has 266 places, 407 transitions, 8134 flow [2024-06-27 22:54:22,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7580, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8134, PETRI_PLACES=266, PETRI_TRANSITIONS=407} [2024-06-27 22:54:22,253 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 227 predicate places. [2024-06-27 22:54:22,253 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 407 transitions, 8134 flow [2024-06-27 22:54:22,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:22,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:22,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:54:22,254 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:22,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash -498804748, now seen corresponding path program 6 times [2024-06-27 22:54:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:22,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076409525] [2024-06-27 22:54:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076409525] [2024-06-27 22:54:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076409525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:24,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:54:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632734888] [2024-06-27 22:54:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:24,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:54:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:24,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:54:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:54:24,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:54:24,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 407 transitions, 8134 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:24,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:24,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:54:24,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:25,164 INFO L124 PetriNetUnfolderBase]: 1868/4033 cut-off events. [2024-06-27 22:54:25,164 INFO L125 PetriNetUnfolderBase]: For 85013/85036 co-relation queries the response was YES. [2024-06-27 22:54:25,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27047 conditions, 4033 events. 1868/4033 cut-off events. For 85013/85036 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 31790 event pairs, 638 based on Foata normal form. 13/3698 useless extension candidates. Maximal degree in co-relation 26943. Up to 2232 conditions per place. [2024-06-27 22:54:25,203 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 261 selfloop transitions, 164 changer transitions 0/444 dead transitions. [2024-06-27 22:54:25,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 444 transitions, 9362 flow [2024-06-27 22:54:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:54:25,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057142857142857 [2024-06-27 22:54:25,205 INFO L175 Difference]: Start difference. First operand has 266 places, 407 transitions, 8134 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:54:25,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 444 transitions, 9362 flow [2024-06-27 22:54:25,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 444 transitions, 8816 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 22:54:25,518 INFO L231 Difference]: Finished difference. Result has 267 places, 407 transitions, 7925 flow [2024-06-27 22:54:25,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7590, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7925, PETRI_PLACES=267, PETRI_TRANSITIONS=407} [2024-06-27 22:54:25,519 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 228 predicate places. [2024-06-27 22:54:25,519 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 407 transitions, 7925 flow [2024-06-27 22:54:25,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:25,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:25,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:25,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:54:25,520 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:25,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1916345950, now seen corresponding path program 7 times [2024-06-27 22:54:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:25,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900234358] [2024-06-27 22:54:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:27,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900234358] [2024-06-27 22:54:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900234358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:27,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674928390] [2024-06-27 22:54:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:27,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:27,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:27,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:27,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:54:27,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 407 transitions, 7925 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:27,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:27,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:54:27,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:28,170 INFO L124 PetriNetUnfolderBase]: 1932/4239 cut-off events. [2024-06-27 22:54:28,170 INFO L125 PetriNetUnfolderBase]: For 89428/89451 co-relation queries the response was YES. [2024-06-27 22:54:28,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27569 conditions, 4239 events. 1932/4239 cut-off events. For 89428/89451 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 34156 event pairs, 725 based on Foata normal form. 15/3873 useless extension candidates. Maximal degree in co-relation 27465. Up to 2884 conditions per place. [2024-06-27 22:54:28,212 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 244 selfloop transitions, 171 changer transitions 0/434 dead transitions. [2024-06-27 22:54:28,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 434 transitions, 8935 flow [2024-06-27 22:54:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:54:28,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2024-06-27 22:54:28,213 INFO L175 Difference]: Start difference. First operand has 267 places, 407 transitions, 7925 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:54:28,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 434 transitions, 8935 flow [2024-06-27 22:54:28,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 434 transitions, 8612 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:28,544 INFO L231 Difference]: Finished difference. Result has 269 places, 407 transitions, 7954 flow [2024-06-27 22:54:28,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7602, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7954, PETRI_PLACES=269, PETRI_TRANSITIONS=407} [2024-06-27 22:54:28,544 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 230 predicate places. [2024-06-27 22:54:28,545 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 407 transitions, 7954 flow [2024-06-27 22:54:28,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:28,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:28,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:28,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:54:28,545 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:28,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1523759236, now seen corresponding path program 1 times [2024-06-27 22:54:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:28,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625118902] [2024-06-27 22:54:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:30,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:30,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625118902] [2024-06-27 22:54:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625118902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:30,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170600990] [2024-06-27 22:54:30,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:30,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:30,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:30,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:30,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:30,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 407 transitions, 7954 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:30,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:30,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:30,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:31,634 INFO L124 PetriNetUnfolderBase]: 1951/4071 cut-off events. [2024-06-27 22:54:31,634 INFO L125 PetriNetUnfolderBase]: For 65378/65381 co-relation queries the response was YES. [2024-06-27 22:54:31,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27290 conditions, 4071 events. 1951/4071 cut-off events. For 65378/65381 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 30934 event pairs, 667 based on Foata normal form. 5/3736 useless extension candidates. Maximal degree in co-relation 27185. Up to 3119 conditions per place. [2024-06-27 22:54:31,670 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 295 selfloop transitions, 133 changer transitions 0/436 dead transitions. [2024-06-27 22:54:31,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 436 transitions, 9044 flow [2024-06-27 22:54:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:54:31,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 22:54:31,672 INFO L175 Difference]: Start difference. First operand has 269 places, 407 transitions, 7954 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:54:31,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 436 transitions, 9044 flow [2024-06-27 22:54:31,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 436 transitions, 8710 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:31,950 INFO L231 Difference]: Finished difference. Result has 271 places, 409 transitions, 7935 flow [2024-06-27 22:54:31,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7620, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7935, PETRI_PLACES=271, PETRI_TRANSITIONS=409} [2024-06-27 22:54:31,951 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 232 predicate places. [2024-06-27 22:54:31,951 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 409 transitions, 7935 flow [2024-06-27 22:54:31,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:31,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:31,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:31,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:54:31,952 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:31,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1824700238, now seen corresponding path program 2 times [2024-06-27 22:54:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756122563] [2024-06-27 22:54:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756122563] [2024-06-27 22:54:33,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756122563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:33,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:54:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751938855] [2024-06-27 22:54:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:33,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:54:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:54:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:54:33,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:33,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 409 transitions, 7935 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:33,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:33,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:33,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:34,883 INFO L124 PetriNetUnfolderBase]: 1971/4115 cut-off events. [2024-06-27 22:54:34,883 INFO L125 PetriNetUnfolderBase]: For 67881/67884 co-relation queries the response was YES. [2024-06-27 22:54:34,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27695 conditions, 4115 events. 1971/4115 cut-off events. For 67881/67884 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 31357 event pairs, 680 based on Foata normal form. 5/3778 useless extension candidates. Maximal degree in co-relation 27589. Up to 3148 conditions per place. [2024-06-27 22:54:34,921 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 303 selfloop transitions, 129 changer transitions 0/440 dead transitions. [2024-06-27 22:54:34,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 440 transitions, 9085 flow [2024-06-27 22:54:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:54:34,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 22:54:34,923 INFO L175 Difference]: Start difference. First operand has 271 places, 409 transitions, 7935 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:54:34,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 440 transitions, 9085 flow [2024-06-27 22:54:35,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 440 transitions, 8750 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:35,246 INFO L231 Difference]: Finished difference. Result has 273 places, 413 transitions, 7966 flow [2024-06-27 22:54:35,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7640, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7966, PETRI_PLACES=273, PETRI_TRANSITIONS=413} [2024-06-27 22:54:35,264 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 234 predicate places. [2024-06-27 22:54:35,265 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 413 transitions, 7966 flow [2024-06-27 22:54:35,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:35,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:35,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:35,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:54:35,265 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:35,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1957906894, now seen corresponding path program 8 times [2024-06-27 22:54:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:35,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836121108] [2024-06-27 22:54:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:37,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:37,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836121108] [2024-06-27 22:54:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836121108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:37,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:37,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326950904] [2024-06-27 22:54:37,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:37,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:37,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:37,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:37,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:37,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 413 transitions, 7966 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:37,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:37,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:38,564 INFO L124 PetriNetUnfolderBase]: 2087/4440 cut-off events. [2024-06-27 22:54:38,565 INFO L125 PetriNetUnfolderBase]: For 85124/85127 co-relation queries the response was YES. [2024-06-27 22:54:38,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29120 conditions, 4440 events. 2087/4440 cut-off events. For 85124/85127 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 34918 event pairs, 737 based on Foata normal form. 13/4095 useless extension candidates. Maximal degree in co-relation 29013. Up to 2914 conditions per place. [2024-06-27 22:54:38,611 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 290 selfloop transitions, 154 changer transitions 0/452 dead transitions. [2024-06-27 22:54:38,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 452 transitions, 9231 flow [2024-06-27 22:54:38,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 22:54:38,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-27 22:54:38,613 INFO L175 Difference]: Start difference. First operand has 273 places, 413 transitions, 7966 flow. Second operand 10 states and 166 transitions. [2024-06-27 22:54:38,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 452 transitions, 9231 flow [2024-06-27 22:54:38,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 452 transitions, 8976 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 22:54:38,935 INFO L231 Difference]: Finished difference. Result has 276 places, 413 transitions, 8043 flow [2024-06-27 22:54:38,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7713, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8043, PETRI_PLACES=276, PETRI_TRANSITIONS=413} [2024-06-27 22:54:38,935 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 237 predicate places. [2024-06-27 22:54:38,935 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 413 transitions, 8043 flow [2024-06-27 22:54:38,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:38,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:38,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:38,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:54:38,936 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:38,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash -105786254, now seen corresponding path program 3 times [2024-06-27 22:54:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33998214] [2024-06-27 22:54:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:40,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33998214] [2024-06-27 22:54:40,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33998214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:40,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:40,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:54:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440503798] [2024-06-27 22:54:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:40,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:54:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:40,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:54:40,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:54:40,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:40,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 413 transitions, 8043 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:40,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:40,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:40,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:42,095 INFO L124 PetriNetUnfolderBase]: 2100/4466 cut-off events. [2024-06-27 22:54:42,095 INFO L125 PetriNetUnfolderBase]: For 75677/75680 co-relation queries the response was YES. [2024-06-27 22:54:42,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29316 conditions, 4466 events. 2100/4466 cut-off events. For 75677/75680 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 35232 event pairs, 908 based on Foata normal form. 3/4100 useless extension candidates. Maximal degree in co-relation 29208. Up to 3585 conditions per place. [2024-06-27 22:54:42,135 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 374 selfloop transitions, 60 changer transitions 0/442 dead transitions. [2024-06-27 22:54:42,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 442 transitions, 9175 flow [2024-06-27 22:54:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 22:54:42,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2024-06-27 22:54:42,137 INFO L175 Difference]: Start difference. First operand has 276 places, 413 transitions, 8043 flow. Second operand 10 states and 163 transitions. [2024-06-27 22:54:42,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 442 transitions, 9175 flow [2024-06-27 22:54:42,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 442 transitions, 8887 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:42,477 INFO L231 Difference]: Finished difference. Result has 278 places, 415 transitions, 7932 flow [2024-06-27 22:54:42,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7755, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7932, PETRI_PLACES=278, PETRI_TRANSITIONS=415} [2024-06-27 22:54:42,477 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 239 predicate places. [2024-06-27 22:54:42,478 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 415 transitions, 7932 flow [2024-06-27 22:54:42,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:42,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:42,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:42,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:54:42,478 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:42,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1754890222, now seen corresponding path program 4 times [2024-06-27 22:54:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545986608] [2024-06-27 22:54:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545986608] [2024-06-27 22:54:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545986608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869474401] [2024-06-27 22:54:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:44,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:44,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:44,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 415 transitions, 7932 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:44,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:44,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:44,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:46,189 INFO L124 PetriNetUnfolderBase]: 2113/4486 cut-off events. [2024-06-27 22:54:46,190 INFO L125 PetriNetUnfolderBase]: For 77559/77562 co-relation queries the response was YES. [2024-06-27 22:54:46,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29533 conditions, 4486 events. 2113/4486 cut-off events. For 77559/77562 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 35366 event pairs, 945 based on Foata normal form. 3/4122 useless extension candidates. Maximal degree in co-relation 29424. Up to 3608 conditions per place. [2024-06-27 22:54:46,235 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 377 selfloop transitions, 62 changer transitions 0/447 dead transitions. [2024-06-27 22:54:46,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 447 transitions, 9098 flow [2024-06-27 22:54:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:54:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:54:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2024-06-27 22:54:46,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4452380952380952 [2024-06-27 22:54:46,237 INFO L175 Difference]: Start difference. First operand has 278 places, 415 transitions, 7932 flow. Second operand 12 states and 187 transitions. [2024-06-27 22:54:46,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 447 transitions, 9098 flow [2024-06-27 22:54:46,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 447 transitions, 8941 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:46,606 INFO L231 Difference]: Finished difference. Result has 282 places, 417 transitions, 7960 flow [2024-06-27 22:54:46,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7775, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7960, PETRI_PLACES=282, PETRI_TRANSITIONS=417} [2024-06-27 22:54:46,606 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 243 predicate places. [2024-06-27 22:54:46,606 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 417 transitions, 7960 flow [2024-06-27 22:54:46,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:46,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:46,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:54:46,607 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:46,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1819526614, now seen corresponding path program 9 times [2024-06-27 22:54:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:46,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515393649] [2024-06-27 22:54:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:48,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:48,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515393649] [2024-06-27 22:54:48,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515393649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:48,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:48,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:54:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226357357] [2024-06-27 22:54:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:48,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:54:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:54:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:54:48,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:54:48,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 417 transitions, 7960 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:48,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:48,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:54:48,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:49,984 INFO L124 PetriNetUnfolderBase]: 2144/4750 cut-off events. [2024-06-27 22:54:49,985 INFO L125 PetriNetUnfolderBase]: For 109393/109416 co-relation queries the response was YES. [2024-06-27 22:54:50,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30695 conditions, 4750 events. 2144/4750 cut-off events. For 109393/109416 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 39614 event pairs, 952 based on Foata normal form. 9/4356 useless extension candidates. Maximal degree in co-relation 30585. Up to 3080 conditions per place. [2024-06-27 22:54:50,029 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 331 selfloop transitions, 102 changer transitions 0/452 dead transitions. [2024-06-27 22:54:50,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 452 transitions, 9226 flow [2024-06-27 22:54:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 22:54:50,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942857142857143 [2024-06-27 22:54:50,030 INFO L175 Difference]: Start difference. First operand has 282 places, 417 transitions, 7960 flow. Second operand 10 states and 173 transitions. [2024-06-27 22:54:50,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 452 transitions, 9226 flow [2024-06-27 22:54:50,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 452 transitions, 9061 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-27 22:54:50,451 INFO L231 Difference]: Finished difference. Result has 282 places, 417 transitions, 8004 flow [2024-06-27 22:54:50,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7795, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8004, PETRI_PLACES=282, PETRI_TRANSITIONS=417} [2024-06-27 22:54:50,452 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 243 predicate places. [2024-06-27 22:54:50,452 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 417 transitions, 8004 flow [2024-06-27 22:54:50,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:50,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:50,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:50,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:54:50,453 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:50,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1819522894, now seen corresponding path program 10 times [2024-06-27 22:54:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490862509] [2024-06-27 22:54:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:52,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:52,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490862509] [2024-06-27 22:54:52,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490862509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:52,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:52,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130487701] [2024-06-27 22:54:52,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:52,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:52,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:52,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:52,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:54:52,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 417 transitions, 8004 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:52,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:52,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:54:52,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:53,286 INFO L124 PetriNetUnfolderBase]: 2207/4972 cut-off events. [2024-06-27 22:54:53,286 INFO L125 PetriNetUnfolderBase]: For 117180/117203 co-relation queries the response was YES. [2024-06-27 22:54:53,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31593 conditions, 4972 events. 2207/4972 cut-off events. For 117180/117203 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 42277 event pairs, 1049 based on Foata normal form. 11/4546 useless extension candidates. Maximal degree in co-relation 31482. Up to 3569 conditions per place. [2024-06-27 22:54:53,340 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 318 selfloop transitions, 105 changer transitions 0/442 dead transitions. [2024-06-27 22:54:53,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 442 transitions, 9032 flow [2024-06-27 22:54:53,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 22:54:53,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-27 22:54:53,341 INFO L175 Difference]: Start difference. First operand has 282 places, 417 transitions, 8004 flow. Second operand 10 states and 168 transitions. [2024-06-27 22:54:53,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 442 transitions, 9032 flow [2024-06-27 22:54:53,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 442 transitions, 8831 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:53,869 INFO L231 Difference]: Finished difference. Result has 284 places, 417 transitions, 8019 flow [2024-06-27 22:54:53,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7803, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8019, PETRI_PLACES=284, PETRI_TRANSITIONS=417} [2024-06-27 22:54:53,871 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 245 predicate places. [2024-06-27 22:54:53,871 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 417 transitions, 8019 flow [2024-06-27 22:54:53,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:53,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:53,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:53,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:54:53,872 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:53,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1819378744, now seen corresponding path program 11 times [2024-06-27 22:54:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103857286] [2024-06-27 22:54:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103857286] [2024-06-27 22:54:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103857286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:55,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:55,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:55,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245847968] [2024-06-27 22:54:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:55,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:55,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:55,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:55,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 417 transitions, 8019 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:55,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:55,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:55,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:57,150 INFO L124 PetriNetUnfolderBase]: 2354/5141 cut-off events. [2024-06-27 22:54:57,150 INFO L125 PetriNetUnfolderBase]: For 104212/104215 co-relation queries the response was YES. [2024-06-27 22:54:57,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32729 conditions, 5141 events. 2354/5141 cut-off events. For 104212/104215 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 42623 event pairs, 1084 based on Foata normal form. 11/4743 useless extension candidates. Maximal degree in co-relation 32617. Up to 3770 conditions per place. [2024-06-27 22:54:57,202 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 363 selfloop transitions, 86 changer transitions 0/457 dead transitions. [2024-06-27 22:54:57,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 457 transitions, 9326 flow [2024-06-27 22:54:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:54:57,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2024-06-27 22:54:57,204 INFO L175 Difference]: Start difference. First operand has 284 places, 417 transitions, 8019 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:54:57,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 457 transitions, 9326 flow [2024-06-27 22:54:57,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 457 transitions, 9120 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:57,678 INFO L231 Difference]: Finished difference. Result has 286 places, 417 transitions, 7999 flow [2024-06-27 22:54:57,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7813, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7999, PETRI_PLACES=286, PETRI_TRANSITIONS=417} [2024-06-27 22:54:57,678 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 247 predicate places. [2024-06-27 22:54:57,678 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 417 transitions, 7999 flow [2024-06-27 22:54:57,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:57,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:57,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:57,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:54:57,679 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:54:57,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1813801162, now seen corresponding path program 5 times [2024-06-27 22:54:57,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:57,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914166330] [2024-06-27 22:54:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914166330] [2024-06-27 22:54:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914166330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:59,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:59,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186306307] [2024-06-27 22:54:59,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:59,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:59,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:54:59,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 417 transitions, 7999 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:59,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:59,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:54:59,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:01,040 INFO L124 PetriNetUnfolderBase]: 2367/5155 cut-off events. [2024-06-27 22:55:01,040 INFO L125 PetriNetUnfolderBase]: For 91762/91765 co-relation queries the response was YES. [2024-06-27 22:55:01,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32892 conditions, 5155 events. 2367/5155 cut-off events. For 91762/91765 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 42714 event pairs, 1093 based on Foata normal form. 3/4744 useless extension candidates. Maximal degree in co-relation 32779. Up to 4050 conditions per place. [2024-06-27 22:55:01,092 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 373 selfloop transitions, 69 changer transitions 0/450 dead transitions. [2024-06-27 22:55:01,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 450 transitions, 9173 flow [2024-06-27 22:55:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:55:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:55:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 189 transitions. [2024-06-27 22:55:01,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 22:55:01,094 INFO L175 Difference]: Start difference. First operand has 286 places, 417 transitions, 7999 flow. Second operand 12 states and 189 transitions. [2024-06-27 22:55:01,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 450 transitions, 9173 flow [2024-06-27 22:55:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 450 transitions, 9013 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:01,544 INFO L231 Difference]: Finished difference. Result has 290 places, 419 transitions, 8041 flow [2024-06-27 22:55:01,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7839, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8041, PETRI_PLACES=290, PETRI_TRANSITIONS=419} [2024-06-27 22:55:01,544 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 251 predicate places. [2024-06-27 22:55:01,544 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 419 transitions, 8041 flow [2024-06-27 22:55:01,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:01,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:01,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:01,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:55:01,545 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:01,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1425649372, now seen corresponding path program 12 times [2024-06-27 22:55:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549813942] [2024-06-27 22:55:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:03,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-27 22:55:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549813942] [2024-06-27 22:55:03,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549813942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:03,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:03,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:03,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061144079] [2024-06-27 22:55:03,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:03,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:03,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:55:03,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 419 transitions, 8041 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:03,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:03,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:55:03,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:05,252 INFO L124 PetriNetUnfolderBase]: 2313/5283 cut-off events. [2024-06-27 22:55:05,252 INFO L125 PetriNetUnfolderBase]: For 110628/110651 co-relation queries the response was YES. [2024-06-27 22:55:05,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32731 conditions, 5283 events. 2313/5283 cut-off events. For 110628/110651 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 45972 event pairs, 1123 based on Foata normal form. 11/4833 useless extension candidates. Maximal degree in co-relation 32617. Up to 3733 conditions per place. [2024-06-27 22:55:05,310 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 338 selfloop transitions, 90 changer transitions 0/447 dead transitions. [2024-06-27 22:55:05,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 447 transitions, 9093 flow [2024-06-27 22:55:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:55:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:55:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2024-06-27 22:55:05,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 22:55:05,312 INFO L175 Difference]: Start difference. First operand has 290 places, 419 transitions, 8041 flow. Second operand 12 states and 190 transitions. [2024-06-27 22:55:05,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 447 transitions, 9093 flow [2024-06-27 22:55:05,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 447 transitions, 8909 flow, removed 25 selfloop flow, removed 10 redundant places. [2024-06-27 22:55:05,929 INFO L231 Difference]: Finished difference. Result has 292 places, 419 transitions, 8051 flow [2024-06-27 22:55:05,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7857, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8051, PETRI_PLACES=292, PETRI_TRANSITIONS=419} [2024-06-27 22:55:05,930 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 253 predicate places. [2024-06-27 22:55:05,930 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 419 transitions, 8051 flow [2024-06-27 22:55:05,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:05,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:05,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:05,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:55:05,931 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:05,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1025127882, now seen corresponding path program 6 times [2024-06-27 22:55:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:05,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46004426] [2024-06-27 22:55:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:07,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46004426] [2024-06-27 22:55:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46004426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:07,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:07,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:07,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182769804] [2024-06-27 22:55:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:07,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:07,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:07,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 419 transitions, 8051 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:07,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:07,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:07,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:09,118 INFO L124 PetriNetUnfolderBase]: 2514/5554 cut-off events. [2024-06-27 22:55:09,118 INFO L125 PetriNetUnfolderBase]: For 101289/101292 co-relation queries the response was YES. [2024-06-27 22:55:09,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34950 conditions, 5554 events. 2514/5554 cut-off events. For 101289/101292 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 47328 event pairs, 1396 based on Foata normal form. 3/5116 useless extension candidates. Maximal degree in co-relation 34835. Up to 4320 conditions per place. [2024-06-27 22:55:09,176 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 337 selfloop transitions, 100 changer transitions 0/445 dead transitions. [2024-06-27 22:55:09,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 445 transitions, 9151 flow [2024-06-27 22:55:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:55:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:55:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-27 22:55:09,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-27 22:55:09,177 INFO L175 Difference]: Start difference. First operand has 292 places, 419 transitions, 8051 flow. Second operand 9 states and 146 transitions. [2024-06-27 22:55:09,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 445 transitions, 9151 flow [2024-06-27 22:55:09,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 445 transitions, 8983 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:55:09,685 INFO L231 Difference]: Finished difference. Result has 291 places, 422 transitions, 8140 flow [2024-06-27 22:55:09,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7883, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8140, PETRI_PLACES=291, PETRI_TRANSITIONS=422} [2024-06-27 22:55:09,685 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 252 predicate places. [2024-06-27 22:55:09,686 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 422 transitions, 8140 flow [2024-06-27 22:55:09,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:09,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:09,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:09,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:55:09,686 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:09,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:09,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1746068908, now seen corresponding path program 7 times [2024-06-27 22:55:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610427549] [2024-06-27 22:55:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610427549] [2024-06-27 22:55:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610427549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685284483] [2024-06-27 22:55:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:11,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:11,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:11,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:11,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:11,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 422 transitions, 8140 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:11,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:11,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:11,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:12,955 INFO L124 PetriNetUnfolderBase]: 2538/5612 cut-off events. [2024-06-27 22:55:12,955 INFO L125 PetriNetUnfolderBase]: For 104451/104454 co-relation queries the response was YES. [2024-06-27 22:55:12,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35454 conditions, 5612 events. 2538/5612 cut-off events. For 104451/104454 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 47979 event pairs, 1408 based on Foata normal form. 3/5170 useless extension candidates. Maximal degree in co-relation 35338. Up to 4456 conditions per place. [2024-06-27 22:55:13,014 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 382 selfloop transitions, 59 changer transitions 0/449 dead transitions. [2024-06-27 22:55:13,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 449 transitions, 9284 flow [2024-06-27 22:55:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:55:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:55:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-27 22:55:13,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-27 22:55:13,015 INFO L175 Difference]: Start difference. First operand has 291 places, 422 transitions, 8140 flow. Second operand 9 states and 146 transitions. [2024-06-27 22:55:13,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 449 transitions, 9284 flow [2024-06-27 22:55:13,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 449 transitions, 9090 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 22:55:13,512 INFO L231 Difference]: Finished difference. Result has 294 places, 424 transitions, 8112 flow [2024-06-27 22:55:13,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7946, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8112, PETRI_PLACES=294, PETRI_TRANSITIONS=424} [2024-06-27 22:55:13,514 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 255 predicate places. [2024-06-27 22:55:13,514 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 424 transitions, 8112 flow [2024-06-27 22:55:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:13,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:13,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:13,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:55:13,514 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:13,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1864311992, now seen corresponding path program 8 times [2024-06-27 22:55:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:13,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045542033] [2024-06-27 22:55:13,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:13,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:15,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045542033] [2024-06-27 22:55:15,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045542033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:15,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:15,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:55:15,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348895183] [2024-06-27 22:55:15,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:15,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:55:15,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:55:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:55:15,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:15,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 424 transitions, 8112 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:15,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:15,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:15,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:17,720 INFO L124 PetriNetUnfolderBase]: 2724/6057 cut-off events. [2024-06-27 22:55:17,721 INFO L125 PetriNetUnfolderBase]: For 110491/110494 co-relation queries the response was YES. [2024-06-27 22:55:17,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37884 conditions, 6057 events. 2724/6057 cut-off events. For 110491/110494 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 52881 event pairs, 1484 based on Foata normal form. 3/5580 useless extension candidates. Maximal degree in co-relation 37767. Up to 4534 conditions per place. [2024-06-27 22:55:17,782 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 391 selfloop transitions, 79 changer transitions 0/478 dead transitions. [2024-06-27 22:55:17,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 478 transitions, 9662 flow [2024-06-27 22:55:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:55:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:55:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 211 transitions. [2024-06-27 22:55:17,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4306122448979592 [2024-06-27 22:55:17,783 INFO L175 Difference]: Start difference. First operand has 294 places, 424 transitions, 8112 flow. Second operand 14 states and 211 transitions. [2024-06-27 22:55:17,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 478 transitions, 9662 flow [2024-06-27 22:55:18,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 478 transitions, 9536 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 22:55:18,366 INFO L231 Difference]: Finished difference. Result has 303 places, 443 transitions, 8515 flow [2024-06-27 22:55:18,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7986, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8515, PETRI_PLACES=303, PETRI_TRANSITIONS=443} [2024-06-27 22:55:18,367 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 264 predicate places. [2024-06-27 22:55:18,367 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 443 transitions, 8515 flow [2024-06-27 22:55:18,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:18,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:18,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:18,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 22:55:18,368 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:18,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1797832030, now seen corresponding path program 9 times [2024-06-27 22:55:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:18,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100355050] [2024-06-27 22:55:18,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:18,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100355050] [2024-06-27 22:55:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100355050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:20,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477183854] [2024-06-27 22:55:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:20,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:20,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:20,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:20,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:20,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 443 transitions, 8515 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:20,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:20,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:20,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:21,796 INFO L124 PetriNetUnfolderBase]: 2748/6106 cut-off events. [2024-06-27 22:55:21,796 INFO L125 PetriNetUnfolderBase]: For 115119/115122 co-relation queries the response was YES. [2024-06-27 22:55:21,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38811 conditions, 6106 events. 2748/6106 cut-off events. For 115119/115122 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 53327 event pairs, 1472 based on Foata normal form. 3/5624 useless extension candidates. Maximal degree in co-relation 38691. Up to 4736 conditions per place. [2024-06-27 22:55:21,846 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 402 selfloop transitions, 68 changer transitions 0/478 dead transitions. [2024-06-27 22:55:21,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 478 transitions, 9769 flow [2024-06-27 22:55:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:55:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:55:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-27 22:55:21,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 22:55:21,848 INFO L175 Difference]: Start difference. First operand has 303 places, 443 transitions, 8515 flow. Second operand 12 states and 182 transitions. [2024-06-27 22:55:21,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 478 transitions, 9769 flow [2024-06-27 22:55:22,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 478 transitions, 9673 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-27 22:55:22,412 INFO L231 Difference]: Finished difference. Result has 306 places, 445 transitions, 8605 flow [2024-06-27 22:55:22,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8419, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8605, PETRI_PLACES=306, PETRI_TRANSITIONS=445} [2024-06-27 22:55:22,413 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 267 predicate places. [2024-06-27 22:55:22,413 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 445 transitions, 8605 flow [2024-06-27 22:55:22,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:22,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:22,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:22,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 22:55:22,414 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:22,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1887937388, now seen corresponding path program 13 times [2024-06-27 22:55:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494323934] [2024-06-27 22:55:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494323934] [2024-06-27 22:55:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494323934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:23,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822725751] [2024-06-27 22:55:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:23,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:24,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:24,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 445 transitions, 8605 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:24,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:24,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:24,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:25,615 INFO L124 PetriNetUnfolderBase]: 2864/6427 cut-off events. [2024-06-27 22:55:25,615 INFO L125 PetriNetUnfolderBase]: For 138439/138442 co-relation queries the response was YES. [2024-06-27 22:55:25,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40411 conditions, 6427 events. 2864/6427 cut-off events. For 138439/138442 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 57195 event pairs, 1574 based on Foata normal form. 11/5926 useless extension candidates. Maximal degree in co-relation 40289. Up to 4856 conditions per place. [2024-06-27 22:55:25,702 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 414 selfloop transitions, 50 changer transitions 0/472 dead transitions. [2024-06-27 22:55:25,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 472 transitions, 9792 flow [2024-06-27 22:55:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:55:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:55:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2024-06-27 22:55:25,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2024-06-27 22:55:25,704 INFO L175 Difference]: Start difference. First operand has 306 places, 445 transitions, 8605 flow. Second operand 10 states and 152 transitions. [2024-06-27 22:55:25,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 472 transitions, 9792 flow [2024-06-27 22:55:26,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 472 transitions, 9653 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 22:55:26,417 INFO L231 Difference]: Finished difference. Result has 307 places, 445 transitions, 8587 flow [2024-06-27 22:55:26,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8466, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8587, PETRI_PLACES=307, PETRI_TRANSITIONS=445} [2024-06-27 22:55:26,417 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 268 predicate places. [2024-06-27 22:55:26,417 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 445 transitions, 8587 flow [2024-06-27 22:55:26,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:26,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:26,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:26,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 22:55:26,418 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:26,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1841477928, now seen corresponding path program 10 times [2024-06-27 22:55:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656719268] [2024-06-27 22:55:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:27,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656719268] [2024-06-27 22:55:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656719268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:27,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:27,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:27,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553146026] [2024-06-27 22:55:27,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:27,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:27,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:27,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 445 transitions, 8587 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:27,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:27,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:27,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:29,409 INFO L124 PetriNetUnfolderBase]: 2881/6457 cut-off events. [2024-06-27 22:55:29,410 INFO L125 PetriNetUnfolderBase]: For 121370/121373 co-relation queries the response was YES. [2024-06-27 22:55:29,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40563 conditions, 6457 events. 2881/6457 cut-off events. For 121370/121373 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 57407 event pairs, 1575 based on Foata normal form. 3/5975 useless extension candidates. Maximal degree in co-relation 40440. Up to 5167 conditions per place. [2024-06-27 22:55:29,482 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 446 selfloop transitions, 14 changer transitions 0/468 dead transitions. [2024-06-27 22:55:29,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 468 transitions, 9725 flow [2024-06-27 22:55:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:55:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:55:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-27 22:55:29,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-27 22:55:29,484 INFO L175 Difference]: Start difference. First operand has 307 places, 445 transitions, 8587 flow. Second operand 9 states and 138 transitions. [2024-06-27 22:55:29,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 468 transitions, 9725 flow [2024-06-27 22:55:30,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 468 transitions, 9644 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:30,255 INFO L231 Difference]: Finished difference. Result has 308 places, 446 transitions, 8578 flow [2024-06-27 22:55:30,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8506, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8578, PETRI_PLACES=308, PETRI_TRANSITIONS=446} [2024-06-27 22:55:30,256 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 269 predicate places. [2024-06-27 22:55:30,256 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 446 transitions, 8578 flow [2024-06-27 22:55:30,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:30,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:30,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:30,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 22:55:30,256 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:30,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1546972038, now seen corresponding path program 11 times [2024-06-27 22:55:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033751956] [2024-06-27 22:55:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033751956] [2024-06-27 22:55:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033751956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666309964] [2024-06-27 22:55:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:31,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:31,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 446 transitions, 8578 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:31,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:31,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:31,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:33,477 INFO L124 PetriNetUnfolderBase]: 2898/6504 cut-off events. [2024-06-27 22:55:33,477 INFO L125 PetriNetUnfolderBase]: For 124538/124541 co-relation queries the response was YES. [2024-06-27 22:55:33,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40985 conditions, 6504 events. 2898/6504 cut-off events. For 124538/124541 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 58051 event pairs, 1608 based on Foata normal form. 3/5985 useless extension candidates. Maximal degree in co-relation 40861. Up to 5202 conditions per place. [2024-06-27 22:55:33,537 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 425 selfloop transitions, 33 changer transitions 0/466 dead transitions. [2024-06-27 22:55:33,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 466 transitions, 9697 flow [2024-06-27 22:55:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:55:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:55:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-27 22:55:33,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-27 22:55:33,538 INFO L175 Difference]: Start difference. First operand has 308 places, 446 transitions, 8578 flow. Second operand 10 states and 147 transitions. [2024-06-27 22:55:33,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 466 transitions, 9697 flow [2024-06-27 22:55:34,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 466 transitions, 9651 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 22:55:34,211 INFO L231 Difference]: Finished difference. Result has 311 places, 447 transitions, 8648 flow [2024-06-27 22:55:34,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8532, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8648, PETRI_PLACES=311, PETRI_TRANSITIONS=447} [2024-06-27 22:55:34,212 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 272 predicate places. [2024-06-27 22:55:34,212 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 447 transitions, 8648 flow [2024-06-27 22:55:34,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:34,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:34,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:34,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 22:55:34,212 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:34,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1547181288, now seen corresponding path program 12 times [2024-06-27 22:55:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538144632] [2024-06-27 22:55:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538144632] [2024-06-27 22:55:35,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538144632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:35,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:35,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:35,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539718419] [2024-06-27 22:55:35,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:35,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:35,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:35,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:35,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:36,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:36,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 447 transitions, 8648 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:36,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:36,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:36,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:37,599 INFO L124 PetriNetUnfolderBase]: 2915/6536 cut-off events. [2024-06-27 22:55:37,600 INFO L125 PetriNetUnfolderBase]: For 127412/127415 co-relation queries the response was YES. [2024-06-27 22:55:37,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41316 conditions, 6536 events. 2915/6536 cut-off events. For 127412/127415 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 58374 event pairs, 1602 based on Foata normal form. 3/6017 useless extension candidates. Maximal degree in co-relation 41191. Up to 5175 conditions per place. [2024-06-27 22:55:37,675 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 434 selfloop transitions, 30 changer transitions 0/472 dead transitions. [2024-06-27 22:55:37,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 472 transitions, 9835 flow [2024-06-27 22:55:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:55:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:55:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-27 22:55:37,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43142857142857144 [2024-06-27 22:55:37,676 INFO L175 Difference]: Start difference. First operand has 311 places, 447 transitions, 8648 flow. Second operand 10 states and 151 transitions. [2024-06-27 22:55:37,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 472 transitions, 9835 flow [2024-06-27 22:55:38,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 472 transitions, 9749 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-27 22:55:38,508 INFO L231 Difference]: Finished difference. Result has 312 places, 448 transitions, 8670 flow [2024-06-27 22:55:38,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8562, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8670, PETRI_PLACES=312, PETRI_TRANSITIONS=448} [2024-06-27 22:55:38,509 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 273 predicate places. [2024-06-27 22:55:38,509 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 448 transitions, 8670 flow [2024-06-27 22:55:38,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:38,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:38,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:38,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 22:55:38,509 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:38,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2087233226, now seen corresponding path program 13 times [2024-06-27 22:55:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350624504] [2024-06-27 22:55:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:40,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350624504] [2024-06-27 22:55:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350624504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143226248] [2024-06-27 22:55:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:40,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:40,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:40,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:40,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 448 transitions, 8670 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:40,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:40,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:40,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:41,965 INFO L124 PetriNetUnfolderBase]: 2932/6588 cut-off events. [2024-06-27 22:55:41,965 INFO L125 PetriNetUnfolderBase]: For 129775/129778 co-relation queries the response was YES. [2024-06-27 22:55:42,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41661 conditions, 6588 events. 2932/6588 cut-off events. For 129775/129778 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 59022 event pairs, 1612 based on Foata normal form. 3/6066 useless extension candidates. Maximal degree in co-relation 41535. Up to 5216 conditions per place. [2024-06-27 22:55:42,029 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 406 selfloop transitions, 58 changer transitions 0/472 dead transitions. [2024-06-27 22:55:42,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 472 transitions, 9860 flow [2024-06-27 22:55:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:55:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:55:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-27 22:55:42,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2024-06-27 22:55:42,031 INFO L175 Difference]: Start difference. First operand has 312 places, 448 transitions, 8670 flow. Second operand 9 states and 142 transitions. [2024-06-27 22:55:42,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 472 transitions, 9860 flow [2024-06-27 22:55:42,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 472 transitions, 9778 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:42,808 INFO L231 Difference]: Finished difference. Result has 313 places, 449 transitions, 8756 flow [2024-06-27 22:55:42,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8588, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8756, PETRI_PLACES=313, PETRI_TRANSITIONS=449} [2024-06-27 22:55:42,809 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 274 predicate places. [2024-06-27 22:55:42,809 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 449 transitions, 8756 flow [2024-06-27 22:55:42,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:42,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:42,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:42,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 22:55:42,809 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:42,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2087239178, now seen corresponding path program 14 times [2024-06-27 22:55:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:42,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449801812] [2024-06-27 22:55:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449801812] [2024-06-27 22:55:44,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449801812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:44,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:44,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:55:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312861348] [2024-06-27 22:55:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:44,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:55:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:55:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:55:44,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:44,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 449 transitions, 8756 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:44,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:44,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:44,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:46,600 INFO L124 PetriNetUnfolderBase]: 3048/6909 cut-off events. [2024-06-27 22:55:46,600 INFO L125 PetriNetUnfolderBase]: For 154117/154120 co-relation queries the response was YES. [2024-06-27 22:55:46,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43094 conditions, 6909 events. 3048/6909 cut-off events. For 154117/154120 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 62883 event pairs, 1687 based on Foata normal form. 11/6376 useless extension candidates. Maximal degree in co-relation 42967. Up to 5180 conditions per place. [2024-06-27 22:55:46,682 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 405 selfloop transitions, 69 changer transitions 0/482 dead transitions. [2024-06-27 22:55:46,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 482 transitions, 10036 flow [2024-06-27 22:55:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:55:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:55:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:55:46,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542857142857143 [2024-06-27 22:55:46,684 INFO L175 Difference]: Start difference. First operand has 313 places, 449 transitions, 8756 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:55:46,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 482 transitions, 10036 flow [2024-06-27 22:55:47,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 482 transitions, 9898 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 22:55:47,735 INFO L231 Difference]: Finished difference. Result has 316 places, 449 transitions, 8770 flow [2024-06-27 22:55:47,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8618, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8770, PETRI_PLACES=316, PETRI_TRANSITIONS=449} [2024-06-27 22:55:47,736 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 277 predicate places. [2024-06-27 22:55:47,736 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 449 transitions, 8770 flow [2024-06-27 22:55:47,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:47,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:47,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:47,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 22:55:47,737 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:47,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2087387048, now seen corresponding path program 15 times [2024-06-27 22:55:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111466133] [2024-06-27 22:55:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111466133] [2024-06-27 22:55:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111466133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:55:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398162459] [2024-06-27 22:55:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:49,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:55:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:55:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:55:49,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:49,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 449 transitions, 8770 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:49,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:49,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:49,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:51,273 INFO L124 PetriNetUnfolderBase]: 3146/7021 cut-off events. [2024-06-27 22:55:51,273 INFO L125 PetriNetUnfolderBase]: For 167801/167804 co-relation queries the response was YES. [2024-06-27 22:55:51,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44441 conditions, 7021 events. 3146/7021 cut-off events. For 167801/167804 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 63765 event pairs, 1678 based on Foata normal form. 9/6495 useless extension candidates. Maximal degree in co-relation 44313. Up to 4455 conditions per place. [2024-06-27 22:55:51,355 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 365 selfloop transitions, 123 changer transitions 0/496 dead transitions. [2024-06-27 22:55:51,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 496 transitions, 10376 flow [2024-06-27 22:55:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:55:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:55:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:55:51,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48857142857142855 [2024-06-27 22:55:51,356 INFO L175 Difference]: Start difference. First operand has 316 places, 449 transitions, 8770 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:55:51,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 496 transitions, 10376 flow [2024-06-27 22:55:52,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 496 transitions, 10250 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:52,386 INFO L231 Difference]: Finished difference. Result has 318 places, 449 transitions, 8895 flow [2024-06-27 22:55:52,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8644, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8895, PETRI_PLACES=318, PETRI_TRANSITIONS=449} [2024-06-27 22:55:52,387 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 279 predicate places. [2024-06-27 22:55:52,387 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 449 transitions, 8895 flow [2024-06-27 22:55:52,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:52,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:52,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:52,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 22:55:52,388 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:52,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2087383328, now seen corresponding path program 16 times [2024-06-27 22:55:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:52,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521067884] [2024-06-27 22:55:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521067884] [2024-06-27 22:55:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521067884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504725448] [2024-06-27 22:55:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:53,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:53,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:54,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:54,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 449 transitions, 8895 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:54,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:54,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:54,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:56,078 INFO L124 PetriNetUnfolderBase]: 3217/7356 cut-off events. [2024-06-27 22:55:56,078 INFO L125 PetriNetUnfolderBase]: For 179363/179366 co-relation queries the response was YES. [2024-06-27 22:55:56,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45798 conditions, 7356 events. 3217/7356 cut-off events. For 179363/179366 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 68259 event pairs, 1826 based on Foata normal form. 11/6790 useless extension candidates. Maximal degree in co-relation 45669. Up to 5657 conditions per place. [2024-06-27 22:55:56,153 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 403 selfloop transitions, 71 changer transitions 0/482 dead transitions. [2024-06-27 22:55:56,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 482 transitions, 10175 flow [2024-06-27 22:55:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:55:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:55:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:55:56,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 22:55:56,155 INFO L175 Difference]: Start difference. First operand has 318 places, 449 transitions, 8895 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:55:56,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 482 transitions, 10175 flow [2024-06-27 22:55:57,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 482 transitions, 9932 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:57,164 INFO L231 Difference]: Finished difference. Result has 319 places, 449 transitions, 8800 flow [2024-06-27 22:55:57,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8652, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8800, PETRI_PLACES=319, PETRI_TRANSITIONS=449} [2024-06-27 22:55:57,165 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 280 predicate places. [2024-06-27 22:55:57,165 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 449 transitions, 8800 flow [2024-06-27 22:55:57,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:57,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:57,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:57,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 22:55:57,166 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:55:57,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1663067666, now seen corresponding path program 14 times [2024-06-27 22:55:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198197268] [2024-06-27 22:55:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198197268] [2024-06-27 22:55:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198197268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:58,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:58,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361571670] [2024-06-27 22:55:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:58,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:58,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:58,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:58,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:55:58,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 449 transitions, 8800 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:58,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:58,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:55:58,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:00,592 INFO L124 PetriNetUnfolderBase]: 3190/7274 cut-off events. [2024-06-27 22:56:00,592 INFO L125 PetriNetUnfolderBase]: For 142406/142409 co-relation queries the response was YES. [2024-06-27 22:56:00,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45113 conditions, 7274 events. 3190/7274 cut-off events. For 142406/142409 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 67242 event pairs, 1795 based on Foata normal form. 3/6703 useless extension candidates. Maximal degree in co-relation 44983. Up to 5734 conditions per place. [2024-06-27 22:56:00,672 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 413 selfloop transitions, 52 changer transitions 0/473 dead transitions. [2024-06-27 22:56:00,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 473 transitions, 10003 flow [2024-06-27 22:56:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:56:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:56:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-27 22:56:00,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-27 22:56:00,674 INFO L175 Difference]: Start difference. First operand has 319 places, 449 transitions, 8800 flow. Second operand 9 states and 141 transitions. [2024-06-27 22:56:00,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 473 transitions, 10003 flow [2024-06-27 22:56:01,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 473 transitions, 9892 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 22:56:01,577 INFO L231 Difference]: Finished difference. Result has 322 places, 450 transitions, 8847 flow [2024-06-27 22:56:01,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8689, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8847, PETRI_PLACES=322, PETRI_TRANSITIONS=450} [2024-06-27 22:56:01,577 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 283 predicate places. [2024-06-27 22:56:01,578 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 450 transitions, 8847 flow [2024-06-27 22:56:01,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:01,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:01,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:01,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 22:56:01,592 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:01,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2081661596, now seen corresponding path program 15 times [2024-06-27 22:56:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:01,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525153527] [2024-06-27 22:56:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525153527] [2024-06-27 22:56:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525153527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:56:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851083941] [2024-06-27 22:56:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:03,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:56:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:56:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:56:03,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:56:03,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 450 transitions, 8847 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:03,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:03,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:56:03,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:05,119 INFO L124 PetriNetUnfolderBase]: 3191/7282 cut-off events. [2024-06-27 22:56:05,120 INFO L125 PetriNetUnfolderBase]: For 139692/139695 co-relation queries the response was YES. [2024-06-27 22:56:05,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45051 conditions, 7282 events. 3191/7282 cut-off events. For 139692/139695 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 67344 event pairs, 1803 based on Foata normal form. 3/6711 useless extension candidates. Maximal degree in co-relation 44920. Up to 5658 conditions per place. [2024-06-27 22:56:05,201 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 416 selfloop transitions, 53 changer transitions 0/477 dead transitions. [2024-06-27 22:56:05,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 477 transitions, 10084 flow [2024-06-27 22:56:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:56:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:56:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-27 22:56:05,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 22:56:05,202 INFO L175 Difference]: Start difference. First operand has 322 places, 450 transitions, 8847 flow. Second operand 9 states and 144 transitions. [2024-06-27 22:56:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 477 transitions, 10084 flow [2024-06-27 22:56:06,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 477 transitions, 9994 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 22:56:06,123 INFO L231 Difference]: Finished difference. Result has 326 places, 451 transitions, 8917 flow [2024-06-27 22:56:06,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8757, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8917, PETRI_PLACES=326, PETRI_TRANSITIONS=451} [2024-06-27 22:56:06,124 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 287 predicate places. [2024-06-27 22:56:06,124 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 451 transitions, 8917 flow [2024-06-27 22:56:06,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:06,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:06,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:06,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 22:56:06,125 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:06,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1662859904, now seen corresponding path program 17 times [2024-06-27 22:56:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:06,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415954898] [2024-06-27 22:56:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:07,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415954898] [2024-06-27 22:56:07,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415954898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:07,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:56:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794425085] [2024-06-27 22:56:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:07,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:56:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:56:07,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:56:07,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:56:07,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 451 transitions, 8917 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:07,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:07,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:56:07,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:09,967 INFO L124 PetriNetUnfolderBase]: 3222/7380 cut-off events. [2024-06-27 22:56:09,967 INFO L125 PetriNetUnfolderBase]: For 151493/151496 co-relation queries the response was YES. [2024-06-27 22:56:10,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45022 conditions, 7380 events. 3222/7380 cut-off events. For 151493/151496 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 68569 event pairs, 1818 based on Foata normal form. 11/6813 useless extension candidates. Maximal degree in co-relation 44890. Up to 5534 conditions per place. [2024-06-27 22:56:10,038 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 413 selfloop transitions, 63 changer transitions 0/484 dead transitions. [2024-06-27 22:56:10,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 484 transitions, 10210 flow [2024-06-27 22:56:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:56:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:56:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:56:10,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 22:56:10,039 INFO L175 Difference]: Start difference. First operand has 326 places, 451 transitions, 8917 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:56:10,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 484 transitions, 10210 flow [2024-06-27 22:56:10,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 484 transitions, 10055 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:56:10,870 INFO L231 Difference]: Finished difference. Result has 329 places, 451 transitions, 8902 flow [2024-06-27 22:56:10,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8762, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8902, PETRI_PLACES=329, PETRI_TRANSITIONS=451} [2024-06-27 22:56:10,871 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 290 predicate places. [2024-06-27 22:56:10,871 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 451 transitions, 8902 flow [2024-06-27 22:56:10,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:10,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:10,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:10,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 22:56:10,872 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:10,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1721691648, now seen corresponding path program 1 times [2024-06-27 22:56:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568472512] [2024-06-27 22:56:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568472512] [2024-06-27 22:56:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568472512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:13,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:13,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:56:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559141061] [2024-06-27 22:56:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:13,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:56:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:56:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:56:13,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:56:13,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 451 transitions, 8902 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:13,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:13,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:56:13,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:15,068 INFO L124 PetriNetUnfolderBase]: 3009/7180 cut-off events. [2024-06-27 22:56:15,069 INFO L125 PetriNetUnfolderBase]: For 132634/132657 co-relation queries the response was YES. [2024-06-27 22:56:15,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42613 conditions, 7180 events. 3009/7180 cut-off events. For 132634/132657 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 68868 event pairs, 1400 based on Foata normal form. 11/6572 useless extension candidates. Maximal degree in co-relation 42480. Up to 5099 conditions per place. [2024-06-27 22:56:15,154 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 318 selfloop transitions, 141 changer transitions 0/478 dead transitions. [2024-06-27 22:56:15,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 478 transitions, 10042 flow [2024-06-27 22:56:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:56:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:56:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2024-06-27 22:56:15,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-27 22:56:15,156 INFO L175 Difference]: Start difference. First operand has 329 places, 451 transitions, 8902 flow. Second operand 10 states and 168 transitions. [2024-06-27 22:56:15,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 478 transitions, 10042 flow [2024-06-27 22:56:16,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 478 transitions, 9928 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:56:16,192 INFO L231 Difference]: Finished difference. Result has 332 places, 452 transitions, 9146 flow [2024-06-27 22:56:16,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8788, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9146, PETRI_PLACES=332, PETRI_TRANSITIONS=452} [2024-06-27 22:56:16,192 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 293 predicate places. [2024-06-27 22:56:16,192 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 452 transitions, 9146 flow [2024-06-27 22:56:16,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:16,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:16,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:16,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 22:56:16,193 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:16,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1015594592, now seen corresponding path program 2 times [2024-06-27 22:56:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150652393] [2024-06-27 22:56:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150652393] [2024-06-27 22:56:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150652393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:56:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697840985] [2024-06-27 22:56:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:18,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:56:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:18,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:56:18,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:56:18,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:56:18,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 452 transitions, 9146 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:18,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:18,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:56:18,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:20,209 INFO L124 PetriNetUnfolderBase]: 3054/7308 cut-off events. [2024-06-27 22:56:20,209 INFO L125 PetriNetUnfolderBase]: For 138378/138401 co-relation queries the response was YES. [2024-06-27 22:56:20,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43512 conditions, 7308 events. 3054/7308 cut-off events. For 138378/138401 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 70480 event pairs, 1626 based on Foata normal form. 7/6683 useless extension candidates. Maximal degree in co-relation 43377. Up to 5352 conditions per place. [2024-06-27 22:56:20,276 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 381 selfloop transitions, 78 changer transitions 0/478 dead transitions. [2024-06-27 22:56:20,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 478 transitions, 10296 flow [2024-06-27 22:56:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:56:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:56:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 22:56:20,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-27 22:56:20,277 INFO L175 Difference]: Start difference. First operand has 332 places, 452 transitions, 9146 flow. Second operand 10 states and 166 transitions. [2024-06-27 22:56:20,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 478 transitions, 10296 flow [2024-06-27 22:56:21,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 478 transitions, 10006 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-27 22:56:21,208 INFO L231 Difference]: Finished difference. Result has 336 places, 453 transitions, 9082 flow [2024-06-27 22:56:21,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8856, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9082, PETRI_PLACES=336, PETRI_TRANSITIONS=453} [2024-06-27 22:56:21,208 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 297 predicate places. [2024-06-27 22:56:21,209 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 453 transitions, 9082 flow [2024-06-27 22:56:21,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:21,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:21,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:21,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 22:56:21,209 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:21,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -393490644, now seen corresponding path program 3 times [2024-06-27 22:56:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512316447] [2024-06-27 22:56:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:23,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:23,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512316447] [2024-06-27 22:56:23,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512316447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:23,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:23,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:56:23,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28811279] [2024-06-27 22:56:23,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:23,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:56:23,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:23,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:56:23,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:56:23,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:56:23,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 453 transitions, 9082 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:23,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:23,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:56:23,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:25,479 INFO L124 PetriNetUnfolderBase]: 3097/7431 cut-off events. [2024-06-27 22:56:25,479 INFO L125 PetriNetUnfolderBase]: For 140451/140474 co-relation queries the response was YES. [2024-06-27 22:56:25,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43949 conditions, 7431 events. 3097/7431 cut-off events. For 140451/140474 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 72055 event pairs, 1646 based on Foata normal form. 7/6797 useless extension candidates. Maximal degree in co-relation 43812. Up to 5446 conditions per place. [2024-06-27 22:56:25,561 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 380 selfloop transitions, 82 changer transitions 0/481 dead transitions. [2024-06-27 22:56:25,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 481 transitions, 10244 flow [2024-06-27 22:56:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:56:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:56:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2024-06-27 22:56:25,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 22:56:25,563 INFO L175 Difference]: Start difference. First operand has 336 places, 453 transitions, 9082 flow. Second operand 12 states and 190 transitions. [2024-06-27 22:56:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 481 transitions, 10244 flow [2024-06-27 22:56:26,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 481 transitions, 10070 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:56:26,553 INFO L231 Difference]: Finished difference. Result has 342 places, 454 transitions, 9144 flow [2024-06-27 22:56:26,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8908, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9144, PETRI_PLACES=342, PETRI_TRANSITIONS=454} [2024-06-27 22:56:26,554 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 303 predicate places. [2024-06-27 22:56:26,554 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 454 transitions, 9144 flow [2024-06-27 22:56:26,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:26,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:26,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:26,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 22:56:26,554 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:26,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash -393260004, now seen corresponding path program 4 times [2024-06-27 22:56:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584517425] [2024-06-27 22:56:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584517425] [2024-06-27 22:56:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584517425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:56:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838078373] [2024-06-27 22:56:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:28,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:56:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:28,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:56:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:56:28,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:56:28,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 454 transitions, 9144 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:28,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:28,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:56:28,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:30,666 INFO L124 PetriNetUnfolderBase]: 3140/7546 cut-off events. [2024-06-27 22:56:30,666 INFO L125 PetriNetUnfolderBase]: For 142803/142826 co-relation queries the response was YES. [2024-06-27 22:56:30,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44553 conditions, 7546 events. 3140/7546 cut-off events. For 142803/142826 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 73448 event pairs, 1669 based on Foata normal form. 7/6911 useless extension candidates. Maximal degree in co-relation 44414. Up to 5371 conditions per place. [2024-06-27 22:56:30,739 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 373 selfloop transitions, 94 changer transitions 0/486 dead transitions. [2024-06-27 22:56:30,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 486 transitions, 10360 flow [2024-06-27 22:56:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:56:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:56:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2024-06-27 22:56:30,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595238095238095 [2024-06-27 22:56:30,740 INFO L175 Difference]: Start difference. First operand has 342 places, 454 transitions, 9144 flow. Second operand 12 states and 193 transitions. [2024-06-27 22:56:30,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 486 transitions, 10360 flow [2024-06-27 22:56:31,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 486 transitions, 10176 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-27 22:56:31,610 INFO L231 Difference]: Finished difference. Result has 347 places, 456 transitions, 9268 flow [2024-06-27 22:56:31,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8960, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9268, PETRI_PLACES=347, PETRI_TRANSITIONS=456} [2024-06-27 22:56:31,610 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 308 predicate places. [2024-06-27 22:56:31,611 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 456 transitions, 9268 flow [2024-06-27 22:56:31,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:31,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:31,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:31,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 22:56:31,611 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:31,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1726389568, now seen corresponding path program 5 times [2024-06-27 22:56:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:31,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261233529] [2024-06-27 22:56:31,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:33,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261233529] [2024-06-27 22:56:33,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261233529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:33,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:33,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:56:33,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401418698] [2024-06-27 22:56:33,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:33,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:56:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:56:33,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:56:33,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:56:33,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 456 transitions, 9268 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:33,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:33,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:56:33,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:35,760 INFO L124 PetriNetUnfolderBase]: 3427/7932 cut-off events. [2024-06-27 22:56:35,761 INFO L125 PetriNetUnfolderBase]: For 151228/151231 co-relation queries the response was YES. [2024-06-27 22:56:35,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48054 conditions, 7932 events. 3427/7932 cut-off events. For 151228/151231 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 75438 event pairs, 2032 based on Foata normal form. 7/7323 useless extension candidates. Maximal degree in co-relation 47912. Up to 6196 conditions per place. [2024-06-27 22:56:35,852 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 441 selfloop transitions, 32 changer transitions 0/481 dead transitions. [2024-06-27 22:56:35,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 481 transitions, 10437 flow [2024-06-27 22:56:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:56:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:56:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2024-06-27 22:56:35,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2024-06-27 22:56:35,854 INFO L175 Difference]: Start difference. First operand has 347 places, 456 transitions, 9268 flow. Second operand 10 states and 152 transitions. [2024-06-27 22:56:35,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 481 transitions, 10437 flow [2024-06-27 22:56:36,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 481 transitions, 10243 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-27 22:56:36,877 INFO L231 Difference]: Finished difference. Result has 349 places, 456 transitions, 9141 flow [2024-06-27 22:56:36,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9074, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9141, PETRI_PLACES=349, PETRI_TRANSITIONS=456} [2024-06-27 22:56:36,877 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 310 predicate places. [2024-06-27 22:56:36,877 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 456 transitions, 9141 flow [2024-06-27 22:56:36,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:36,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:36,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:36,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 22:56:36,878 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:36,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1251242090, now seen corresponding path program 6 times [2024-06-27 22:56:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612071899] [2024-06-27 22:56:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:38,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:38,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612071899] [2024-06-27 22:56:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612071899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:38,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:56:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243371223] [2024-06-27 22:56:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:38,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:56:38,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:56:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:56:38,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:56:38,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 456 transitions, 9141 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:38,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:38,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:56:38,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:40,822 INFO L124 PetriNetUnfolderBase]: 3464/8035 cut-off events. [2024-06-27 22:56:40,822 INFO L125 PetriNetUnfolderBase]: For 151466/151469 co-relation queries the response was YES. [2024-06-27 22:56:40,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48270 conditions, 8035 events. 3464/8035 cut-off events. For 151466/151469 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 76650 event pairs, 2037 based on Foata normal form. 7/7459 useless extension candidates. Maximal degree in co-relation 48127. Up to 6265 conditions per place. [2024-06-27 22:56:40,895 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 464 selfloop transitions, 19 changer transitions 0/491 dead transitions. [2024-06-27 22:56:40,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 491 transitions, 10413 flow [2024-06-27 22:56:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:56:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:56:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-27 22:56:40,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43376623376623374 [2024-06-27 22:56:40,897 INFO L175 Difference]: Start difference. First operand has 349 places, 456 transitions, 9141 flow. Second operand 11 states and 167 transitions. [2024-06-27 22:56:40,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 491 transitions, 10413 flow [2024-06-27 22:56:41,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 491 transitions, 10350 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:56:41,881 INFO L231 Difference]: Finished difference. Result has 354 places, 460 transitions, 9222 flow [2024-06-27 22:56:41,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9078, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9222, PETRI_PLACES=354, PETRI_TRANSITIONS=460} [2024-06-27 22:56:41,881 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 315 predicate places. [2024-06-27 22:56:41,881 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 460 transitions, 9222 flow [2024-06-27 22:56:41,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:41,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:41,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:41,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 22:56:41,882 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:41,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 938436590, now seen corresponding path program 7 times [2024-06-27 22:56:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761749924] [2024-06-27 22:56:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761749924] [2024-06-27 22:56:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761749924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:56:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804687867] [2024-06-27 22:56:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:43,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:56:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:56:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:56:43,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:56:43,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 460 transitions, 9222 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:43,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:43,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:56:43,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:45,811 INFO L124 PetriNetUnfolderBase]: 3501/8112 cut-off events. [2024-06-27 22:56:45,811 INFO L125 PetriNetUnfolderBase]: For 163205/163208 co-relation queries the response was YES. [2024-06-27 22:56:45,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49433 conditions, 8112 events. 3501/8112 cut-off events. For 163205/163208 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 77576 event pairs, 2073 based on Foata normal form. 7/7498 useless extension candidates. Maximal degree in co-relation 49287. Up to 6296 conditions per place. [2024-06-27 22:56:45,905 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 454 selfloop transitions, 30 changer transitions 0/492 dead transitions. [2024-06-27 22:56:45,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 492 transitions, 10497 flow [2024-06-27 22:56:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:56:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:56:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 22:56:45,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-06-27 22:56:45,906 INFO L175 Difference]: Start difference. First operand has 354 places, 460 transitions, 9222 flow. Second operand 11 states and 168 transitions. [2024-06-27 22:56:45,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 492 transitions, 10497 flow [2024-06-27 22:56:47,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 492 transitions, 10000 flow, removed 70 selfloop flow, removed 15 redundant places. [2024-06-27 22:56:47,055 INFO L231 Difference]: Finished difference. Result has 350 places, 460 transitions, 8788 flow [2024-06-27 22:56:47,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8725, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8788, PETRI_PLACES=350, PETRI_TRANSITIONS=460} [2024-06-27 22:56:47,056 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 311 predicate places. [2024-06-27 22:56:47,056 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 460 transitions, 8788 flow [2024-06-27 22:56:47,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:47,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:47,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:47,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 22:56:47,057 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:47,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash -279719396, now seen corresponding path program 8 times [2024-06-27 22:56:47,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:47,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297920941] [2024-06-27 22:56:47,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297920941] [2024-06-27 22:56:49,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297920941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:49,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:49,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:56:49,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166983646] [2024-06-27 22:56:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:49,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:56:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:56:49,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:56:49,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:56:49,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 460 transitions, 8788 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:49,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:49,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:56:49,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:51,595 INFO L124 PetriNetUnfolderBase]: 3538/8236 cut-off events. [2024-06-27 22:56:51,596 INFO L125 PetriNetUnfolderBase]: For 159382/159385 co-relation queries the response was YES. [2024-06-27 22:56:51,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48985 conditions, 8236 events. 3538/8236 cut-off events. For 159382/159385 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 79109 event pairs, 2136 based on Foata normal form. 7/7612 useless extension candidates. Maximal degree in co-relation 48845. Up to 6385 conditions per place. [2024-06-27 22:56:51,675 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 425 selfloop transitions, 58 changer transitions 0/491 dead transitions. [2024-06-27 22:56:51,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 491 transitions, 10058 flow [2024-06-27 22:56:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:56:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:56:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:56:51,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542857142857143 [2024-06-27 22:56:51,676 INFO L175 Difference]: Start difference. First operand has 350 places, 460 transitions, 8788 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:56:51,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 491 transitions, 10058 flow [2024-06-27 22:56:52,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 491 transitions, 9963 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-27 22:56:52,690 INFO L231 Difference]: Finished difference. Result has 350 places, 460 transitions, 8812 flow [2024-06-27 22:56:52,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8693, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8812, PETRI_PLACES=350, PETRI_TRANSITIONS=460} [2024-06-27 22:56:52,691 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 311 predicate places. [2024-06-27 22:56:52,691 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 460 transitions, 8812 flow [2024-06-27 22:56:52,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:52,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:52,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:52,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 22:56:52,692 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:52,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash -107229506, now seen corresponding path program 9 times [2024-06-27 22:56:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523797994] [2024-06-27 22:56:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:56:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:54,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523797994] [2024-06-27 22:56:54,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523797994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:54,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:54,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:56:54,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643457127] [2024-06-27 22:56:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:54,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:56:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:56:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:56:54,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:56:54,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 460 transitions, 8812 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:54,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:54,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:56:54,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:57,091 INFO L124 PetriNetUnfolderBase]: 3575/8346 cut-off events. [2024-06-27 22:56:57,091 INFO L125 PetriNetUnfolderBase]: For 158988/158991 co-relation queries the response was YES. [2024-06-27 22:56:57,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49209 conditions, 8346 events. 3575/8346 cut-off events. For 158988/158991 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 80585 event pairs, 2168 based on Foata normal form. 7/7716 useless extension candidates. Maximal degree in co-relation 49068. Up to 6464 conditions per place. [2024-06-27 22:56:57,184 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 431 selfloop transitions, 52 changer transitions 0/491 dead transitions. [2024-06-27 22:56:57,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 491 transitions, 10091 flow [2024-06-27 22:56:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:56:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:56:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:56:57,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 22:56:57,185 INFO L175 Difference]: Start difference. First operand has 350 places, 460 transitions, 8812 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:56:57,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 491 transitions, 10091 flow [2024-06-27 22:56:58,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 491 transitions, 10013 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:56:58,293 INFO L231 Difference]: Finished difference. Result has 353 places, 460 transitions, 8841 flow [2024-06-27 22:56:58,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8734, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8841, PETRI_PLACES=353, PETRI_TRANSITIONS=460} [2024-06-27 22:56:58,299 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 314 predicate places. [2024-06-27 22:56:58,300 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 460 transitions, 8841 flow [2024-06-27 22:56:58,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:56:58,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:58,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:58,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 22:56:58,300 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:56:58,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash 14537096, now seen corresponding path program 10 times [2024-06-27 22:56:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033839382] [2024-06-27 22:56:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:57:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:57:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:57:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033839382] [2024-06-27 22:57:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033839382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:57:00,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:57:00,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:57:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772784602] [2024-06-27 22:57:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:57:00,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:57:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:57:00,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:57:00,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:57:00,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:57:00,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 460 transitions, 8841 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:00,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:57:00,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:57:00,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:57:02,484 INFO L124 PetriNetUnfolderBase]: 3576/8344 cut-off events. [2024-06-27 22:57:02,484 INFO L125 PetriNetUnfolderBase]: For 138942/138945 co-relation queries the response was YES. [2024-06-27 22:57:02,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48736 conditions, 8344 events. 3576/8344 cut-off events. For 138942/138945 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 80593 event pairs, 2154 based on Foata normal form. 7/7718 useless extension candidates. Maximal degree in co-relation 48594. Up to 6392 conditions per place. [2024-06-27 22:57:02,558 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 432 selfloop transitions, 53 changer transitions 0/493 dead transitions. [2024-06-27 22:57:02,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 493 transitions, 9974 flow [2024-06-27 22:57:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:57:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:57:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 22:57:02,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 22:57:02,560 INFO L175 Difference]: Start difference. First operand has 353 places, 460 transitions, 8841 flow. Second operand 10 states and 160 transitions. [2024-06-27 22:57:02,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 493 transitions, 9974 flow [2024-06-27 22:57:03,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 493 transitions, 9251 flow, removed 8 selfloop flow, removed 71 redundant places. [2024-06-27 22:57:03,106 INFO L231 Difference]: Finished difference. Result has 290 places, 459 transitions, 8050 flow [2024-06-27 22:57:03,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7944, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8050, PETRI_PLACES=290, PETRI_TRANSITIONS=459} [2024-06-27 22:57:03,106 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 251 predicate places. [2024-06-27 22:57:03,106 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 459 transitions, 8050 flow [2024-06-27 22:57:03,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:03,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:57:03,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:57:03,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 22:57:03,107 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:57:03,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:57:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash -37429566, now seen corresponding path program 1 times [2024-06-27 22:57:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:57:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630553813] [2024-06-27 22:57:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:57:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:57:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:57:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:57:03,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:57:03,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630553813] [2024-06-27 22:57:03,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630553813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:57:03,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:57:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:57:03,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933556128] [2024-06-27 22:57:03,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:57:03,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:57:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:57:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:57:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:57:03,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:57:03,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 459 transitions, 8050 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:03,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:57:03,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:57:03,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:57:04,201 INFO L124 PetriNetUnfolderBase]: 2732/6260 cut-off events. [2024-06-27 22:57:04,201 INFO L125 PetriNetUnfolderBase]: For 60182/60312 co-relation queries the response was YES. [2024-06-27 22:57:04,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34579 conditions, 6260 events. 2732/6260 cut-off events. For 60182/60312 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 55943 event pairs, 557 based on Foata normal form. 430/6406 useless extension candidates. Maximal degree in co-relation 34501. Up to 2204 conditions per place. [2024-06-27 22:57:04,244 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 185 selfloop transitions, 191 changer transitions 0/445 dead transitions. [2024-06-27 22:57:04,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 445 transitions, 8609 flow [2024-06-27 22:57:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:57:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:57:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 22:57:04,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2024-06-27 22:57:04,247 INFO L175 Difference]: Start difference. First operand has 290 places, 459 transitions, 8050 flow. Second operand 5 states and 107 transitions. [2024-06-27 22:57:04,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 445 transitions, 8609 flow [2024-06-27 22:57:04,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 445 transitions, 8045 flow, removed 132 selfloop flow, removed 26 redundant places. [2024-06-27 22:57:04,459 INFO L231 Difference]: Finished difference. Result has 270 places, 436 transitions, 7842 flow [2024-06-27 22:57:04,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7257, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7842, PETRI_PLACES=270, PETRI_TRANSITIONS=436} [2024-06-27 22:57:04,459 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 231 predicate places. [2024-06-27 22:57:04,460 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 436 transitions, 7842 flow [2024-06-27 22:57:04,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:04,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:57:04,460 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, 1, 1, 1, 1] [2024-06-27 22:57:04,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 22:57:04,460 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:57:04,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:57:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906423, now seen corresponding path program 1 times [2024-06-27 22:57:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:57:04,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612403883] [2024-06-27 22:57:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:57:04,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:57:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:57:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:57:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:57:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612403883] [2024-06-27 22:57:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612403883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:57:04,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:57:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:57:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762922397] [2024-06-27 22:57:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:57:04,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:57:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:57:04,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:57:04,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:57:04,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-06-27 22:57:04,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 436 transitions, 7842 flow. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:04,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:57:04,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-06-27 22:57:04,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:57:05,934 INFO L124 PetriNetUnfolderBase]: 2516/6316 cut-off events. [2024-06-27 22:57:05,934 INFO L125 PetriNetUnfolderBase]: For 43768/43835 co-relation queries the response was YES. [2024-06-27 22:57:05,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31197 conditions, 6316 events. 2516/6316 cut-off events. For 43768/43835 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 61048 event pairs, 915 based on Foata normal form. 59/5994 useless extension candidates. Maximal degree in co-relation 31126. Up to 2347 conditions per place. [2024-06-27 22:57:05,978 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 121 selfloop transitions, 133 changer transitions 13/490 dead transitions. [2024-06-27 22:57:05,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 490 transitions, 8753 flow [2024-06-27 22:57:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:57:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:57:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 217 transitions. [2024-06-27 22:57:05,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-27 22:57:05,980 INFO L175 Difference]: Start difference. First operand has 270 places, 436 transitions, 7842 flow. Second operand 12 states and 217 transitions. [2024-06-27 22:57:05,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 490 transitions, 8753 flow [2024-06-27 22:57:06,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 490 transitions, 8083 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 22:57:06,296 INFO L231 Difference]: Finished difference. Result has 280 places, 442 transitions, 7684 flow [2024-06-27 22:57:06,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7172, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7684, PETRI_PLACES=280, PETRI_TRANSITIONS=442} [2024-06-27 22:57:06,297 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 241 predicate places. [2024-06-27 22:57:06,297 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 442 transitions, 7684 flow [2024-06-27 22:57:06,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:06,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:57:06,298 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, 1, 1, 1, 1] [2024-06-27 22:57:06,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 22:57:06,298 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:57:06,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:57:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash 507569927, now seen corresponding path program 2 times [2024-06-27 22:57:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:57:06,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438008815] [2024-06-27 22:57:06,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:57:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:57:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:57:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:57:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:57:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438008815] [2024-06-27 22:57:06,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438008815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:57:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:57:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:57:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472971996] [2024-06-27 22:57:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:57:06,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:57:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:57:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:57:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:57:06,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-06-27 22:57:06,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 442 transitions, 7684 flow. Second operand has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:06,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:57:06,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-06-27 22:57:06,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:57:08,032 INFO L124 PetriNetUnfolderBase]: 2133/5331 cut-off events. [2024-06-27 22:57:08,032 INFO L125 PetriNetUnfolderBase]: For 30213/30297 co-relation queries the response was YES. [2024-06-27 22:57:08,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25406 conditions, 5331 events. 2133/5331 cut-off events. For 30213/30297 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 50260 event pairs, 428 based on Foata normal form. 60/4970 useless extension candidates. Maximal degree in co-relation 25334. Up to 1650 conditions per place. [2024-06-27 22:57:08,066 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 70 selfloop transitions, 67 changer transitions 144/468 dead transitions. [2024-06-27 22:57:08,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 468 transitions, 8256 flow [2024-06-27 22:57:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:57:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:57:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 22:57:08,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171428571428571 [2024-06-27 22:57:08,067 INFO L175 Difference]: Start difference. First operand has 280 places, 442 transitions, 7684 flow. Second operand 10 states and 181 transitions. [2024-06-27 22:57:08,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 468 transitions, 8256 flow [2024-06-27 22:57:08,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 468 transitions, 8151 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-27 22:57:08,241 INFO L231 Difference]: Finished difference. Result has 279 places, 314 transitions, 5208 flow [2024-06-27 22:57:08,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7583, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5208, PETRI_PLACES=279, PETRI_TRANSITIONS=314} [2024-06-27 22:57:08,241 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 240 predicate places. [2024-06-27 22:57:08,241 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 314 transitions, 5208 flow [2024-06-27 22:57:08,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:57:08,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:57:08,242 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, 1, 1, 1, 1] [2024-06-27 22:57:08,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 22:57:08,242 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:57:08,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:57:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -784011427, now seen corresponding path program 3 times [2024-06-27 22:57:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:57:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37406666] [2024-06-27 22:57:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:57:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:57:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:57:08,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:57:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:57:08,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:57:08,299 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:57:08,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:57:08,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 22:57:08,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:57:08,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:57:08,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:57:08,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:57:08,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 22:57:08,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 22:57:08,302 INFO L445 BasicCegarLoop]: Path program histogram: [17, 15, 12, 10, 10, 9, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:57:08,305 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:57:08,305 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:57:08,340 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:57:08,340 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:57:08,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:57:08 BasicIcfg [2024-06-27 22:57:08,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:57:08,341 INFO L158 Benchmark]: Toolchain (without parser) took 327111.08ms. Allocated memory was 195.0MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 120.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-06-27 22:57:08,341 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 67.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:57:08,341 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 195.0MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:57:08,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.98ms. Allocated memory is still 195.0MB. Free memory was 119.8MB in the beginning and 161.8MB in the end (delta: -41.9MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-06-27 22:57:08,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.08ms. Allocated memory is still 195.0MB. Free memory was 161.7MB in the beginning and 154.7MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 22:57:08,342 INFO L158 Benchmark]: Boogie Preprocessor took 93.12ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 150.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:57:08,342 INFO L158 Benchmark]: RCFGBuilder took 734.98ms. Allocated memory is still 195.0MB. Free memory was 150.6MB in the beginning and 72.3MB in the end (delta: 78.3MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-06-27 22:57:08,342 INFO L158 Benchmark]: TraceAbstraction took 325560.21ms. Allocated memory was 195.0MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 71.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-06-27 22:57:08,343 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 73.5MB in the beginning and 73.4MB in the end (delta: 67.2kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.63ms. Allocated memory is still 195.0MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.98ms. Allocated memory is still 195.0MB. Free memory was 119.8MB in the beginning and 161.8MB in the end (delta: -41.9MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.08ms. Allocated memory is still 195.0MB. Free memory was 161.7MB in the beginning and 154.7MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.12ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 150.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 734.98ms. Allocated memory is still 195.0MB. Free memory was 150.6MB in the beginning and 72.3MB in the end (delta: 78.3MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * TraceAbstraction took 325560.21ms. Allocated memory was 195.0MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 71.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 pthread_t t2306; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L810] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL))); [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305=-1, t2306=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L811] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL)) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2305=-1, t2306=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305=-1, t2306=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305=-1, t2306=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305=-1, t2306=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 52 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 325.4s, OverallIterations: 103, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 172.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6142 SdHoareTripleChecker+Valid, 33.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5288 mSDsluCounter, 1701 SdHoareTripleChecker+Invalid, 29.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1339 mSDsCounter, 1985 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44021 IncrementalHoareTripleChecker+Invalid, 46006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1985 mSolverCounterUnsat, 362 mSDtfsCounter, 44021 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 1026 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 32.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16558occurred in iteration=56, InterpolantAutomatonStates: 929, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 149.7s InterpolantComputationTime, 1562 NumberOfCodeBlocks, 1562 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 1435 ConstructedInterpolants, 0 QuantifiedInterpolants, 68176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 102 InterpolantComputations, 102 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:57:08,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE