./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_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/safe010_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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe010_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:45:11,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:45:11,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:45:11,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:45:11,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:45:11,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:45:11,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:45:11,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:45:11,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:45:11,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:45:11,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:45:11,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:45:11,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:45:11,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:45:11,300 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:45:11,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:45:11,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:45:11,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:45:11,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:45:11,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:45:11,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:45:11,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:45:11,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:45:11,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:45:11,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:45:11,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:45:11,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:45:11,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:45:11,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:45:11,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:45:11,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:45:11,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:45:11,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:45:11,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:45:11,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:45:11,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:45:11,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:45:11,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:45:11,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:45:11,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:45:11,309 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:45:11,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:45:11,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:45:11,309 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:45:11,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:45:11,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:45:11,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:45:11,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:45:11,612 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:45:11,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:45:12,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:45:13,042 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:45:13,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:45:13,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab2bc0e7/3f2a5654624e4d87b26713e512102558/FLAG558e326ba [2024-06-27 22:45:13,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab2bc0e7/3f2a5654624e4d87b26713e512102558 [2024-06-27 22:45:13,076 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:45:13,077 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:45:13,077 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 22:45:13,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:45:13,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:45:13,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:45:13,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:45:13,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:45:13,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:45:13" (1/2) ... [2024-06-27 22:45:13,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d26ccfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:45:13, skipping insertion in model container [2024-06-27 22:45:13,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:45:13" (1/2) ... [2024-06-27 22:45:13,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10d134f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:45:13, skipping insertion in model container [2024-06-27 22:45:13,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:45:13" (2/2) ... [2024-06-27 22:45:13,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d26ccfd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13, skipping insertion in model container [2024-06-27 22:45:13,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:45:13" (2/2) ... [2024-06-27 22:45:13,158 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:45:13,187 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:45:13,189 INFO L97 edCorrectnessWitness]: Location invariant before [L796-L796] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 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_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_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 >= 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 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (2LL - (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 )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$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL) && (2LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 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_used >= 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_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:45:13,189 INFO L97 edCorrectnessWitness]: Location invariant before [L795-L795] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 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_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_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 >= 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 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (2LL - (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 )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$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL) && (2LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 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_used >= 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_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:45:13,189 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:45:13,189 INFO L106 edCorrectnessWitness]: ghost_update [L793-L793] multithreaded = 1; [2024-06-27 22:45:13,233 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:45:13,409 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-06-27 22:45:13,606 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:45:13,624 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:45:13,658 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/safe010_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:45:13,828 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:45:13,877 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:45:13,878 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13 WrapperNode [2024-06-27 22:45:13,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:45:13,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:45:13,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:45:13,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:45:13,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:13,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:13,985 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-06-27 22:45:13,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:45:13,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:45:13,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:45:13,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:45:13,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:13,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,039 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:45:14,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:45:14,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:45:14,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:45:14,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:45:14,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (1/1) ... [2024-06-27 22:45:14,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:45:14,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:45:14,133 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:45:14,158 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:45:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:45:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:45:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:45:14,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:45:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:45:14,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:45:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:45:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:45:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:45:14,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:45:14,176 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:45:14,321 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:45:14,323 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:45:14,813 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:45:14,813 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:45:15,007 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:45:15,007 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:45:15,008 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:45:15 BoogieIcfgContainer [2024-06-27 22:45:15,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:45:15,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:45:15,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:45:15,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:45:15,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:45:13" (1/4) ... [2024-06-27 22:45:15,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b514619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:45:15, skipping insertion in model container [2024-06-27 22:45:15,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:45:13" (2/4) ... [2024-06-27 22:45:15,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b514619 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:45:15, skipping insertion in model container [2024-06-27 22:45:15,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:45:13" (3/4) ... [2024-06-27 22:45:15,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b514619 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:45:15, skipping insertion in model container [2024-06-27 22:45:15,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:45:15" (4/4) ... [2024-06-27 22:45:15,020 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:45:15,037 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:45:15,037 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:45:15,038 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:45:15,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:45:15,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:45:15,163 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 22:45:15,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:45:15,168 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 47 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:45:15,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:45:15,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-27 22:45:15,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:45:15,223 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;@8d5a561, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:45:15,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:45:15,227 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:45:15,229 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:45:15,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:45:15,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:15,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:45:15,230 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:45:15,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash 306675205, now seen corresponding path program 1 times [2024-06-27 22:45:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356617997] [2024-06-27 22:45:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:16,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:45:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356617997] [2024-06-27 22:45:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356617997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:16,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:45:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769914115] [2024-06-27 22:45:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:16,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:45:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:16,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:45:16,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:45:16,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:45:16,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:16,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:16,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:45:16,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:17,149 INFO L124 PetriNetUnfolderBase]: 432/835 cut-off events. [2024-06-27 22:45:17,150 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 22:45:17,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 835 events. 432/835 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4339 event pairs, 342 based on Foata normal form. 35/797 useless extension candidates. Maximal degree in co-relation 1569. Up to 717 conditions per place. [2024-06-27 22:45:17,162 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-06-27 22:45:17,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 163 flow [2024-06-27 22:45:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:45:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:45:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-27 22:45:17,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-06-27 22:45:17,178 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 72 transitions. [2024-06-27 22:45:17,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 163 flow [2024-06-27 22:45:17,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:17,183 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 91 flow [2024-06-27 22:45:17,185 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:45:17,189 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-27 22:45:17,189 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 91 flow [2024-06-27 22:45:17,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:17,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:17,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:17,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:45:17,190 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:45:17,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1637834109, now seen corresponding path program 1 times [2024-06-27 22:45:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:17,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631080519] [2024-06-27 22:45:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631080519] [2024-06-27 22:45:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631080519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:45:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25746876] [2024-06-27 22:45:18,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:18,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:45:18,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:45:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:45:18,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:45:18,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:18,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:18,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:45:18,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:18,363 INFO L124 PetriNetUnfolderBase]: 436/844 cut-off events. [2024-06-27 22:45:18,364 INFO L125 PetriNetUnfolderBase]: For 108/111 co-relation queries the response was YES. [2024-06-27 22:45:18,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 844 events. 436/844 cut-off events. For 108/111 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4433 event pairs, 249 based on Foata normal form. 4/779 useless extension candidates. Maximal degree in co-relation 1761. Up to 712 conditions per place. [2024-06-27 22:45:18,370 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 37 selfloop transitions, 6 changer transitions 1/53 dead transitions. [2024-06-27 22:45:18,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 229 flow [2024-06-27 22:45:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:45:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:45:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-06-27 22:45:18,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-27 22:45:18,374 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 91 flow. Second operand 4 states and 88 transitions. [2024-06-27 22:45:18,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 229 flow [2024-06-27 22:45:18,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:45:18,378 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 137 flow [2024-06-27 22:45:18,378 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=137, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-27 22:45:18,379 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-06-27 22:45:18,379 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 137 flow [2024-06-27 22:45:18,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:18,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:18,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:18,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:45:18,382 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:45:18,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash 766751430, now seen corresponding path program 1 times [2024-06-27 22:45:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866548247] [2024-06-27 22:45:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:19,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:45:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866548247] [2024-06-27 22:45:19,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866548247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:19,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:19,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:45:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11132310] [2024-06-27 22:45:19,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:19,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:45:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:19,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:45:19,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:45:19,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:45:19,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:19,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:19,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:45:19,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:19,573 INFO L124 PetriNetUnfolderBase]: 525/1005 cut-off events. [2024-06-27 22:45:19,573 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2024-06-27 22:45:19,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 1005 events. 525/1005 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5406 event pairs, 249 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 2295. Up to 834 conditions per place. [2024-06-27 22:45:19,579 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 51 selfloop transitions, 8 changer transitions 2/69 dead transitions. [2024-06-27 22:45:19,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 341 flow [2024-06-27 22:45:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:45:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:45:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-27 22:45:19,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-27 22:45:19,581 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 137 flow. Second operand 5 states and 106 transitions. [2024-06-27 22:45:19,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 341 flow [2024-06-27 22:45:19,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 332 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 22:45:19,584 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 194 flow [2024-06-27 22:45:19,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=130, 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=194, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-27 22:45:19,585 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2024-06-27 22:45:19,586 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 194 flow [2024-06-27 22:45:19,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:19,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:19,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:19,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:45:19,587 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:45:19,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2000508158, now seen corresponding path program 1 times [2024-06-27 22:45:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:19,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960207853] [2024-06-27 22:45:19,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:19,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:20,880 INFO 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:45:20,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960207853] [2024-06-27 22:45:20,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960207853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:20,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:20,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003735019] [2024-06-27 22:45:20,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:20,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:20,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:20,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:45:20,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:45:20,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:20,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:45:20,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:21,328 INFO L124 PetriNetUnfolderBase]: 529/1011 cut-off events. [2024-06-27 22:45:21,328 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2024-06-27 22:45:21,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1011 events. 529/1011 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5430 event pairs, 200 based on Foata normal form. 2/938 useless extension candidates. Maximal degree in co-relation 2485. Up to 822 conditions per place. [2024-06-27 22:45:21,334 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 58 selfloop transitions, 12 changer transitions 3/80 dead transitions. [2024-06-27 22:45:21,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 424 flow [2024-06-27 22:45:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 22:45:21,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-06-27 22:45:21,359 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 194 flow. Second operand 7 states and 131 transitions. [2024-06-27 22:45:21,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 424 flow [2024-06-27 22:45:21,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 424 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:45:21,363 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 240 flow [2024-06-27 22:45:21,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-06-27 22:45:21,364 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2024-06-27 22:45:21,364 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 240 flow [2024-06-27 22:45:21,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:45:21,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:21,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:21,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:45:21,365 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:45:21,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1886209435, now seen corresponding path program 1 times [2024-06-27 22:45:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:21,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19109461] [2024-06-27 22:45:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:22,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:22,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19109461] [2024-06-27 22:45:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19109461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625069134] [2024-06-27 22:45:22,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:22,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:22,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:22,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:22,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:45:22,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:22,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:22,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:45:22,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:22,980 INFO L124 PetriNetUnfolderBase]: 535/1021 cut-off events. [2024-06-27 22:45:22,980 INFO L125 PetriNetUnfolderBase]: For 899/899 co-relation queries the response was YES. [2024-06-27 22:45:22,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 1021 events. 535/1021 cut-off events. For 899/899 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5518 event pairs, 147 based on Foata normal form. 4/950 useless extension candidates. Maximal degree in co-relation 2738. Up to 796 conditions per place. [2024-06-27 22:45:22,988 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 62 selfloop transitions, 13 changer transitions 4/87 dead transitions. [2024-06-27 22:45:22,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 492 flow [2024-06-27 22:45:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-27 22:45:22,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5877551020408164 [2024-06-27 22:45:22,992 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 240 flow. Second operand 7 states and 144 transitions. [2024-06-27 22:45:22,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 492 flow [2024-06-27 22:45:22,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 470 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 22:45:23,000 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 253 flow [2024-06-27 22:45:23,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-27 22:45:23,005 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2024-06-27 22:45:23,006 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 253 flow [2024-06-27 22:45:23,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:23,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:23,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:23,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:45:23,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:23,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1313590529, now seen corresponding path program 1 times [2024-06-27 22:45:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360696947] [2024-06-27 22:45:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:23,077 INFO 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:45:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360696947] [2024-06-27 22:45:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360696947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:45:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933781881] [2024-06-27 22:45:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:23,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:45:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:45:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:45:23,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-27 22:45:23,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:45:23,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:23,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-27 22:45:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:23,216 INFO L124 PetriNetUnfolderBase]: 257/606 cut-off events. [2024-06-27 22:45:23,216 INFO L125 PetriNetUnfolderBase]: For 454/470 co-relation queries the response was YES. [2024-06-27 22:45:23,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 606 events. 257/606 cut-off events. For 454/470 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3521 event pairs, 99 based on Foata normal form. 2/558 useless extension candidates. Maximal degree in co-relation 1508. Up to 370 conditions per place. [2024-06-27 22:45:23,221 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 30 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-06-27 22:45:23,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 349 flow [2024-06-27 22:45:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:45:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:45:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-27 22:45:23,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-06-27 22:45:23,222 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 253 flow. Second operand 3 states and 79 transitions. [2024-06-27 22:45:23,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 349 flow [2024-06-27 22:45:23,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 320 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 22:45:23,227 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 230 flow [2024-06-27 22:45:23,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-06-27 22:45:23,230 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2024-06-27 22:45:23,230 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 230 flow [2024-06-27 22:45:23,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:45:23,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:23,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:45:23,231 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:45:23,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1313591009, now seen corresponding path program 1 times [2024-06-27 22:45:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609142540] [2024-06-27 22:45:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:24,870 INFO 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:45:24,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:24,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609142540] [2024-06-27 22:45:24,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609142540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:24,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:24,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:45:24,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149663101] [2024-06-27 22:45:24,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:24,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:45:24,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:24,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:45:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:45:24,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:24,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:24,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:24,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:24,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:25,318 INFO L124 PetriNetUnfolderBase]: 539/1027 cut-off events. [2024-06-27 22:45:25,318 INFO L125 PetriNetUnfolderBase]: For 1185/1185 co-relation queries the response was YES. [2024-06-27 22:45:25,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 1027 events. 539/1027 cut-off events. For 1185/1185 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5293 event pairs, 195 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 2820. Up to 861 conditions per place. [2024-06-27 22:45:25,325 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 48 selfloop transitions, 13 changer transitions 1/68 dead transitions. [2024-06-27 22:45:25,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 436 flow [2024-06-27 22:45:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:45:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:45:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-27 22:45:25,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 22:45:25,327 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 230 flow. Second operand 5 states and 85 transitions. [2024-06-27 22:45:25,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 436 flow [2024-06-27 22:45:25,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:25,332 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 319 flow [2024-06-27 22:45:25,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-06-27 22:45:25,333 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2024-06-27 22:45:25,333 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 319 flow [2024-06-27 22:45:25,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:25,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:25,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:25,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:45:25,334 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:45:25,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:25,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2074249079, now seen corresponding path program 1 times [2024-06-27 22:45:25,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846316527] [2024-06-27 22:45:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:25,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:26,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:45:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846316527] [2024-06-27 22:45:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846316527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338522951] [2024-06-27 22:45:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:26,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:26,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:26,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:26,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:26,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:26,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:26,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:26,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:27,039 INFO L124 PetriNetUnfolderBase]: 537/1033 cut-off events. [2024-06-27 22:45:27,039 INFO L125 PetriNetUnfolderBase]: For 1460/1460 co-relation queries the response was YES. [2024-06-27 22:45:27,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 1033 events. 537/1033 cut-off events. For 1460/1460 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5434 event pairs, 118 based on Foata normal form. 1/989 useless extension candidates. Maximal degree in co-relation 3075. Up to 805 conditions per place. [2024-06-27 22:45:27,047 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 68 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2024-06-27 22:45:27,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 640 flow [2024-06-27 22:45:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 22:45:27,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 22:45:27,049 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 319 flow. Second operand 7 states and 120 transitions. [2024-06-27 22:45:27,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 640 flow [2024-06-27 22:45:27,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 92 transitions, 636 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:45:27,056 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 431 flow [2024-06-27 22:45:27,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-06-27 22:45:27,058 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2024-06-27 22:45:27,058 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 431 flow [2024-06-27 22:45:27,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:27,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:27,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:27,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:45:27,059 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:45:27,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2074369049, now seen corresponding path program 2 times [2024-06-27 22:45:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:27,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350807242] [2024-06-27 22:45:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:28,290 INFO 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:45:28,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:28,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350807242] [2024-06-27 22:45:28,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350807242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:28,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:28,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023552976] [2024-06-27 22:45:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:28,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:28,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:28,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:28,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:28,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:28,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:28,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:28,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:28,819 INFO L124 PetriNetUnfolderBase]: 563/1082 cut-off events. [2024-06-27 22:45:28,819 INFO L125 PetriNetUnfolderBase]: For 2193/2193 co-relation queries the response was YES. [2024-06-27 22:45:28,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 1082 events. 563/1082 cut-off events. For 2193/2193 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5767 event pairs, 118 based on Foata normal form. 1/1035 useless extension candidates. Maximal degree in co-relation 3564. Up to 868 conditions per place. [2024-06-27 22:45:28,828 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 71 selfloop transitions, 17 changer transitions 0/94 dead transitions. [2024-06-27 22:45:28,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 94 transitions, 721 flow [2024-06-27 22:45:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 22:45:28,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-27 22:45:28,833 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 431 flow. Second operand 7 states and 117 transitions. [2024-06-27 22:45:28,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 94 transitions, 721 flow [2024-06-27 22:45:28,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 705 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:28,841 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 504 flow [2024-06-27 22:45:28,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=504, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-06-27 22:45:28,842 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2024-06-27 22:45:28,843 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 504 flow [2024-06-27 22:45:28,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:28,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:28,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:28,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:45:28,845 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:45:28,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash -415793867, now seen corresponding path program 1 times [2024-06-27 22:45:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225378592] [2024-06-27 22:45:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:30,160 INFO 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:45:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225378592] [2024-06-27 22:45:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225378592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:30,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:30,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307086062] [2024-06-27 22:45:30,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:30,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:30,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:30,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 504 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:30,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:30,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:30,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:30,600 INFO L124 PetriNetUnfolderBase]: 609/1157 cut-off events. [2024-06-27 22:45:30,600 INFO L125 PetriNetUnfolderBase]: For 2793/2793 co-relation queries the response was YES. [2024-06-27 22:45:30,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 1157 events. 609/1157 cut-off events. For 2793/2793 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6128 event pairs, 146 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 3927. Up to 883 conditions per place. [2024-06-27 22:45:30,610 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 79 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-27 22:45:30,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 932 flow [2024-06-27 22:45:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-27 22:45:30,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2024-06-27 22:45:30,612 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 504 flow. Second operand 7 states and 121 transitions. [2024-06-27 22:45:30,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 932 flow [2024-06-27 22:45:30,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 884 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 22:45:30,621 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 673 flow [2024-06-27 22:45:30,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=673, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-06-27 22:45:30,623 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2024-06-27 22:45:30,623 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 673 flow [2024-06-27 22:45:30,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:30,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:30,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:30,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:45:30,625 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:45:30,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash 218927227, now seen corresponding path program 3 times [2024-06-27 22:45:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581908764] [2024-06-27 22:45:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:31,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:45:31,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:31,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581908764] [2024-06-27 22:45:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581908764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:31,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:31,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471675637] [2024-06-27 22:45:31,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:31,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:31,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:31,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:31,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 673 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:31,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:31,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:31,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:32,174 INFO L124 PetriNetUnfolderBase]: 607/1148 cut-off events. [2024-06-27 22:45:32,174 INFO L125 PetriNetUnfolderBase]: For 3392/3392 co-relation queries the response was YES. [2024-06-27 22:45:32,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 1148 events. 607/1148 cut-off events. For 3392/3392 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6018 event pairs, 143 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 4195. Up to 932 conditions per place. [2024-06-27 22:45:32,185 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 78 selfloop transitions, 20 changer transitions 0/104 dead transitions. [2024-06-27 22:45:32,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 934 flow [2024-06-27 22:45:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:45:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:45:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 22:45:32,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-06-27 22:45:32,187 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 673 flow. Second operand 6 states and 103 transitions. [2024-06-27 22:45:32,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 934 flow [2024-06-27 22:45:32,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 882 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-27 22:45:32,203 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 675 flow [2024-06-27 22:45:32,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2024-06-27 22:45:32,204 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2024-06-27 22:45:32,204 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 675 flow [2024-06-27 22:45:32,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:32,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:32,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:32,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:45:32,205 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:45:32,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash 337998765, now seen corresponding path program 2 times [2024-06-27 22:45:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389630680] [2024-06-27 22:45:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:33,238 INFO 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:45:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389630680] [2024-06-27 22:45:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389630680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:33,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:33,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438828817] [2024-06-27 22:45:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:33,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:33,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:33,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:33,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:33,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:33,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:33,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:33,689 INFO L124 PetriNetUnfolderBase]: 629/1181 cut-off events. [2024-06-27 22:45:33,690 INFO L125 PetriNetUnfolderBase]: For 3730/3730 co-relation queries the response was YES. [2024-06-27 22:45:33,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 1181 events. 629/1181 cut-off events. For 3730/3730 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6155 event pairs, 175 based on Foata normal form. 2/1135 useless extension candidates. Maximal degree in co-relation 4336. Up to 975 conditions per place. [2024-06-27 22:45:33,700 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 82 selfloop transitions, 20 changer transitions 0/108 dead transitions. [2024-06-27 22:45:33,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 108 transitions, 967 flow [2024-06-27 22:45:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:45:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:45:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 22:45:33,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-27 22:45:33,702 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 675 flow. Second operand 6 states and 101 transitions. [2024-06-27 22:45:33,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 108 transitions, 967 flow [2024-06-27 22:45:33,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 108 transitions, 919 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:45:33,712 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 733 flow [2024-06-27 22:45:33,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2024-06-27 22:45:33,713 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2024-06-27 22:45:33,713 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 733 flow [2024-06-27 22:45:33,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:33,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:33,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:33,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:45:33,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:33,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash 337732785, now seen corresponding path program 3 times [2024-06-27 22:45:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:33,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428806085] [2024-06-27 22:45:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:34,851 INFO 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:45:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428806085] [2024-06-27 22:45:34,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428806085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:34,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:34,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:34,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310990629] [2024-06-27 22:45:34,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:34,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:34,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:34,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:34,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:34,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:34,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 733 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:34,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:34,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:34,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:35,303 INFO L124 PetriNetUnfolderBase]: 639/1190 cut-off events. [2024-06-27 22:45:35,304 INFO L125 PetriNetUnfolderBase]: For 4112/4112 co-relation queries the response was YES. [2024-06-27 22:45:35,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 1190 events. 639/1190 cut-off events. For 4112/4112 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6205 event pairs, 148 based on Foata normal form. 2/1145 useless extension candidates. Maximal degree in co-relation 4555. Up to 910 conditions per place. [2024-06-27 22:45:35,314 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 77 selfloop transitions, 34 changer transitions 0/117 dead transitions. [2024-06-27 22:45:35,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 1094 flow [2024-06-27 22:45:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:45:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:45:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 22:45:35,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-27 22:45:35,317 INFO L175 Difference]: Start difference. First operand has 83 places, 92 transitions, 733 flow. Second operand 6 states and 106 transitions. [2024-06-27 22:45:35,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 1094 flow [2024-06-27 22:45:35,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 1070 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:35,328 INFO L231 Difference]: Finished difference. Result has 88 places, 97 transitions, 860 flow [2024-06-27 22:45:35,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=88, PETRI_TRANSITIONS=97} [2024-06-27 22:45:35,329 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2024-06-27 22:45:35,330 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 97 transitions, 860 flow [2024-06-27 22:45:35,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:35,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:35,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:45:35,330 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:45:35,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1912746991, now seen corresponding path program 4 times [2024-06-27 22:45:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:35,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881859979] [2024-06-27 22:45:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:36,763 INFO 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:45:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:36,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881859979] [2024-06-27 22:45:36,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881859979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:36,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:36,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495476403] [2024-06-27 22:45:36,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:36,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:36,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:36,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 97 transitions, 860 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:36,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:36,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:36,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:37,528 INFO L124 PetriNetUnfolderBase]: 680/1247 cut-off events. [2024-06-27 22:45:37,529 INFO L125 PetriNetUnfolderBase]: For 5113/5115 co-relation queries the response was YES. [2024-06-27 22:45:37,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5117 conditions, 1247 events. 680/1247 cut-off events. For 5113/5115 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6427 event pairs, 138 based on Foata normal form. 3/1207 useless extension candidates. Maximal degree in co-relation 5069. Up to 980 conditions per place. [2024-06-27 22:45:37,547 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 110 selfloop transitions, 48 changer transitions 0/164 dead transitions. [2024-06-27 22:45:37,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 164 transitions, 1619 flow [2024-06-27 22:45:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 22:45:37,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:45:37,550 INFO L175 Difference]: Start difference. First operand has 88 places, 97 transitions, 860 flow. Second operand 8 states and 133 transitions. [2024-06-27 22:45:37,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 164 transitions, 1619 flow [2024-06-27 22:45:37,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 1554 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:45:37,569 INFO L231 Difference]: Finished difference. Result has 95 places, 137 transitions, 1320 flow [2024-06-27 22:45:37,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1320, PETRI_PLACES=95, PETRI_TRANSITIONS=137} [2024-06-27 22:45:37,570 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 56 predicate places. [2024-06-27 22:45:37,571 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 137 transitions, 1320 flow [2024-06-27 22:45:37,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:37,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:37,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:37,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:45:37,571 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:45:37,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1870344051, now seen corresponding path program 5 times [2024-06-27 22:45:37,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:37,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580234408] [2024-06-27 22:45:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:39,250 INFO 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:45:39,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580234408] [2024-06-27 22:45:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580234408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:39,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:39,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:39,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559962327] [2024-06-27 22:45:39,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:39,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:39,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:39,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:39,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 137 transitions, 1320 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:39,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:39,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:39,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:40,015 INFO L124 PetriNetUnfolderBase]: 728/1325 cut-off events. [2024-06-27 22:45:40,015 INFO L125 PetriNetUnfolderBase]: For 6410/6410 co-relation queries the response was YES. [2024-06-27 22:45:40,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5979 conditions, 1325 events. 728/1325 cut-off events. For 6410/6410 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6905 event pairs, 142 based on Foata normal form. 1/1283 useless extension candidates. Maximal degree in co-relation 5928. Up to 1027 conditions per place. [2024-06-27 22:45:40,030 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 114 selfloop transitions, 74 changer transitions 0/194 dead transitions. [2024-06-27 22:45:40,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 194 transitions, 2193 flow [2024-06-27 22:45:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 22:45:40,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:45:40,032 INFO L175 Difference]: Start difference. First operand has 95 places, 137 transitions, 1320 flow. Second operand 8 states and 133 transitions. [2024-06-27 22:45:40,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 194 transitions, 2193 flow [2024-06-27 22:45:40,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 194 transitions, 2105 flow, removed 43 selfloop flow, removed 1 redundant places. [2024-06-27 22:45:40,060 INFO L231 Difference]: Finished difference. Result has 105 places, 170 transitions, 1857 flow [2024-06-27 22:45:40,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1857, PETRI_PLACES=105, PETRI_TRANSITIONS=170} [2024-06-27 22:45:40,061 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 66 predicate places. [2024-06-27 22:45:40,061 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 170 transitions, 1857 flow [2024-06-27 22:45:40,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:40,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:40,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:40,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:45:40,062 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:45:40,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1890789357, now seen corresponding path program 4 times [2024-06-27 22:45:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407517356] [2024-06-27 22:45:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:41,655 INFO 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:45:41,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:41,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407517356] [2024-06-27 22:45:41,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407517356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:41,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:41,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955750525] [2024-06-27 22:45:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:41,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:41,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:41,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 170 transitions, 1857 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:41,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:41,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:41,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:42,443 INFO L124 PetriNetUnfolderBase]: 766/1387 cut-off events. [2024-06-27 22:45:42,444 INFO L125 PetriNetUnfolderBase]: For 7623/7623 co-relation queries the response was YES. [2024-06-27 22:45:42,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6634 conditions, 1387 events. 766/1387 cut-off events. For 7623/7623 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7271 event pairs, 147 based on Foata normal form. 1/1344 useless extension candidates. Maximal degree in co-relation 6577. Up to 1022 conditions per place. [2024-06-27 22:45:42,457 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 149 selfloop transitions, 69 changer transitions 0/224 dead transitions. [2024-06-27 22:45:42,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 224 transitions, 2661 flow [2024-06-27 22:45:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 22:45:42,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-27 22:45:42,459 INFO L175 Difference]: Start difference. First operand has 105 places, 170 transitions, 1857 flow. Second operand 8 states and 137 transitions. [2024-06-27 22:45:42,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 224 transitions, 2661 flow [2024-06-27 22:45:42,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 224 transitions, 2589 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:42,489 INFO L231 Difference]: Finished difference. Result has 114 places, 197 transitions, 2258 flow [2024-06-27 22:45:42,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1787, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2258, PETRI_PLACES=114, PETRI_TRANSITIONS=197} [2024-06-27 22:45:42,490 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 75 predicate places. [2024-06-27 22:45:42,490 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 197 transitions, 2258 flow [2024-06-27 22:45:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:42,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:42,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:42,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:45:42,491 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:45:42,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1890126081, now seen corresponding path program 6 times [2024-06-27 22:45:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919018155] [2024-06-27 22:45:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:44,013 INFO 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:45:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919018155] [2024-06-27 22:45:44,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919018155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:44,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:45:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878788700] [2024-06-27 22:45:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:44,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:45:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:44,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:45:44,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:45:44,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:44,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 197 transitions, 2258 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:44,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:44,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:44,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:44,753 INFO L124 PetriNetUnfolderBase]: 768/1390 cut-off events. [2024-06-27 22:45:44,753 INFO L125 PetriNetUnfolderBase]: For 9590/9590 co-relation queries the response was YES. [2024-06-27 22:45:44,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7270 conditions, 1390 events. 768/1390 cut-off events. For 9590/9590 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7254 event pairs, 144 based on Foata normal form. 1/1348 useless extension candidates. Maximal degree in co-relation 7208. Up to 1169 conditions per place. [2024-06-27 22:45:44,766 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 176 selfloop transitions, 39 changer transitions 0/221 dead transitions. [2024-06-27 22:45:44,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 221 transitions, 2806 flow [2024-06-27 22:45:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-27 22:45:44,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 22:45:44,768 INFO L175 Difference]: Start difference. First operand has 114 places, 197 transitions, 2258 flow. Second operand 8 states and 128 transitions. [2024-06-27 22:45:44,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 221 transitions, 2806 flow [2024-06-27 22:45:44,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 221 transitions, 2734 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:44,808 INFO L231 Difference]: Finished difference. Result has 120 places, 201 transitions, 2320 flow [2024-06-27 22:45:44,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2320, PETRI_PLACES=120, PETRI_TRANSITIONS=201} [2024-06-27 22:45:44,809 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 81 predicate places. [2024-06-27 22:45:44,809 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 201 transitions, 2320 flow [2024-06-27 22:45:44,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:44,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:44,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:44,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:45:44,810 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:45:44,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash 338008654, now seen corresponding path program 1 times [2024-06-27 22:45:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879995640] [2024-06-27 22:45:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:46,716 INFO 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:45:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879995640] [2024-06-27 22:45:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879995640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209938813] [2024-06-27 22:45:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:46,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:46,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:46,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 201 transitions, 2320 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:46,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:46,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:46,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:47,362 INFO L124 PetriNetUnfolderBase]: 765/1386 cut-off events. [2024-06-27 22:45:47,362 INFO L125 PetriNetUnfolderBase]: For 10138/10138 co-relation queries the response was YES. [2024-06-27 22:45:47,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7235 conditions, 1386 events. 765/1386 cut-off events. For 10138/10138 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7269 event pairs, 160 based on Foata normal form. 2/1344 useless extension candidates. Maximal degree in co-relation 7171. Up to 1179 conditions per place. [2024-06-27 22:45:47,377 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 196 selfloop transitions, 17 changer transitions 0/219 dead transitions. [2024-06-27 22:45:47,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 219 transitions, 2848 flow [2024-06-27 22:45:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-27 22:45:47,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43673469387755104 [2024-06-27 22:45:47,379 INFO L175 Difference]: Start difference. First operand has 120 places, 201 transitions, 2320 flow. Second operand 7 states and 107 transitions. [2024-06-27 22:45:47,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 219 transitions, 2848 flow [2024-06-27 22:45:47,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 219 transitions, 2768 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 22:45:47,416 INFO L231 Difference]: Finished difference. Result has 121 places, 203 transitions, 2299 flow [2024-06-27 22:45:47,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2299, PETRI_PLACES=121, PETRI_TRANSITIONS=203} [2024-06-27 22:45:47,416 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 82 predicate places. [2024-06-27 22:45:47,417 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 203 transitions, 2299 flow [2024-06-27 22:45:47,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:47,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:47,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:47,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:45:47,418 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:45:47,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -8522197, now seen corresponding path program 1 times [2024-06-27 22:45:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695385105] [2024-06-27 22:45:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:49,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:49,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695385105] [2024-06-27 22:45:49,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695385105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:49,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:49,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:45:49,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448394903] [2024-06-27 22:45:49,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:49,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:45:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:45:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:45:49,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:49,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 203 transitions, 2299 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:45:49,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:49,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:49,803 INFO L124 PetriNetUnfolderBase]: 856/1527 cut-off events. [2024-06-27 22:45:49,803 INFO L125 PetriNetUnfolderBase]: For 11375/11375 co-relation queries the response was YES. [2024-06-27 22:45:49,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7980 conditions, 1527 events. 856/1527 cut-off events. For 11375/11375 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8110 event pairs, 140 based on Foata normal form. 1/1483 useless extension candidates. Maximal degree in co-relation 7916. Up to 1045 conditions per place. [2024-06-27 22:45:49,816 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 189 selfloop transitions, 82 changer transitions 0/277 dead transitions. [2024-06-27 22:45:49,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 277 transitions, 3517 flow [2024-06-27 22:45:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:45:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:45:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:45:49,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 22:45:49,819 INFO L175 Difference]: Start difference. First operand has 121 places, 203 transitions, 2299 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:45:49,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 277 transitions, 3517 flow [2024-06-27 22:45:49,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 277 transitions, 3459 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 22:45:49,862 INFO L231 Difference]: Finished difference. Result has 127 places, 244 transitions, 2971 flow [2024-06-27 22:45:49,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2971, PETRI_PLACES=127, PETRI_TRANSITIONS=244} [2024-06-27 22:45:49,863 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 88 predicate places. [2024-06-27 22:45:49,863 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 244 transitions, 2971 flow [2024-06-27 22:45:49,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:45:49,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:49,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:49,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:45:49,864 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:45:49,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -122786998, now seen corresponding path program 1 times [2024-06-27 22:45:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224800439] [2024-06-27 22:45:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:51,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:51,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224800439] [2024-06-27 22:45:51,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224800439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:51,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800478108] [2024-06-27 22:45:51,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:51,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:51,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:51,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 244 transitions, 2971 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:51,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:51,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:51,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:51,713 INFO L124 PetriNetUnfolderBase]: 996/1702 cut-off events. [2024-06-27 22:45:51,713 INFO L125 PetriNetUnfolderBase]: For 16534/16534 co-relation queries the response was YES. [2024-06-27 22:45:51,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10204 conditions, 1702 events. 996/1702 cut-off events. For 16534/16534 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9001 event pairs, 146 based on Foata normal form. 4/1673 useless extension candidates. Maximal degree in co-relation 10138. Up to 1017 conditions per place. [2024-06-27 22:45:51,730 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 209 selfloop transitions, 101 changer transitions 0/316 dead transitions. [2024-06-27 22:45:51,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 316 transitions, 4346 flow [2024-06-27 22:45:51,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:45:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:45:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:45:51,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-06-27 22:45:51,732 INFO L175 Difference]: Start difference. First operand has 127 places, 244 transitions, 2971 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:45:51,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 316 transitions, 4346 flow [2024-06-27 22:45:51,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 316 transitions, 4247 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-27 22:45:51,798 INFO L231 Difference]: Finished difference. Result has 135 places, 268 transitions, 3461 flow [2024-06-27 22:45:51,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3461, PETRI_PLACES=135, PETRI_TRANSITIONS=268} [2024-06-27 22:45:51,799 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 96 predicate places. [2024-06-27 22:45:51,800 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 268 transitions, 3461 flow [2024-06-27 22:45:51,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:51,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:51,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:45:51,800 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:45:51,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash -8431987, now seen corresponding path program 2 times [2024-06-27 22:45:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:51,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542916311] [2024-06-27 22:45:51,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:51,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:53,042 INFO 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:45:53,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542916311] [2024-06-27 22:45:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542916311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:53,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:53,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:53,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374669504] [2024-06-27 22:45:53,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:53,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:53,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:53,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:53,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:53,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 268 transitions, 3461 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:53,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:53,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:53,651 INFO L124 PetriNetUnfolderBase]: 988/1701 cut-off events. [2024-06-27 22:45:53,651 INFO L125 PetriNetUnfolderBase]: For 18676/18676 co-relation queries the response was YES. [2024-06-27 22:45:53,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10770 conditions, 1701 events. 988/1701 cut-off events. For 18676/18676 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9063 event pairs, 155 based on Foata normal form. 4/1668 useless extension candidates. Maximal degree in co-relation 10700. Up to 1146 conditions per place. [2024-06-27 22:45:53,668 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 215 selfloop transitions, 103 changer transitions 0/324 dead transitions. [2024-06-27 22:45:53,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 324 transitions, 4702 flow [2024-06-27 22:45:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 22:45:53,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:45:53,670 INFO L175 Difference]: Start difference. First operand has 135 places, 268 transitions, 3461 flow. Second operand 8 states and 144 transitions. [2024-06-27 22:45:53,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 324 transitions, 4702 flow [2024-06-27 22:45:53,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 324 transitions, 4494 flow, removed 71 selfloop flow, removed 4 redundant places. [2024-06-27 22:45:53,752 INFO L231 Difference]: Finished difference. Result has 141 places, 282 transitions, 3765 flow [2024-06-27 22:45:53,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3307, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3765, PETRI_PLACES=141, PETRI_TRANSITIONS=282} [2024-06-27 22:45:53,753 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 102 predicate places. [2024-06-27 22:45:53,753 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 282 transitions, 3765 flow [2024-06-27 22:45:53,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:53,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:53,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:53,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:45:53,754 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:45:53,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash -4707182, now seen corresponding path program 2 times [2024-06-27 22:45:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371587263] [2024-06-27 22:45:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:54,942 INFO 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:45:54,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371587263] [2024-06-27 22:45:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371587263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:54,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102909729] [2024-06-27 22:45:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:54,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:54,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:54,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:54,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:55,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:55,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 282 transitions, 3765 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:55,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:55,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:55,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:55,701 INFO L124 PetriNetUnfolderBase]: 1038/1765 cut-off events. [2024-06-27 22:45:55,701 INFO L125 PetriNetUnfolderBase]: For 20087/20087 co-relation queries the response was YES. [2024-06-27 22:45:55,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11600 conditions, 1765 events. 1038/1765 cut-off events. For 20087/20087 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9318 event pairs, 160 based on Foata normal form. 2/1734 useless extension candidates. Maximal degree in co-relation 11526. Up to 1386 conditions per place. [2024-06-27 22:45:55,721 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 252 selfloop transitions, 91 changer transitions 0/349 dead transitions. [2024-06-27 22:45:55,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 349 transitions, 5173 flow [2024-06-27 22:45:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:45:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:45:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 22:45:55,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2024-06-27 22:45:55,723 INFO L175 Difference]: Start difference. First operand has 141 places, 282 transitions, 3765 flow. Second operand 10 states and 169 transitions. [2024-06-27 22:45:55,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 349 transitions, 5173 flow [2024-06-27 22:45:55,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 349 transitions, 5101 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 22:45:55,809 INFO L231 Difference]: Finished difference. Result has 149 places, 297 transitions, 4164 flow [2024-06-27 22:45:55,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3693, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4164, PETRI_PLACES=149, PETRI_TRANSITIONS=297} [2024-06-27 22:45:55,809 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 110 predicate places. [2024-06-27 22:45:55,810 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 297 transitions, 4164 flow [2024-06-27 22:45:55,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:55,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:55,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:55,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:45:55,811 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:45:55,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash -4712762, now seen corresponding path program 3 times [2024-06-27 22:45:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:55,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959736859] [2024-06-27 22:45:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:56,979 INFO 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:45:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959736859] [2024-06-27 22:45:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959736859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22443451] [2024-06-27 22:45:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:56,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:57,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:57,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 297 transitions, 4164 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:57,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:57,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:57,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:57,776 INFO L124 PetriNetUnfolderBase]: 1034/1759 cut-off events. [2024-06-27 22:45:57,776 INFO L125 PetriNetUnfolderBase]: For 20846/20846 co-relation queries the response was YES. [2024-06-27 22:45:57,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11896 conditions, 1759 events. 1034/1759 cut-off events. For 20846/20846 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9286 event pairs, 159 based on Foata normal form. 2/1728 useless extension candidates. Maximal degree in co-relation 11819. Up to 1383 conditions per place. [2024-06-27 22:45:57,794 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 252 selfloop transitions, 86 changer transitions 0/344 dead transitions. [2024-06-27 22:45:57,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 344 transitions, 5272 flow [2024-06-27 22:45:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 22:45:57,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:45:57,797 INFO L175 Difference]: Start difference. First operand has 149 places, 297 transitions, 4164 flow. Second operand 8 states and 140 transitions. [2024-06-27 22:45:57,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 344 transitions, 5272 flow [2024-06-27 22:45:57,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 344 transitions, 5119 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-27 22:45:57,905 INFO L231 Difference]: Finished difference. Result has 153 places, 297 transitions, 4196 flow [2024-06-27 22:45:57,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4011, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4196, PETRI_PLACES=153, PETRI_TRANSITIONS=297} [2024-06-27 22:45:57,907 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 114 predicate places. [2024-06-27 22:45:57,907 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 297 transitions, 4196 flow [2024-06-27 22:45:57,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:57,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:57,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:57,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:45:57,908 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:45:57,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -4712917, now seen corresponding path program 3 times [2024-06-27 22:45:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107132398] [2024-06-27 22:45:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:59,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:45:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107132398] [2024-06-27 22:45:59,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107132398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:59,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:59,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102050097] [2024-06-27 22:45:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:59,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:59,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:59,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:59,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:59,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:45:59,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 297 transitions, 4196 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:59,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:59,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:45:59,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:59,954 INFO L124 PetriNetUnfolderBase]: 1078/1837 cut-off events. [2024-06-27 22:45:59,954 INFO L125 PetriNetUnfolderBase]: For 22293/22293 co-relation queries the response was YES. [2024-06-27 22:45:59,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12498 conditions, 1837 events. 1078/1837 cut-off events. For 22293/22293 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9830 event pairs, 159 based on Foata normal form. 4/1804 useless extension candidates. Maximal degree in co-relation 12419. Up to 1393 conditions per place. [2024-06-27 22:45:59,969 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 256 selfloop transitions, 88 changer transitions 0/350 dead transitions. [2024-06-27 22:45:59,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 350 transitions, 5410 flow [2024-06-27 22:45:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 22:45:59,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-27 22:45:59,978 INFO L175 Difference]: Start difference. First operand has 153 places, 297 transitions, 4196 flow. Second operand 8 states and 141 transitions. [2024-06-27 22:45:59,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 350 transitions, 5410 flow [2024-06-27 22:46:00,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 350 transitions, 5238 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:00,038 INFO L231 Difference]: Finished difference. Result has 154 places, 305 transitions, 4344 flow [2024-06-27 22:46:00,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4024, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4344, PETRI_PLACES=154, PETRI_TRANSITIONS=305} [2024-06-27 22:46:00,039 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 115 predicate places. [2024-06-27 22:46:00,039 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 305 transitions, 4344 flow [2024-06-27 22:46:00,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:00,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:00,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:00,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:46:00,040 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:46:00,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1879776815, now seen corresponding path program 4 times [2024-06-27 22:46:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132459063] [2024-06-27 22:46:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:01,190 INFO 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:46:01,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:01,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132459063] [2024-06-27 22:46:01,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132459063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:01,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:01,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578567890] [2024-06-27 22:46:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:01,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:01,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 305 transitions, 4344 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:46:01,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:01,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:01,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:01,918 INFO L124 PetriNetUnfolderBase]: 1074/1820 cut-off events. [2024-06-27 22:46:01,918 INFO L125 PetriNetUnfolderBase]: For 22882/22882 co-relation queries the response was YES. [2024-06-27 22:46:01,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12593 conditions, 1820 events. 1074/1820 cut-off events. For 22882/22882 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9675 event pairs, 145 based on Foata normal form. 3/1790 useless extension candidates. Maximal degree in co-relation 12513. Up to 1491 conditions per place. [2024-06-27 22:46:01,935 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 276 selfloop transitions, 63 changer transitions 0/345 dead transitions. [2024-06-27 22:46:01,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 345 transitions, 5443 flow [2024-06-27 22:46:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 22:46:01,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-27 22:46:01,936 INFO L175 Difference]: Start difference. First operand has 154 places, 305 transitions, 4344 flow. Second operand 8 states and 137 transitions. [2024-06-27 22:46:01,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 345 transitions, 5443 flow [2024-06-27 22:46:02,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 345 transitions, 5225 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:02,006 INFO L231 Difference]: Finished difference. Result has 158 places, 318 transitions, 4501 flow [2024-06-27 22:46:02,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4128, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4501, PETRI_PLACES=158, PETRI_TRANSITIONS=318} [2024-06-27 22:46:02,006 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 119 predicate places. [2024-06-27 22:46:02,007 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 318 transitions, 4501 flow [2024-06-27 22:46:02,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:46:02,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:02,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:02,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:46:02,007 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:46:02,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1879776970, now seen corresponding path program 4 times [2024-06-27 22:46:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:02,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690412950] [2024-06-27 22:46:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690412950] [2024-06-27 22:46:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690412950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:02,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:02,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977539176] [2024-06-27 22:46:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:02,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:02,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:02,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:02,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:02,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 318 transitions, 4501 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:02,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:02,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:02,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:03,424 INFO L124 PetriNetUnfolderBase]: 1096/1865 cut-off events. [2024-06-27 22:46:03,425 INFO L125 PetriNetUnfolderBase]: For 23719/23719 co-relation queries the response was YES. [2024-06-27 22:46:03,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 1865 events. 1096/1865 cut-off events. For 23719/23719 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9982 event pairs, 158 based on Foata normal form. 2/1830 useless extension candidates. Maximal degree in co-relation 12955. Up to 1484 conditions per place. [2024-06-27 22:46:03,442 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 275 selfloop transitions, 76 changer transitions 0/357 dead transitions. [2024-06-27 22:46:03,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 357 transitions, 5669 flow [2024-06-27 22:46:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-27 22:46:03,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:46:03,443 INFO L175 Difference]: Start difference. First operand has 158 places, 318 transitions, 4501 flow. Second operand 7 states and 126 transitions. [2024-06-27 22:46:03,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 357 transitions, 5669 flow [2024-06-27 22:46:03,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 357 transitions, 5594 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:03,519 INFO L231 Difference]: Finished difference. Result has 162 places, 325 transitions, 4767 flow [2024-06-27 22:46:03,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4433, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4767, PETRI_PLACES=162, PETRI_TRANSITIONS=325} [2024-06-27 22:46:03,520 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 123 predicate places. [2024-06-27 22:46:03,520 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 325 transitions, 4767 flow [2024-06-27 22:46:03,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:03,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:03,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:03,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:46:03,520 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:46:03,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1879782550, now seen corresponding path program 5 times [2024-06-27 22:46:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088958359] [2024-06-27 22:46:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:03,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:04,442 INFO 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:46:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088958359] [2024-06-27 22:46:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088958359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:04,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323447278] [2024-06-27 22:46:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:04,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:04,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:04,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:04,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 325 transitions, 4767 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:04,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:04,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:04,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:05,040 INFO L124 PetriNetUnfolderBase]: 1118/1898 cut-off events. [2024-06-27 22:46:05,040 INFO L125 PetriNetUnfolderBase]: For 25988/25988 co-relation queries the response was YES. [2024-06-27 22:46:05,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13538 conditions, 1898 events. 1118/1898 cut-off events. For 25988/25988 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10172 event pairs, 159 based on Foata normal form. 2/1863 useless extension candidates. Maximal degree in co-relation 13453. Up to 1503 conditions per place. [2024-06-27 22:46:05,057 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 291 selfloop transitions, 72 changer transitions 0/369 dead transitions. [2024-06-27 22:46:05,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 369 transitions, 5979 flow [2024-06-27 22:46:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 22:46:05,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-27 22:46:05,058 INFO L175 Difference]: Start difference. First operand has 162 places, 325 transitions, 4767 flow. Second operand 7 states and 124 transitions. [2024-06-27 22:46:05,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 369 transitions, 5979 flow [2024-06-27 22:46:05,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 369 transitions, 5683 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:05,155 INFO L231 Difference]: Finished difference. Result has 163 places, 330 transitions, 4734 flow [2024-06-27 22:46:05,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4487, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4734, PETRI_PLACES=163, PETRI_TRANSITIONS=330} [2024-06-27 22:46:05,156 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 124 predicate places. [2024-06-27 22:46:05,156 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 330 transitions, 4734 flow [2024-06-27 22:46:05,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:05,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:05,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:05,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:46:05,157 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:46:05,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1888323887, now seen corresponding path program 1 times [2024-06-27 22:46:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:05,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723509037] [2024-06-27 22:46:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:05,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:06,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723509037] [2024-06-27 22:46:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723509037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:06,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:06,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647245479] [2024-06-27 22:46:06,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:06,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:06,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:06,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:06,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:06,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 330 transitions, 4734 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:06,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:06,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:06,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:06,689 INFO L124 PetriNetUnfolderBase]: 1122/1896 cut-off events. [2024-06-27 22:46:06,689 INFO L125 PetriNetUnfolderBase]: For 25759/25759 co-relation queries the response was YES. [2024-06-27 22:46:06,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13317 conditions, 1896 events. 1122/1896 cut-off events. For 25759/25759 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10108 event pairs, 161 based on Foata normal form. 1/1863 useless extension candidates. Maximal degree in co-relation 13232. Up to 1698 conditions per place. [2024-06-27 22:46:06,704 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 318 selfloop transitions, 36 changer transitions 0/360 dead transitions. [2024-06-27 22:46:06,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 360 transitions, 5793 flow [2024-06-27 22:46:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-27 22:46:06,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 22:46:06,706 INFO L175 Difference]: Start difference. First operand has 163 places, 330 transitions, 4734 flow. Second operand 6 states and 102 transitions. [2024-06-27 22:46:06,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 360 transitions, 5793 flow [2024-06-27 22:46:06,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 360 transitions, 5651 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:06,797 INFO L231 Difference]: Finished difference. Result has 167 places, 340 transitions, 4910 flow [2024-06-27 22:46:06,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4617, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4910, PETRI_PLACES=167, PETRI_TRANSITIONS=340} [2024-06-27 22:46:06,798 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 128 predicate places. [2024-06-27 22:46:06,798 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 340 transitions, 4910 flow [2024-06-27 22:46:06,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:06,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:06,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:06,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:46:06,799 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:46:06,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1802982172, now seen corresponding path program 6 times [2024-06-27 22:46:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:06,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82804018] [2024-06-27 22:46:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:06,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:07,658 INFO 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:46:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82804018] [2024-06-27 22:46:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82804018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:07,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558893486] [2024-06-27 22:46:07,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:07,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:07,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:07,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:07,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:07,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 340 transitions, 4910 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:07,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:07,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:07,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:08,245 INFO L124 PetriNetUnfolderBase]: 1121/1888 cut-off events. [2024-06-27 22:46:08,246 INFO L125 PetriNetUnfolderBase]: For 26446/26446 co-relation queries the response was YES. [2024-06-27 22:46:08,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13252 conditions, 1888 events. 1121/1888 cut-off events. For 26446/26446 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10007 event pairs, 166 based on Foata normal form. 2/1858 useless extension candidates. Maximal degree in co-relation 13164. Up to 1678 conditions per place. [2024-06-27 22:46:08,262 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 333 selfloop transitions, 33 changer transitions 0/372 dead transitions. [2024-06-27 22:46:08,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 372 transitions, 5953 flow [2024-06-27 22:46:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 22:46:08,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-27 22:46:08,263 INFO L175 Difference]: Start difference. First operand has 167 places, 340 transitions, 4910 flow. Second operand 7 states and 117 transitions. [2024-06-27 22:46:08,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 372 transitions, 5953 flow [2024-06-27 22:46:08,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 372 transitions, 5894 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 22:46:08,358 INFO L231 Difference]: Finished difference. Result has 172 places, 345 transitions, 5035 flow [2024-06-27 22:46:08,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4851, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5035, PETRI_PLACES=172, PETRI_TRANSITIONS=345} [2024-06-27 22:46:08,359 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 133 predicate places. [2024-06-27 22:46:08,359 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 345 transitions, 5035 flow [2024-06-27 22:46:08,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:08,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:08,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:46:08,360 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:46:08,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2081646251, now seen corresponding path program 5 times [2024-06-27 22:46:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582813581] [2024-06-27 22:46:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:09,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:46:09,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:09,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582813581] [2024-06-27 22:46:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582813581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:09,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:09,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797266352] [2024-06-27 22:46:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:09,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:09,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:46:09,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 345 transitions, 5035 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:46:09,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:09,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:46:09,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:10,395 INFO L124 PetriNetUnfolderBase]: 1229/2138 cut-off events. [2024-06-27 22:46:10,395 INFO L125 PetriNetUnfolderBase]: For 31322/31360 co-relation queries the response was YES. [2024-06-27 22:46:10,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14677 conditions, 2138 events. 1229/2138 cut-off events. For 31322/31360 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12134 event pairs, 102 based on Foata normal form. 34/2121 useless extension candidates. Maximal degree in co-relation 14587. Up to 894 conditions per place. [2024-06-27 22:46:10,413 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 164 selfloop transitions, 223 changer transitions 0/442 dead transitions. [2024-06-27 22:46:10,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 442 transitions, 6885 flow [2024-06-27 22:46:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 22:46:10,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2024-06-27 22:46:10,414 INFO L175 Difference]: Start difference. First operand has 172 places, 345 transitions, 5035 flow. Second operand 8 states and 151 transitions. [2024-06-27 22:46:10,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 442 transitions, 6885 flow [2024-06-27 22:46:10,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 442 transitions, 6785 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:10,514 INFO L231 Difference]: Finished difference. Result has 177 places, 408 transitions, 6438 flow [2024-06-27 22:46:10,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4952, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6438, PETRI_PLACES=177, PETRI_TRANSITIONS=408} [2024-06-27 22:46:10,514 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 138 predicate places. [2024-06-27 22:46:10,515 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 408 transitions, 6438 flow [2024-06-27 22:46:10,515 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:46:10,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:10,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:10,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:46:10,515 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:46:10,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash 499139861, now seen corresponding path program 6 times [2024-06-27 22:46:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:10,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144094124] [2024-06-27 22:46:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:11,587 INFO 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:46:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144094124] [2024-06-27 22:46:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144094124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933182561] [2024-06-27 22:46:11,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:11,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:11,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:11,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:11,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:46:11,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 408 transitions, 6438 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:46:11,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:11,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:46:11,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:12,251 INFO L124 PetriNetUnfolderBase]: 1338/2287 cut-off events. [2024-06-27 22:46:12,252 INFO L125 PetriNetUnfolderBase]: For 39606/39606 co-relation queries the response was YES. [2024-06-27 22:46:12,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17483 conditions, 2287 events. 1338/2287 cut-off events. For 39606/39606 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12893 event pairs, 126 based on Foata normal form. 1/2230 useless extension candidates. Maximal degree in co-relation 17390. Up to 1085 conditions per place. [2024-06-27 22:46:12,274 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 217 selfloop transitions, 244 changer transitions 0/473 dead transitions. [2024-06-27 22:46:12,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 473 transitions, 8287 flow [2024-06-27 22:46:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 22:46:12,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:46:12,276 INFO L175 Difference]: Start difference. First operand has 177 places, 408 transitions, 6438 flow. Second operand 8 states and 152 transitions. [2024-06-27 22:46:12,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 473 transitions, 8287 flow [2024-06-27 22:46:12,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 473 transitions, 7921 flow, removed 134 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:12,417 INFO L231 Difference]: Finished difference. Result has 183 places, 431 transitions, 7294 flow [2024-06-27 22:46:12,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6200, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7294, PETRI_PLACES=183, PETRI_TRANSITIONS=431} [2024-06-27 22:46:12,417 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 144 predicate places. [2024-06-27 22:46:12,417 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 431 transitions, 7294 flow [2024-06-27 22:46:12,418 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:46:12,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:12,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:12,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:46:12,418 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:46:12,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash 834386261, now seen corresponding path program 7 times [2024-06-27 22:46:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:12,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567547934] [2024-06-27 22:46:12,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567547934] [2024-06-27 22:46:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567547934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:13,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:13,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066756431] [2024-06-27 22:46:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:13,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:13,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:13,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:46:13,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 431 transitions, 7294 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:46:13,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:13,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:46:13,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:14,293 INFO L124 PetriNetUnfolderBase]: 1364/2344 cut-off events. [2024-06-27 22:46:14,293 INFO L125 PetriNetUnfolderBase]: For 43570/43570 co-relation queries the response was YES. [2024-06-27 22:46:14,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18847 conditions, 2344 events. 1364/2344 cut-off events. For 43570/43570 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13361 event pairs, 137 based on Foata normal form. 1/2280 useless extension candidates. Maximal degree in co-relation 18751. Up to 1813 conditions per place. [2024-06-27 22:46:14,316 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 342 selfloop transitions, 124 changer transitions 0/478 dead transitions. [2024-06-27 22:46:14,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 478 transitions, 8774 flow [2024-06-27 22:46:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 22:46:14,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:46:14,317 INFO L175 Difference]: Start difference. First operand has 183 places, 431 transitions, 7294 flow. Second operand 8 states and 140 transitions. [2024-06-27 22:46:14,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 478 transitions, 8774 flow [2024-06-27 22:46:14,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 478 transitions, 8501 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:14,502 INFO L231 Difference]: Finished difference. Result has 187 places, 449 transitions, 7679 flow [2024-06-27 22:46:14,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7041, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7679, PETRI_PLACES=187, PETRI_TRANSITIONS=449} [2024-06-27 22:46:14,503 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 148 predicate places. [2024-06-27 22:46:14,503 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 449 transitions, 7679 flow [2024-06-27 22:46:14,503 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:46:14,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:14,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:14,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:46:14,504 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:46:14,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2146091726, now seen corresponding path program 7 times [2024-06-27 22:46:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:14,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866013194] [2024-06-27 22:46:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:16,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:46:16,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:16,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866013194] [2024-06-27 22:46:16,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866013194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:16,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:16,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:16,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065758441] [2024-06-27 22:46:16,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:16,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:16,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:16,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:16,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:16,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 449 transitions, 7679 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:16,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:16,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:16,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:17,267 INFO L124 PetriNetUnfolderBase]: 1457/2474 cut-off events. [2024-06-27 22:46:17,267 INFO L125 PetriNetUnfolderBase]: For 46016/46016 co-relation queries the response was YES. [2024-06-27 22:46:17,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19988 conditions, 2474 events. 1457/2474 cut-off events. For 46016/46016 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14077 event pairs, 145 based on Foata normal form. 1/2429 useless extension candidates. Maximal degree in co-relation 19891. Up to 1036 conditions per place. [2024-06-27 22:46:17,290 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 224 selfloop transitions, 296 changer transitions 0/526 dead transitions. [2024-06-27 22:46:17,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 526 transitions, 9812 flow [2024-06-27 22:46:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 22:46:17,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:46:17,292 INFO L175 Difference]: Start difference. First operand has 187 places, 449 transitions, 7679 flow. Second operand 9 states and 160 transitions. [2024-06-27 22:46:17,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 526 transitions, 9812 flow [2024-06-27 22:46:17,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 526 transitions, 9616 flow, removed 76 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:17,490 INFO L231 Difference]: Finished difference. Result has 195 places, 486 transitions, 9079 flow [2024-06-27 22:46:17,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7534, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9079, PETRI_PLACES=195, PETRI_TRANSITIONS=486} [2024-06-27 22:46:17,491 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 156 predicate places. [2024-06-27 22:46:17,491 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 486 transitions, 9079 flow [2024-06-27 22:46:17,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:17,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:17,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:17,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:46:17,492 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:46:17,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1514355883, now seen corresponding path program 2 times [2024-06-27 22:46:17,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:17,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575357775] [2024-06-27 22:46:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:18,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:46:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575357775] [2024-06-27 22:46:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575357775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:18,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:18,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572034260] [2024-06-27 22:46:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:18,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:18,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:18,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:18,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 486 transitions, 9079 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:18,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:18,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:18,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:19,747 INFO L124 PetriNetUnfolderBase]: 1497/2535 cut-off events. [2024-06-27 22:46:19,747 INFO L125 PetriNetUnfolderBase]: For 55485/55485 co-relation queries the response was YES. [2024-06-27 22:46:19,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22465 conditions, 2535 events. 1497/2535 cut-off events. For 55485/55485 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14429 event pairs, 183 based on Foata normal form. 1/2487 useless extension candidates. Maximal degree in co-relation 22364. Up to 2103 conditions per place. [2024-06-27 22:46:19,775 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 426 selfloop transitions, 113 changer transitions 0/545 dead transitions. [2024-06-27 22:46:19,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 545 transitions, 11033 flow [2024-06-27 22:46:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 22:46:19,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:46:19,781 INFO L175 Difference]: Start difference. First operand has 195 places, 486 transitions, 9079 flow. Second operand 8 states and 140 transitions. [2024-06-27 22:46:19,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 545 transitions, 11033 flow [2024-06-27 22:46:19,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 545 transitions, 10745 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:20,003 INFO L231 Difference]: Finished difference. Result has 202 places, 515 transitions, 9733 flow [2024-06-27 22:46:20,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8814, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9733, PETRI_PLACES=202, PETRI_TRANSITIONS=515} [2024-06-27 22:46:20,004 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 163 predicate places. [2024-06-27 22:46:20,004 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 515 transitions, 9733 flow [2024-06-27 22:46:20,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:20,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:20,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:20,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:46:20,005 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:46:20,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2145150920, now seen corresponding path program 8 times [2024-06-27 22:46:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:20,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578250574] [2024-06-27 22:46:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:21,683 INFO 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:46:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578250574] [2024-06-27 22:46:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578250574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320189725] [2024-06-27 22:46:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:21,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:21,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 515 transitions, 9733 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:21,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:21,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:21,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:23,065 INFO L124 PetriNetUnfolderBase]: 1517/2560 cut-off events. [2024-06-27 22:46:23,065 INFO L125 PetriNetUnfolderBase]: For 58144/58144 co-relation queries the response was YES. [2024-06-27 22:46:23,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22643 conditions, 2560 events. 1517/2560 cut-off events. For 58144/58144 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 14544 event pairs, 181 based on Foata normal form. 1/2514 useless extension candidates. Maximal degree in co-relation 22538. Up to 2097 conditions per place. [2024-06-27 22:46:23,090 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 405 selfloop transitions, 151 changer transitions 0/562 dead transitions. [2024-06-27 22:46:23,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 562 transitions, 11367 flow [2024-06-27 22:46:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:46:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:46:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-06-27 22:46:23,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649350649350649 [2024-06-27 22:46:23,092 INFO L175 Difference]: Start difference. First operand has 202 places, 515 transitions, 9733 flow. Second operand 11 states and 179 transitions. [2024-06-27 22:46:23,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 562 transitions, 11367 flow [2024-06-27 22:46:23,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 562 transitions, 11251 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:23,311 INFO L231 Difference]: Finished difference. Result has 211 places, 529 transitions, 10220 flow [2024-06-27 22:46:23,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9617, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10220, PETRI_PLACES=211, PETRI_TRANSITIONS=529} [2024-06-27 22:46:23,312 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 172 predicate places. [2024-06-27 22:46:23,312 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 529 transitions, 10220 flow [2024-06-27 22:46:23,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:23,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:23,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:46:23,313 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:46:23,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1535632640, now seen corresponding path program 9 times [2024-06-27 22:46:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:23,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803716207] [2024-06-27 22:46:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:24,867 INFO 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:46:24,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803716207] [2024-06-27 22:46:24,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803716207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:24,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:24,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:24,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448563395] [2024-06-27 22:46:24,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:24,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:24,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:24,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:24,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:24,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 529 transitions, 10220 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:24,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:24,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:24,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:25,918 INFO L124 PetriNetUnfolderBase]: 1515/2557 cut-off events. [2024-06-27 22:46:25,918 INFO L125 PetriNetUnfolderBase]: For 60096/60096 co-relation queries the response was YES. [2024-06-27 22:46:25,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22795 conditions, 2557 events. 1515/2557 cut-off events. For 60096/60096 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 14522 event pairs, 181 based on Foata normal form. 1/2511 useless extension candidates. Maximal degree in co-relation 22688. Up to 2095 conditions per place. [2024-06-27 22:46:25,952 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 401 selfloop transitions, 149 changer transitions 0/556 dead transitions. [2024-06-27 22:46:25,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 556 transitions, 11500 flow [2024-06-27 22:46:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 22:46:25,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-27 22:46:25,954 INFO L175 Difference]: Start difference. First operand has 211 places, 529 transitions, 10220 flow. Second operand 9 states and 152 transitions. [2024-06-27 22:46:25,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 556 transitions, 11500 flow [2024-06-27 22:46:26,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 556 transitions, 11225 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:26,205 INFO L231 Difference]: Finished difference. Result has 213 places, 529 transitions, 10257 flow [2024-06-27 22:46:26,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9945, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10257, PETRI_PLACES=213, PETRI_TRANSITIONS=529} [2024-06-27 22:46:26,206 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 174 predicate places. [2024-06-27 22:46:26,206 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 529 transitions, 10257 flow [2024-06-27 22:46:26,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:26,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:26,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:26,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:46:26,207 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:46:26,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2145156655, now seen corresponding path program 8 times [2024-06-27 22:46:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:26,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233215356] [2024-06-27 22:46:26,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:26,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:27,564 INFO 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:46:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233215356] [2024-06-27 22:46:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233215356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:27,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294823448] [2024-06-27 22:46:27,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:27,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:27,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:27,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:27,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:46:27,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 529 transitions, 10257 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:46:27,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:27,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:46:27,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:28,434 INFO L124 PetriNetUnfolderBase]: 1525/2581 cut-off events. [2024-06-27 22:46:28,434 INFO L125 PetriNetUnfolderBase]: For 60631/60631 co-relation queries the response was YES. [2024-06-27 22:46:28,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23171 conditions, 2581 events. 1525/2581 cut-off events. For 60631/60631 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14848 event pairs, 167 based on Foata normal form. 3/2520 useless extension candidates. Maximal degree in co-relation 23062. Up to 1795 conditions per place. [2024-06-27 22:46:28,462 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 392 selfloop transitions, 171 changer transitions 0/577 dead transitions. [2024-06-27 22:46:28,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 577 transitions, 12056 flow [2024-06-27 22:46:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 22:46:28,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:46:28,464 INFO L175 Difference]: Start difference. First operand has 213 places, 529 transitions, 10257 flow. Second operand 8 states and 144 transitions. [2024-06-27 22:46:28,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 577 transitions, 12056 flow [2024-06-27 22:46:28,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 577 transitions, 11756 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:46:28,734 INFO L231 Difference]: Finished difference. Result has 214 places, 540 transitions, 10626 flow [2024-06-27 22:46:28,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9959, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10626, PETRI_PLACES=214, PETRI_TRANSITIONS=540} [2024-06-27 22:46:28,735 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 175 predicate places. [2024-06-27 22:46:28,735 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 540 transitions, 10626 flow [2024-06-27 22:46:28,735 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:46:28,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:28,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:28,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:46:28,736 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:46:28,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -264247688, now seen corresponding path program 1 times [2024-06-27 22:46:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314857360] [2024-06-27 22:46:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:30,457 INFO 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:46:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:30,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314857360] [2024-06-27 22:46:30,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314857360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:30,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:30,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:46:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132587838] [2024-06-27 22:46:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:46:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:46:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:46:30,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:30,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 540 transitions, 10626 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:30,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:30,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:30,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:31,565 INFO L124 PetriNetUnfolderBase]: 1636/2772 cut-off events. [2024-06-27 22:46:31,565 INFO L125 PetriNetUnfolderBase]: For 69441/69441 co-relation queries the response was YES. [2024-06-27 22:46:31,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25107 conditions, 2772 events. 1636/2772 cut-off events. For 69441/69441 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 16267 event pairs, 178 based on Foata normal form. 2/2725 useless extension candidates. Maximal degree in co-relation 24996. Up to 2191 conditions per place. [2024-06-27 22:46:31,596 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 478 selfloop transitions, 120 changer transitions 0/604 dead transitions. [2024-06-27 22:46:31,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 604 transitions, 12611 flow [2024-06-27 22:46:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:46:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:46:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:46:31,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2024-06-27 22:46:31,598 INFO L175 Difference]: Start difference. First operand has 214 places, 540 transitions, 10626 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:46:31,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 604 transitions, 12611 flow [2024-06-27 22:46:31,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 604 transitions, 12410 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:31,926 INFO L231 Difference]: Finished difference. Result has 222 places, 566 transitions, 11257 flow [2024-06-27 22:46:31,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=10432, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11257, PETRI_PLACES=222, PETRI_TRANSITIONS=566} [2024-06-27 22:46:31,927 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 183 predicate places. [2024-06-27 22:46:31,927 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 566 transitions, 11257 flow [2024-06-27 22:46:31,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:31,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:31,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:31,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:46:31,927 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:46:31,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash -264187238, now seen corresponding path program 2 times [2024-06-27 22:46:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409015499] [2024-06-27 22:46:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:33,643 INFO 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:46:33,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:33,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409015499] [2024-06-27 22:46:33,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409015499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:33,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:33,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:46:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638943380] [2024-06-27 22:46:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:33,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:46:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:33,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:46:33,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:46:33,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:33,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 566 transitions, 11257 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:33,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:33,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:33,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:34,678 INFO L124 PetriNetUnfolderBase]: 1658/2824 cut-off events. [2024-06-27 22:46:34,679 INFO L125 PetriNetUnfolderBase]: For 73830/73830 co-relation queries the response was YES. [2024-06-27 22:46:34,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25736 conditions, 2824 events. 1658/2824 cut-off events. For 73830/73830 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 16661 event pairs, 194 based on Foata normal form. 2/2773 useless extension candidates. Maximal degree in co-relation 25622. Up to 2309 conditions per place. [2024-06-27 22:46:34,709 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 479 selfloop transitions, 127 changer transitions 0/612 dead transitions. [2024-06-27 22:46:34,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 612 transitions, 12900 flow [2024-06-27 22:46:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:46:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:46:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-27 22:46:34,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597402597402597 [2024-06-27 22:46:34,710 INFO L175 Difference]: Start difference. First operand has 222 places, 566 transitions, 11257 flow. Second operand 11 states and 177 transitions. [2024-06-27 22:46:34,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 612 transitions, 12900 flow [2024-06-27 22:46:35,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 612 transitions, 12670 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:35,050 INFO L231 Difference]: Finished difference. Result has 227 places, 571 transitions, 11457 flow [2024-06-27 22:46:35,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11063, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11457, PETRI_PLACES=227, PETRI_TRANSITIONS=571} [2024-06-27 22:46:35,051 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 188 predicate places. [2024-06-27 22:46:35,051 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 571 transitions, 11457 flow [2024-06-27 22:46:35,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:35,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:35,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:35,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:46:35,052 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:46:35,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash -145914860, now seen corresponding path program 1 times [2024-06-27 22:46:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136172644] [2024-06-27 22:46:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:36,506 INFO 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:46:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136172644] [2024-06-27 22:46:36,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136172644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:36,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:36,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:36,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653503741] [2024-06-27 22:46:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:36,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:36,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:36,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 571 transitions, 11457 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:36,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:36,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:36,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:37,370 INFO L124 PetriNetUnfolderBase]: 1673/2830 cut-off events. [2024-06-27 22:46:37,370 INFO L125 PetriNetUnfolderBase]: For 71481/71481 co-relation queries the response was YES. [2024-06-27 22:46:37,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25709 conditions, 2830 events. 1673/2830 cut-off events. For 71481/71481 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16616 event pairs, 237 based on Foata normal form. 2/2784 useless extension candidates. Maximal degree in co-relation 25595. Up to 2404 conditions per place. [2024-06-27 22:46:37,405 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 491 selfloop transitions, 103 changer transitions 0/600 dead transitions. [2024-06-27 22:46:37,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 600 transitions, 12930 flow [2024-06-27 22:46:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-27 22:46:37,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45396825396825397 [2024-06-27 22:46:37,406 INFO L175 Difference]: Start difference. First operand has 227 places, 571 transitions, 11457 flow. Second operand 9 states and 143 transitions. [2024-06-27 22:46:37,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 600 transitions, 12930 flow [2024-06-27 22:46:37,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 600 transitions, 12665 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:37,754 INFO L231 Difference]: Finished difference. Result has 229 places, 573 transitions, 11436 flow [2024-06-27 22:46:37,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11192, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11436, PETRI_PLACES=229, PETRI_TRANSITIONS=573} [2024-06-27 22:46:37,755 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 190 predicate places. [2024-06-27 22:46:37,755 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 573 transitions, 11436 flow [2024-06-27 22:46:37,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:37,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:37,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:37,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:46:37,756 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:46:37,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash 603857716, now seen corresponding path program 1 times [2024-06-27 22:46:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:37,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923714060] [2024-06-27 22:46:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:39,142 INFO 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:46:39,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:39,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923714060] [2024-06-27 22:46:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923714060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:39,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:46:39,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418664464] [2024-06-27 22:46:39,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:39,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:46:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:46:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:46:39,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:39,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 573 transitions, 11436 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:39,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:39,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:39,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:40,228 INFO L124 PetriNetUnfolderBase]: 1701/2880 cut-off events. [2024-06-27 22:46:40,228 INFO L125 PetriNetUnfolderBase]: For 73463/73463 co-relation queries the response was YES. [2024-06-27 22:46:40,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26090 conditions, 2880 events. 1701/2880 cut-off events. For 73463/73463 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 17011 event pairs, 233 based on Foata normal form. 2/2832 useless extension candidates. Maximal degree in co-relation 25975. Up to 2243 conditions per place. [2024-06-27 22:46:40,259 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 472 selfloop transitions, 148 changer transitions 0/626 dead transitions. [2024-06-27 22:46:40,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 626 transitions, 13355 flow [2024-06-27 22:46:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:46:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:46:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:46:40,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2024-06-27 22:46:40,261 INFO L175 Difference]: Start difference. First operand has 229 places, 573 transitions, 11436 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:46:40,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 626 transitions, 13355 flow [2024-06-27 22:46:40,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 626 transitions, 13137 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:40,599 INFO L231 Difference]: Finished difference. Result has 232 places, 578 transitions, 11630 flow [2024-06-27 22:46:40,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11218, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11630, PETRI_PLACES=232, PETRI_TRANSITIONS=578} [2024-06-27 22:46:40,599 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 193 predicate places. [2024-06-27 22:46:40,600 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 578 transitions, 11630 flow [2024-06-27 22:46:40,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:40,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:40,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:40,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:46:40,600 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:46:40,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash 603857592, now seen corresponding path program 3 times [2024-06-27 22:46:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967320546] [2024-06-27 22:46:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:42,017 INFO 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:46:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967320546] [2024-06-27 22:46:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967320546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:46:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25545099] [2024-06-27 22:46:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:46:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:42,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:46:42,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:46:42,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:42,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 578 transitions, 11630 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:42,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:42,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:42,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:43,176 INFO L124 PetriNetUnfolderBase]: 1784/3020 cut-off events. [2024-06-27 22:46:43,176 INFO L125 PetriNetUnfolderBase]: For 84974/84974 co-relation queries the response was YES. [2024-06-27 22:46:43,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27176 conditions, 3020 events. 1784/3020 cut-off events. For 84974/84974 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 18010 event pairs, 251 based on Foata normal form. 12/2984 useless extension candidates. Maximal degree in co-relation 27060. Up to 2444 conditions per place. [2024-06-27 22:46:43,212 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 512 selfloop transitions, 105 changer transitions 0/623 dead transitions. [2024-06-27 22:46:43,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 623 transitions, 13360 flow [2024-06-27 22:46:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:46:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:46:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:46:43,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 22:46:43,217 INFO L175 Difference]: Start difference. First operand has 232 places, 578 transitions, 11630 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:46:43,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 623 transitions, 13360 flow [2024-06-27 22:46:43,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 623 transitions, 13024 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-27 22:46:43,735 INFO L231 Difference]: Finished difference. Result has 235 places, 588 transitions, 11751 flow [2024-06-27 22:46:43,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11294, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11751, PETRI_PLACES=235, PETRI_TRANSITIONS=588} [2024-06-27 22:46:43,736 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 196 predicate places. [2024-06-27 22:46:43,736 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 588 transitions, 11751 flow [2024-06-27 22:46:43,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:43,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:43,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:43,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:46:43,737 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:46:43,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1856275312, now seen corresponding path program 2 times [2024-06-27 22:46:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415811667] [2024-06-27 22:46:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415811667] [2024-06-27 22:46:45,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415811667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:45,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:45,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139170902] [2024-06-27 22:46:45,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:45,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:45,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:45,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:45,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:45,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 588 transitions, 11751 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:45,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:45,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:45,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:46,075 INFO L124 PetriNetUnfolderBase]: 1799/3044 cut-off events. [2024-06-27 22:46:46,075 INFO L125 PetriNetUnfolderBase]: For 79623/79623 co-relation queries the response was YES. [2024-06-27 22:46:46,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27321 conditions, 3044 events. 1799/3044 cut-off events. For 79623/79623 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 18128 event pairs, 281 based on Foata normal form. 2/2998 useless extension candidates. Maximal degree in co-relation 27203. Up to 2693 conditions per place. [2024-06-27 22:46:46,108 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 553 selfloop transitions, 71 changer transitions 0/630 dead transitions. [2024-06-27 22:46:46,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 630 transitions, 13562 flow [2024-06-27 22:46:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 22:46:46,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 22:46:46,110 INFO L175 Difference]: Start difference. First operand has 235 places, 588 transitions, 11751 flow. Second operand 8 states and 132 transitions. [2024-06-27 22:46:46,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 630 transitions, 13562 flow [2024-06-27 22:46:46,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 630 transitions, 13280 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:46,479 INFO L231 Difference]: Finished difference. Result has 239 places, 598 transitions, 11934 flow [2024-06-27 22:46:46,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11498, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11934, PETRI_PLACES=239, PETRI_TRANSITIONS=598} [2024-06-27 22:46:46,480 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 200 predicate places. [2024-06-27 22:46:46,480 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 598 transitions, 11934 flow [2024-06-27 22:46:46,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:46,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:46,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:46,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:46:46,481 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:46:46,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash 742737780, now seen corresponding path program 2 times [2024-06-27 22:46:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:46,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498163860] [2024-06-27 22:46:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:47,622 INFO 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:46:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:47,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498163860] [2024-06-27 22:46:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498163860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:47,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:47,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859404972] [2024-06-27 22:46:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:47,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:47,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:47,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:47,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:47,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 598 transitions, 11934 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:47,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:47,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:47,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:48,580 INFO L124 PetriNetUnfolderBase]: 1799/3048 cut-off events. [2024-06-27 22:46:48,581 INFO L125 PetriNetUnfolderBase]: For 79589/79589 co-relation queries the response was YES. [2024-06-27 22:46:48,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27326 conditions, 3048 events. 1799/3048 cut-off events. For 79589/79589 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 18231 event pairs, 253 based on Foata normal form. 2/3001 useless extension candidates. Maximal degree in co-relation 27205. Up to 2553 conditions per place. [2024-06-27 22:46:48,616 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 521 selfloop transitions, 106 changer transitions 0/633 dead transitions. [2024-06-27 22:46:48,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 633 transitions, 13634 flow [2024-06-27 22:46:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 22:46:48,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:46:48,617 INFO L175 Difference]: Start difference. First operand has 239 places, 598 transitions, 11934 flow. Second operand 8 states and 144 transitions. [2024-06-27 22:46:48,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 633 transitions, 13634 flow [2024-06-27 22:46:48,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 633 transitions, 13437 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:48,997 INFO L231 Difference]: Finished difference. Result has 243 places, 601 transitions, 12032 flow [2024-06-27 22:46:48,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11737, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12032, PETRI_PLACES=243, PETRI_TRANSITIONS=601} [2024-06-27 22:46:48,998 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 204 predicate places. [2024-06-27 22:46:48,998 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 601 transitions, 12032 flow [2024-06-27 22:46:49,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:49,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:49,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:49,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:46:49,001 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:46:49,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1856460010, now seen corresponding path program 4 times [2024-06-27 22:46:49,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:49,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639273800] [2024-06-27 22:46:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:50,191 INFO 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:46:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639273800] [2024-06-27 22:46:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639273800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:50,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293492643] [2024-06-27 22:46:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:50,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:50,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 601 transitions, 12032 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:50,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:50,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:50,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:51,261 INFO L124 PetriNetUnfolderBase]: 1872/3183 cut-off events. [2024-06-27 22:46:51,261 INFO L125 PetriNetUnfolderBase]: For 90256/90256 co-relation queries the response was YES. [2024-06-27 22:46:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28205 conditions, 3183 events. 1872/3183 cut-off events. For 90256/90256 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 19320 event pairs, 258 based on Foata normal form. 12/3146 useless extension candidates. Maximal degree in co-relation 28082. Up to 2529 conditions per place. [2024-06-27 22:46:51,298 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 529 selfloop transitions, 108 changer transitions 0/643 dead transitions. [2024-06-27 22:46:51,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 643 transitions, 13820 flow [2024-06-27 22:46:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 22:46:51,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-27 22:46:51,300 INFO L175 Difference]: Start difference. First operand has 243 places, 601 transitions, 12032 flow. Second operand 8 states and 149 transitions. [2024-06-27 22:46:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 643 transitions, 13820 flow [2024-06-27 22:46:51,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 643 transitions, 13527 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:51,769 INFO L231 Difference]: Finished difference. Result has 245 places, 608 transitions, 12117 flow [2024-06-27 22:46:51,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11753, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12117, PETRI_PLACES=245, PETRI_TRANSITIONS=608} [2024-06-27 22:46:51,770 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 206 predicate places. [2024-06-27 22:46:51,770 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 608 transitions, 12117 flow [2024-06-27 22:46:51,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:51,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:51,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:51,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:46:51,771 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:46:51,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1591175092, now seen corresponding path program 3 times [2024-06-27 22:46:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:51,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054474450] [2024-06-27 22:46:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:52,747 INFO 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:46:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:52,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054474450] [2024-06-27 22:46:52,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054474450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:52,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:52,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662061533] [2024-06-27 22:46:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:52,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:52,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:52,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 608 transitions, 12117 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:52,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:52,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:53,786 INFO L124 PetriNetUnfolderBase]: 1890/3209 cut-off events. [2024-06-27 22:46:53,786 INFO L125 PetriNetUnfolderBase]: For 83156/83156 co-relation queries the response was YES. [2024-06-27 22:46:53,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28317 conditions, 3209 events. 1890/3209 cut-off events. For 83156/83156 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 19500 event pairs, 318 based on Foata normal form. 2/3163 useless extension candidates. Maximal degree in co-relation 28193. Up to 2925 conditions per place. [2024-06-27 22:46:53,821 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 598 selfloop transitions, 27 changer transitions 0/631 dead transitions. [2024-06-27 22:46:53,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 631 transitions, 13549 flow [2024-06-27 22:46:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-27 22:46:53,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-27 22:46:53,823 INFO L175 Difference]: Start difference. First operand has 245 places, 608 transitions, 12117 flow. Second operand 8 states and 124 transitions. [2024-06-27 22:46:53,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 631 transitions, 13549 flow [2024-06-27 22:46:54,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 631 transitions, 13294 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:54,387 INFO L231 Difference]: Finished difference. Result has 248 places, 613 transitions, 12011 flow [2024-06-27 22:46:54,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11862, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12011, PETRI_PLACES=248, PETRI_TRANSITIONS=613} [2024-06-27 22:46:54,388 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 209 predicate places. [2024-06-27 22:46:54,388 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 613 transitions, 12011 flow [2024-06-27 22:46:54,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:54,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:54,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:54,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:46:54,388 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:46:54,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1591500592, now seen corresponding path program 4 times [2024-06-27 22:46:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498444521] [2024-06-27 22:46:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:55,780 INFO 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:46:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:55,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498444521] [2024-06-27 22:46:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498444521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:55,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116346535] [2024-06-27 22:46:55,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:55,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:55,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:55,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 613 transitions, 12011 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:55,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:55,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:55,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:56,860 INFO L124 PetriNetUnfolderBase]: 1905/3231 cut-off events. [2024-06-27 22:46:56,860 INFO L125 PetriNetUnfolderBase]: For 84579/84579 co-relation queries the response was YES. [2024-06-27 22:46:56,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28327 conditions, 3231 events. 1905/3231 cut-off events. For 84579/84579 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 19598 event pairs, 317 based on Foata normal form. 2/3186 useless extension candidates. Maximal degree in co-relation 28201. Up to 2918 conditions per place. [2024-06-27 22:46:56,898 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 587 selfloop transitions, 46 changer transitions 0/639 dead transitions. [2024-06-27 22:46:56,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 639 transitions, 13541 flow [2024-06-27 22:46:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-27 22:46:56,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 22:46:56,900 INFO L175 Difference]: Start difference. First operand has 248 places, 613 transitions, 12011 flow. Second operand 8 states and 125 transitions. [2024-06-27 22:46:56,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 639 transitions, 13541 flow [2024-06-27 22:46:57,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 639 transitions, 13434 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:57,428 INFO L231 Difference]: Finished difference. Result has 251 places, 615 transitions, 12053 flow [2024-06-27 22:46:57,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11904, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12053, PETRI_PLACES=251, PETRI_TRANSITIONS=615} [2024-06-27 22:46:57,428 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 212 predicate places. [2024-06-27 22:46:57,429 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 615 transitions, 12053 flow [2024-06-27 22:46:57,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:57,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:57,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:57,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:46:57,429 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:46:57,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1849788810, now seen corresponding path program 1 times [2024-06-27 22:46:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542174011] [2024-06-27 22:46:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:58,505 INFO 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:46:58,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:58,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542174011] [2024-06-27 22:46:58,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542174011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:58,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:58,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353413448] [2024-06-27 22:46:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:58,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:58,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:46:58,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 615 transitions, 12053 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:58,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:58,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:46:58,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:59,576 INFO L124 PetriNetUnfolderBase]: 1900/3216 cut-off events. [2024-06-27 22:46:59,576 INFO L125 PetriNetUnfolderBase]: For 84074/84074 co-relation queries the response was YES. [2024-06-27 22:46:59,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28227 conditions, 3216 events. 1900/3216 cut-off events. For 84074/84074 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 19400 event pairs, 326 based on Foata normal form. 1/3170 useless extension candidates. Maximal degree in co-relation 28101. Up to 2866 conditions per place. [2024-06-27 22:46:59,616 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 578 selfloop transitions, 69 changer transitions 0/653 dead transitions. [2024-06-27 22:46:59,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 653 transitions, 13884 flow [2024-06-27 22:46:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-27 22:46:59,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-27 22:46:59,618 INFO L175 Difference]: Start difference. First operand has 251 places, 615 transitions, 12053 flow. Second operand 8 states and 124 transitions. [2024-06-27 22:46:59,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 653 transitions, 13884 flow [2024-06-27 22:47:00,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 653 transitions, 13709 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:00,098 INFO L231 Difference]: Finished difference. Result has 254 places, 621 transitions, 12276 flow [2024-06-27 22:47:00,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11896, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12276, PETRI_PLACES=254, PETRI_TRANSITIONS=621} [2024-06-27 22:47:00,100 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 215 predicate places. [2024-06-27 22:47:00,100 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 621 transitions, 12276 flow [2024-06-27 22:47:00,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:00,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:00,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:00,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:47:00,101 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:47:00,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 697193438, now seen corresponding path program 5 times [2024-06-27 22:47:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:00,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869605596] [2024-06-27 22:47:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:01,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:01,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869605596] [2024-06-27 22:47:01,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869605596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:01,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:01,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:01,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895191639] [2024-06-27 22:47:01,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:01,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:01,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:01,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:47:01,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 621 transitions, 12276 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:47:01,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:01,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:47:01,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:02,310 INFO L124 PetriNetUnfolderBase]: 1677/3078 cut-off events. [2024-06-27 22:47:02,310 INFO L125 PetriNetUnfolderBase]: For 92376/92604 co-relation queries the response was YES. [2024-06-27 22:47:02,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26333 conditions, 3078 events. 1677/3078 cut-off events. For 92376/92604 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 20834 event pairs, 157 based on Foata normal form. 164/3154 useless extension candidates. Maximal degree in co-relation 26205. Up to 1289 conditions per place. [2024-06-27 22:47:02,349 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 209 selfloop transitions, 247 changer transitions 0/663 dead transitions. [2024-06-27 22:47:02,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 663 transitions, 13681 flow [2024-06-27 22:47:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:47:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:47:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 22:47:02,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-06-27 22:47:02,350 INFO L175 Difference]: Start difference. First operand has 254 places, 621 transitions, 12276 flow. Second operand 8 states and 156 transitions. [2024-06-27 22:47:02,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 663 transitions, 13681 flow [2024-06-27 22:47:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 663 transitions, 13575 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:02,769 INFO L231 Difference]: Finished difference. Result has 261 places, 631 transitions, 13253 flow [2024-06-27 22:47:02,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12174, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13253, PETRI_PLACES=261, PETRI_TRANSITIONS=631} [2024-06-27 22:47:02,769 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 222 predicate places. [2024-06-27 22:47:02,770 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 631 transitions, 13253 flow [2024-06-27 22:47:02,770 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:47:02,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:02,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:02,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:47:02,770 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:47:02,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash 277254094, now seen corresponding path program 3 times [2024-06-27 22:47:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127067002] [2024-06-27 22:47:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:03,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127067002] [2024-06-27 22:47:03,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127067002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:03,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:03,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134678704] [2024-06-27 22:47:03,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:03,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:03,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:03,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:03,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:03,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 631 transitions, 13253 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:47:03,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:03,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:03,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:05,117 INFO L124 PetriNetUnfolderBase]: 2039/3482 cut-off events. [2024-06-27 22:47:05,117 INFO L125 PetriNetUnfolderBase]: For 108310/108325 co-relation queries the response was YES. [2024-06-27 22:47:05,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31901 conditions, 3482 events. 2039/3482 cut-off events. For 108310/108325 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 21842 event pairs, 331 based on Foata normal form. 7/3411 useless extension candidates. Maximal degree in co-relation 31769. Up to 2607 conditions per place. [2024-06-27 22:47:05,156 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 461 selfloop transitions, 196 changer transitions 0/672 dead transitions. [2024-06-27 22:47:05,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 672 transitions, 15193 flow [2024-06-27 22:47:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 22:47:05,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:47:05,158 INFO L175 Difference]: Start difference. First operand has 261 places, 631 transitions, 13253 flow. Second operand 9 states and 160 transitions. [2024-06-27 22:47:05,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 672 transitions, 15193 flow [2024-06-27 22:47:05,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 672 transitions, 14984 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:05,690 INFO L231 Difference]: Finished difference. Result has 266 places, 636 transitions, 13530 flow [2024-06-27 22:47:05,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13045, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13530, PETRI_PLACES=266, PETRI_TRANSITIONS=636} [2024-06-27 22:47:05,690 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 227 predicate places. [2024-06-27 22:47:05,691 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 636 transitions, 13530 flow [2024-06-27 22:47:05,691 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:47:05,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:05,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:05,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:47:05,691 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:47:05,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 7516144, now seen corresponding path program 6 times [2024-06-27 22:47:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:05,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081306127] [2024-06-27 22:47:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:07,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081306127] [2024-06-27 22:47:07,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081306127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:07,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138935203] [2024-06-27 22:47:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:07,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:07,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:07,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 636 transitions, 13530 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:47:07,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:07,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:07,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:08,207 INFO L124 PetriNetUnfolderBase]: 2078/3553 cut-off events. [2024-06-27 22:47:08,207 INFO L125 PetriNetUnfolderBase]: For 111699/111710 co-relation queries the response was YES. [2024-06-27 22:47:08,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32422 conditions, 3553 events. 2078/3553 cut-off events. For 111699/111710 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 22479 event pairs, 187 based on Foata normal form. 7/3497 useless extension candidates. Maximal degree in co-relation 32290. Up to 2490 conditions per place. [2024-06-27 22:47:08,253 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 477 selfloop transitions, 192 changer transitions 0/684 dead transitions. [2024-06-27 22:47:08,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 684 transitions, 15491 flow [2024-06-27 22:47:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 22:47:08,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:47:08,255 INFO L175 Difference]: Start difference. First operand has 266 places, 636 transitions, 13530 flow. Second operand 9 states and 162 transitions. [2024-06-27 22:47:08,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 684 transitions, 15491 flow [2024-06-27 22:47:08,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 684 transitions, 15083 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 22:47:08,860 INFO L231 Difference]: Finished difference. Result has 269 places, 645 transitions, 13860 flow [2024-06-27 22:47:08,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13130, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13860, PETRI_PLACES=269, PETRI_TRANSITIONS=645} [2024-06-27 22:47:08,861 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 230 predicate places. [2024-06-27 22:47:08,861 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 645 transitions, 13860 flow [2024-06-27 22:47:08,861 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:47:08,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:08,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:08,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:47:08,862 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:47:08,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:08,862 INFO L85 PathProgramCache]: Analyzing trace with hash -536704852, now seen corresponding path program 4 times [2024-06-27 22:47:08,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:08,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281678774] [2024-06-27 22:47:08,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:10,006 INFO 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:47:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281678774] [2024-06-27 22:47:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281678774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:10,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:10,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715930691] [2024-06-27 22:47:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:10,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:10,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:10,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:10,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 645 transitions, 13860 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:47:10,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:10,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:10,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:11,062 INFO L124 PetriNetUnfolderBase]: 2136/3639 cut-off events. [2024-06-27 22:47:11,062 INFO L125 PetriNetUnfolderBase]: For 114908/114923 co-relation queries the response was YES. [2024-06-27 22:47:11,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33508 conditions, 3639 events. 2136/3639 cut-off events. For 114908/114923 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 23079 event pairs, 241 based on Foata normal form. 9/3570 useless extension candidates. Maximal degree in co-relation 33374. Up to 2013 conditions per place. [2024-06-27 22:47:11,112 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 307 selfloop transitions, 375 changer transitions 0/697 dead transitions. [2024-06-27 22:47:11,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 697 transitions, 16043 flow [2024-06-27 22:47:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:47:11,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2024-06-27 22:47:11,114 INFO L175 Difference]: Start difference. First operand has 269 places, 645 transitions, 13860 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:47:11,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 697 transitions, 16043 flow [2024-06-27 22:47:11,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 697 transitions, 15804 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:11,711 INFO L231 Difference]: Finished difference. Result has 273 places, 655 transitions, 14538 flow [2024-06-27 22:47:11,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13627, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14538, PETRI_PLACES=273, PETRI_TRANSITIONS=655} [2024-06-27 22:47:11,712 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 234 predicate places. [2024-06-27 22:47:11,712 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 655 transitions, 14538 flow [2024-06-27 22:47:11,712 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:47:11,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:11,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:47:11,713 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:47:11,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -536704976, now seen corresponding path program 7 times [2024-06-27 22:47:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409538840] [2024-06-27 22:47:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:13,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:47:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409538840] [2024-06-27 22:47:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409538840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223553617] [2024-06-27 22:47:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:13,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:13,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:13,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:13,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 655 transitions, 14538 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:47:13,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:13,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:13,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:14,296 INFO L124 PetriNetUnfolderBase]: 2187/3766 cut-off events. [2024-06-27 22:47:14,296 INFO L125 PetriNetUnfolderBase]: For 115684/115697 co-relation queries the response was YES. [2024-06-27 22:47:14,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34614 conditions, 3766 events. 2187/3766 cut-off events. For 115684/115697 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 24242 event pairs, 274 based on Foata normal form. 9/3694 useless extension candidates. Maximal degree in co-relation 34479. Up to 2926 conditions per place. [2024-06-27 22:47:14,338 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 499 selfloop transitions, 183 changer transitions 0/697 dead transitions. [2024-06-27 22:47:14,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 697 transitions, 16301 flow [2024-06-27 22:47:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 22:47:14,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 22:47:14,339 INFO L175 Difference]: Start difference. First operand has 273 places, 655 transitions, 14538 flow. Second operand 9 states and 160 transitions. [2024-06-27 22:47:14,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 697 transitions, 16301 flow [2024-06-27 22:47:14,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 697 transitions, 15691 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:14,894 INFO L231 Difference]: Finished difference. Result has 276 places, 661 transitions, 14429 flow [2024-06-27 22:47:14,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=13932, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14429, PETRI_PLACES=276, PETRI_TRANSITIONS=661} [2024-06-27 22:47:14,894 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 237 predicate places. [2024-06-27 22:47:14,895 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 661 transitions, 14429 flow [2024-06-27 22:47:14,895 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:47:14,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:14,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:47:14,895 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:47:14,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 96175958, now seen corresponding path program 5 times [2024-06-27 22:47:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124558724] [2024-06-27 22:47:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:16,174 INFO 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:47:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124558724] [2024-06-27 22:47:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124558724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:16,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270408226] [2024-06-27 22:47:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:16,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:16,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:16,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:16,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:16,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 661 transitions, 14429 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:47:16,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:16,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:16,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:17,396 INFO L124 PetriNetUnfolderBase]: 2177/3713 cut-off events. [2024-06-27 22:47:17,397 INFO L125 PetriNetUnfolderBase]: For 111283/111300 co-relation queries the response was YES. [2024-06-27 22:47:17,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33871 conditions, 3713 events. 2177/3713 cut-off events. For 111283/111300 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 23657 event pairs, 347 based on Foata normal form. 12/3643 useless extension candidates. Maximal degree in co-relation 33735. Up to 2542 conditions per place. [2024-06-27 22:47:17,444 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 386 selfloop transitions, 299 changer transitions 0/700 dead transitions. [2024-06-27 22:47:17,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 700 transitions, 16374 flow [2024-06-27 22:47:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 22:47:17,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-27 22:47:17,445 INFO L175 Difference]: Start difference. First operand has 276 places, 661 transitions, 14429 flow. Second operand 9 states and 163 transitions. [2024-06-27 22:47:17,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 700 transitions, 16374 flow [2024-06-27 22:47:18,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 700 transitions, 15981 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:18,065 INFO L231 Difference]: Finished difference. Result has 282 places, 665 transitions, 14993 flow [2024-06-27 22:47:18,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14040, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14993, PETRI_PLACES=282, PETRI_TRANSITIONS=665} [2024-06-27 22:47:18,066 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 243 predicate places. [2024-06-27 22:47:18,066 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 665 transitions, 14993 flow [2024-06-27 22:47:18,067 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:47:18,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:18,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:18,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:47:18,067 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:47:18,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash -533908466, now seen corresponding path program 8 times [2024-06-27 22:47:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:18,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596239683] [2024-06-27 22:47:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:19,451 INFO 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:47:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596239683] [2024-06-27 22:47:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596239683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494971241] [2024-06-27 22:47:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:19,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:19,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:19,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:19,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 665 transitions, 14993 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:47:19,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:19,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:19,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:20,709 INFO L124 PetriNetUnfolderBase]: 2201/3767 cut-off events. [2024-06-27 22:47:20,709 INFO L125 PetriNetUnfolderBase]: For 116895/116912 co-relation queries the response was YES. [2024-06-27 22:47:20,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34961 conditions, 3767 events. 2201/3767 cut-off events. For 116895/116912 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 24171 event pairs, 333 based on Foata normal form. 9/3694 useless extension candidates. Maximal degree in co-relation 34821. Up to 3106 conditions per place. [2024-06-27 22:47:20,760 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 543 selfloop transitions, 138 changer transitions 0/696 dead transitions. [2024-06-27 22:47:20,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 696 transitions, 16587 flow [2024-06-27 22:47:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-27 22:47:20,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-27 22:47:20,762 INFO L175 Difference]: Start difference. First operand has 282 places, 665 transitions, 14993 flow. Second operand 9 states and 156 transitions. [2024-06-27 22:47:20,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 696 transitions, 16587 flow [2024-06-27 22:47:21,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 696 transitions, 15989 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:21,456 INFO L231 Difference]: Finished difference. Result has 286 places, 667 transitions, 14742 flow [2024-06-27 22:47:21,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14397, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14742, PETRI_PLACES=286, PETRI_TRANSITIONS=667} [2024-06-27 22:47:21,456 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 247 predicate places. [2024-06-27 22:47:21,456 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 667 transitions, 14742 flow [2024-06-27 22:47:21,457 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:47:21,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:21,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:21,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:47:21,457 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:47:21,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 277431910, now seen corresponding path program 2 times [2024-06-27 22:47:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117595525] [2024-06-27 22:47:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:22,684 INFO 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:47:22,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:22,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117595525] [2024-06-27 22:47:22,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117595525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:22,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:22,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872522239] [2024-06-27 22:47:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:22,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:22,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:22,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 667 transitions, 14742 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:22,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:22,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:22,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:24,122 INFO L124 PetriNetUnfolderBase]: 2294/3884 cut-off events. [2024-06-27 22:47:24,122 INFO L125 PetriNetUnfolderBase]: For 116677/116677 co-relation queries the response was YES. [2024-06-27 22:47:24,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35808 conditions, 3884 events. 2294/3884 cut-off events. For 116677/116677 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 24611 event pairs, 438 based on Foata normal form. 1/3838 useless extension candidates. Maximal degree in co-relation 35667. Up to 3412 conditions per place. [2024-06-27 22:47:24,169 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 584 selfloop transitions, 147 changer transitions 0/737 dead transitions. [2024-06-27 22:47:24,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 737 transitions, 17467 flow [2024-06-27 22:47:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:47:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:47:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-27 22:47:24,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-06-27 22:47:24,170 INFO L175 Difference]: Start difference. First operand has 286 places, 667 transitions, 14742 flow. Second operand 11 states and 182 transitions. [2024-06-27 22:47:24,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 737 transitions, 17467 flow [2024-06-27 22:47:24,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 737 transitions, 17132 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-27 22:47:24,825 INFO L231 Difference]: Finished difference. Result has 293 places, 705 transitions, 15866 flow [2024-06-27 22:47:24,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14409, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15866, PETRI_PLACES=293, PETRI_TRANSITIONS=705} [2024-06-27 22:47:24,826 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 254 predicate places. [2024-06-27 22:47:24,826 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 705 transitions, 15866 flow [2024-06-27 22:47:24,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:24,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:24,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:24,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:47:24,826 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:47:24,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash -359790822, now seen corresponding path program 5 times [2024-06-27 22:47:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430435098] [2024-06-27 22:47:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:26,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:47:26,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:26,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430435098] [2024-06-27 22:47:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430435098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:26,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:26,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:26,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971025038] [2024-06-27 22:47:26,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:26,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:26,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:26,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:26,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:26,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:26,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 705 transitions, 15866 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:47:26,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:26,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:26,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:27,211 INFO L124 PetriNetUnfolderBase]: 2228/3802 cut-off events. [2024-06-27 22:47:27,211 INFO L125 PetriNetUnfolderBase]: For 115866/115883 co-relation queries the response was YES. [2024-06-27 22:47:27,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35258 conditions, 3802 events. 2228/3802 cut-off events. For 115866/115883 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 24334 event pairs, 396 based on Foata normal form. 9/3726 useless extension candidates. Maximal degree in co-relation 35113. Up to 3223 conditions per place. [2024-06-27 22:47:27,264 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 566 selfloop transitions, 148 changer transitions 0/729 dead transitions. [2024-06-27 22:47:27,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 729 transitions, 17578 flow [2024-06-27 22:47:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 22:47:27,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2024-06-27 22:47:27,265 INFO L175 Difference]: Start difference. First operand has 293 places, 705 transitions, 15866 flow. Second operand 7 states and 129 transitions. [2024-06-27 22:47:27,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 729 transitions, 17578 flow [2024-06-27 22:47:27,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 729 transitions, 17290 flow, removed 120 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:27,956 INFO L231 Difference]: Finished difference. Result has 295 places, 707 transitions, 15998 flow [2024-06-27 22:47:27,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=15640, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15998, PETRI_PLACES=295, PETRI_TRANSITIONS=707} [2024-06-27 22:47:27,957 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 256 predicate places. [2024-06-27 22:47:27,957 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 707 transitions, 15998 flow [2024-06-27 22:47:27,958 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:47:27,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:27,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:27,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:47:27,958 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:47:27,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -359975520, now seen corresponding path program 9 times [2024-06-27 22:47:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749919983] [2024-06-27 22:47:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:29,385 INFO 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:47:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:29,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749919983] [2024-06-27 22:47:29,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749919983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:29,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961982216] [2024-06-27 22:47:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:29,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:29,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:29,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:29,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:47:29,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 707 transitions, 15998 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:47:29,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:29,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:47:29,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:30,769 INFO L124 PetriNetUnfolderBase]: 2259/3855 cut-off events. [2024-06-27 22:47:30,770 INFO L125 PetriNetUnfolderBase]: For 113363/113380 co-relation queries the response was YES. [2024-06-27 22:47:30,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35664 conditions, 3855 events. 2259/3855 cut-off events. For 113363/113380 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 24719 event pairs, 371 based on Foata normal form. 9/3782 useless extension candidates. Maximal degree in co-relation 35520. Up to 3320 conditions per place. [2024-06-27 22:47:30,814 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 640 selfloop transitions, 101 changer transitions 0/756 dead transitions. [2024-06-27 22:47:30,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 756 transitions, 18109 flow [2024-06-27 22:47:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 22:47:30,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-27 22:47:30,815 INFO L175 Difference]: Start difference. First operand has 295 places, 707 transitions, 15998 flow. Second operand 9 states and 152 transitions. [2024-06-27 22:47:30,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 756 transitions, 18109 flow [2024-06-27 22:47:31,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 756 transitions, 17855 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:31,474 INFO L231 Difference]: Finished difference. Result has 302 places, 730 transitions, 16547 flow [2024-06-27 22:47:31,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=15762, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16547, PETRI_PLACES=302, PETRI_TRANSITIONS=730} [2024-06-27 22:47:31,475 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 263 predicate places. [2024-06-27 22:47:31,475 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 730 transitions, 16547 flow [2024-06-27 22:47:31,475 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:47:31,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:31,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:31,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:47:31,475 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:47:31,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -359970560, now seen corresponding path program 3 times [2024-06-27 22:47:31,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:31,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866922467] [2024-06-27 22:47:31,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:31,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:32,733 INFO 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:47:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866922467] [2024-06-27 22:47:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866922467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:32,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:32,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214987460] [2024-06-27 22:47:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:32,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:32,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:32,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 730 transitions, 16547 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:32,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:32,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:32,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:34,105 INFO L124 PetriNetUnfolderBase]: 2322/3938 cut-off events. [2024-06-27 22:47:34,105 INFO L125 PetriNetUnfolderBase]: For 113286/113286 co-relation queries the response was YES. [2024-06-27 22:47:34,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36316 conditions, 3938 events. 2322/3938 cut-off events. For 113286/113286 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 25052 event pairs, 445 based on Foata normal form. 1/3890 useless extension candidates. Maximal degree in co-relation 36168. Up to 3461 conditions per place. [2024-06-27 22:47:34,160 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 605 selfloop transitions, 145 changer transitions 0/756 dead transitions. [2024-06-27 22:47:34,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 756 transitions, 18223 flow [2024-06-27 22:47:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:47:34,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-06-27 22:47:34,161 INFO L175 Difference]: Start difference. First operand has 302 places, 730 transitions, 16547 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:47:34,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 756 transitions, 18223 flow [2024-06-27 22:47:34,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 756 transitions, 17993 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:34,858 INFO L231 Difference]: Finished difference. Result has 306 places, 730 transitions, 16626 flow [2024-06-27 22:47:34,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=16317, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16626, PETRI_PLACES=306, PETRI_TRANSITIONS=730} [2024-06-27 22:47:34,859 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 267 predicate places. [2024-06-27 22:47:34,859 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 730 transitions, 16626 flow [2024-06-27 22:47:34,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:34,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:34,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:34,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:47:34,859 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:47:34,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1892601141, now seen corresponding path program 1 times [2024-06-27 22:47:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:34,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93754894] [2024-06-27 22:47:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:34,930 INFO 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:47:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93754894] [2024-06-27 22:47:34,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93754894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:34,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:34,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:47:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115155337] [2024-06-27 22:47:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:34,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:47:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:34,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:47:34,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:47:34,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:47:34,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 730 transitions, 16626 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:34,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:34,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:47:34,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:35,732 INFO L124 PetriNetUnfolderBase]: 1467/2710 cut-off events. [2024-06-27 22:47:35,733 INFO L125 PetriNetUnfolderBase]: For 73855/73970 co-relation queries the response was YES. [2024-06-27 22:47:35,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22653 conditions, 2710 events. 1467/2710 cut-off events. For 73855/73970 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17637 event pairs, 149 based on Foata normal form. 305/2796 useless extension candidates. Maximal degree in co-relation 22505. Up to 880 conditions per place. [2024-06-27 22:47:35,760 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 176 selfloop transitions, 126 changer transitions 0/417 dead transitions. [2024-06-27 22:47:35,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 417 transitions, 10169 flow [2024-06-27 22:47:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:47:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:47:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 22:47:35,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-06-27 22:47:35,761 INFO L175 Difference]: Start difference. First operand has 306 places, 730 transitions, 16626 flow. Second operand 4 states and 93 transitions. [2024-06-27 22:47:35,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 417 transitions, 10169 flow [2024-06-27 22:47:36,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 417 transitions, 8445 flow, removed 89 selfloop flow, removed 59 redundant places. [2024-06-27 22:47:36,076 INFO L231 Difference]: Finished difference. Result has 252 places, 403 transitions, 8191 flow [2024-06-27 22:47:36,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=7681, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8191, PETRI_PLACES=252, PETRI_TRANSITIONS=403} [2024-06-27 22:47:36,077 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 213 predicate places. [2024-06-27 22:47:36,077 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 403 transitions, 8191 flow [2024-06-27 22:47:36,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:36,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:36,078 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:47:36,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:47:36,078 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:47:36,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2020617465, now seen corresponding path program 1 times [2024-06-27 22:47:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:36,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878732096] [2024-06-27 22:47:36,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:37,642 INFO 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:47:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878732096] [2024-06-27 22:47:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878732096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125361626] [2024-06-27 22:47:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:37,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:37,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:37,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:37,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 403 transitions, 8191 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:37,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:37,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:37,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:38,649 INFO L124 PetriNetUnfolderBase]: 1675/3090 cut-off events. [2024-06-27 22:47:38,649 INFO L125 PetriNetUnfolderBase]: For 85877/85880 co-relation queries the response was YES. [2024-06-27 22:47:38,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24453 conditions, 3090 events. 1675/3090 cut-off events. For 85877/85880 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 20455 event pairs, 402 based on Foata normal form. 9/2954 useless extension candidates. Maximal degree in co-relation 24331. Up to 1323 conditions per place. [2024-06-27 22:47:38,699 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 261 selfloop transitions, 187 changer transitions 0/455 dead transitions. [2024-06-27 22:47:38,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 455 transitions, 9857 flow [2024-06-27 22:47:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:47:38,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 22:47:38,701 INFO L175 Difference]: Start difference. First operand has 252 places, 403 transitions, 8191 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:47:38,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 455 transitions, 9857 flow [2024-06-27 22:47:39,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 455 transitions, 9673 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:39,111 INFO L231 Difference]: Finished difference. Result has 258 places, 405 transitions, 8449 flow [2024-06-27 22:47:39,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8009, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8449, PETRI_PLACES=258, PETRI_TRANSITIONS=405} [2024-06-27 22:47:39,111 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 219 predicate places. [2024-06-27 22:47:39,111 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 405 transitions, 8449 flow [2024-06-27 22:47:39,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:39,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:39,112 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:47:39,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:47:39,112 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:47:39,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2120997199, now seen corresponding path program 2 times [2024-06-27 22:47:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153033747] [2024-06-27 22:47:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:40,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:47:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153033747] [2024-06-27 22:47:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153033747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:47:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465225423] [2024-06-27 22:47:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:40,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:47:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:47:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:47:40,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:40,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 405 transitions, 8449 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:47:40,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:40,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:40,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:41,738 INFO L124 PetriNetUnfolderBase]: 1779/3294 cut-off events. [2024-06-27 22:47:41,738 INFO L125 PetriNetUnfolderBase]: For 92665/92668 co-relation queries the response was YES. [2024-06-27 22:47:41,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26126 conditions, 3294 events. 1779/3294 cut-off events. For 92665/92668 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 22209 event pairs, 562 based on Foata normal form. 11/3153 useless extension candidates. Maximal degree in co-relation 26002. Up to 2596 conditions per place. [2024-06-27 22:47:41,777 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 305 selfloop transitions, 129 changer transitions 0/441 dead transitions. [2024-06-27 22:47:41,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 441 transitions, 9716 flow [2024-06-27 22:47:41,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:47:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:47:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-27 22:47:41,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43116883116883115 [2024-06-27 22:47:41,778 INFO L175 Difference]: Start difference. First operand has 258 places, 405 transitions, 8449 flow. Second operand 11 states and 166 transitions. [2024-06-27 22:47:41,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 441 transitions, 9716 flow [2024-06-27 22:47:42,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 441 transitions, 9530 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:42,168 INFO L231 Difference]: Finished difference. Result has 263 places, 406 transitions, 8563 flow [2024-06-27 22:47:42,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8263, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8563, PETRI_PLACES=263, PETRI_TRANSITIONS=406} [2024-06-27 22:47:42,169 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 224 predicate places. [2024-06-27 22:47:42,169 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 406 transitions, 8563 flow [2024-06-27 22:47:42,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:47:42,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:42,169 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:47:42,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:47:42,169 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:47:42,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2121000919, now seen corresponding path program 3 times [2024-06-27 22:47:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504424837] [2024-06-27 22:47:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:43,741 INFO 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:47:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504424837] [2024-06-27 22:47:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504424837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:43,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:43,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:47:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248078466] [2024-06-27 22:47:43,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:43,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:47:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:43,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:47:43,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:47:43,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:43,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 406 transitions, 8563 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:47:43,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:43,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:43,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:44,932 INFO L124 PetriNetUnfolderBase]: 1852/3438 cut-off events. [2024-06-27 22:47:44,933 INFO L125 PetriNetUnfolderBase]: For 94918/94921 co-relation queries the response was YES. [2024-06-27 22:47:44,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27256 conditions, 3438 events. 1852/3438 cut-off events. For 94918/94921 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23520 event pairs, 533 based on Foata normal form. 9/3292 useless extension candidates. Maximal degree in co-relation 27130. Up to 2415 conditions per place. [2024-06-27 22:47:44,967 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 265 selfloop transitions, 180 changer transitions 0/452 dead transitions. [2024-06-27 22:47:44,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 452 transitions, 10071 flow [2024-06-27 22:47:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:47:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:47:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-27 22:47:44,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45194805194805193 [2024-06-27 22:47:44,969 INFO L175 Difference]: Start difference. First operand has 263 places, 406 transitions, 8563 flow. Second operand 11 states and 174 transitions. [2024-06-27 22:47:44,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 452 transitions, 10071 flow [2024-06-27 22:47:45,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 452 transitions, 9879 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 22:47:45,357 INFO L231 Difference]: Finished difference. Result has 267 places, 407 transitions, 8771 flow [2024-06-27 22:47:45,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8371, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8771, PETRI_PLACES=267, PETRI_TRANSITIONS=407} [2024-06-27 22:47:45,357 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 228 predicate places. [2024-06-27 22:47:45,357 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 407 transitions, 8771 flow [2024-06-27 22:47:45,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:47:45,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:45,358 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:47:45,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:47:45,358 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:47:45,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash 486826737, now seen corresponding path program 4 times [2024-06-27 22:47:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199959193] [2024-06-27 22:47:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:46,808 INFO 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:47:46,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:46,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199959193] [2024-06-27 22:47:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199959193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:46,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:46,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628152057] [2024-06-27 22:47:46,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:46,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:46,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:46,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 407 transitions, 8771 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:46,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:46,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:46,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:47,997 INFO L124 PetriNetUnfolderBase]: 1949/3630 cut-off events. [2024-06-27 22:47:47,997 INFO L125 PetriNetUnfolderBase]: For 103544/103547 co-relation queries the response was YES. [2024-06-27 22:47:48,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28606 conditions, 3630 events. 1949/3630 cut-off events. For 103544/103547 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 25218 event pairs, 687 based on Foata normal form. 11/3482 useless extension candidates. Maximal degree in co-relation 28479. Up to 2967 conditions per place. [2024-06-27 22:47:48,044 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 291 selfloop transitions, 141 changer transitions 0/439 dead transitions. [2024-06-27 22:47:48,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 439 transitions, 9999 flow [2024-06-27 22:47:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:47:48,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 22:47:48,046 INFO L175 Difference]: Start difference. First operand has 267 places, 407 transitions, 8771 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:47:48,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 439 transitions, 9999 flow [2024-06-27 22:47:48,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 439 transitions, 9624 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 22:47:48,552 INFO L231 Difference]: Finished difference. Result has 269 places, 408 transitions, 8723 flow [2024-06-27 22:47:48,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8396, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8723, PETRI_PLACES=269, PETRI_TRANSITIONS=408} [2024-06-27 22:47:48,552 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 230 predicate places. [2024-06-27 22:47:48,552 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 408 transitions, 8723 flow [2024-06-27 22:47:48,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:48,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:48,553 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:47:48,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:47:48,553 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:47:48,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash 486823017, now seen corresponding path program 5 times [2024-06-27 22:47:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:48,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935417868] [2024-06-27 22:47:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:49,986 INFO 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:47:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935417868] [2024-06-27 22:47:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935417868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:49,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070868643] [2024-06-27 22:47:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:50,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:50,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 408 transitions, 8723 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:50,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:50,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:50,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:51,212 INFO L124 PetriNetUnfolderBase]: 2132/3987 cut-off events. [2024-06-27 22:47:51,212 INFO L125 PetriNetUnfolderBase]: For 122621/122624 co-relation queries the response was YES. [2024-06-27 22:47:51,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31158 conditions, 3987 events. 2132/3987 cut-off events. For 122621/122624 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 28490 event pairs, 741 based on Foata normal form. 9/3828 useless extension candidates. Maximal degree in co-relation 31030. Up to 2910 conditions per place. [2024-06-27 22:47:51,264 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 297 selfloop transitions, 144 changer transitions 0/448 dead transitions. [2024-06-27 22:47:51,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 448 transitions, 10179 flow [2024-06-27 22:47:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:47:51,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2024-06-27 22:47:51,265 INFO L175 Difference]: Start difference. First operand has 269 places, 408 transitions, 8723 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:47:51,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 448 transitions, 10179 flow [2024-06-27 22:47:51,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 448 transitions, 9805 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 22:47:51,790 INFO L231 Difference]: Finished difference. Result has 271 places, 410 transitions, 8719 flow [2024-06-27 22:47:51,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8349, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8719, PETRI_PLACES=271, PETRI_TRANSITIONS=410} [2024-06-27 22:47:51,790 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 232 predicate places. [2024-06-27 22:47:51,790 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 410 transitions, 8719 flow [2024-06-27 22:47:51,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:51,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:51,791 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:47:51,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:47:51,791 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:47:51,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash 486970887, now seen corresponding path program 6 times [2024-06-27 22:47:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:51,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063425703] [2024-06-27 22:47:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:53,031 INFO 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:47:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063425703] [2024-06-27 22:47:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063425703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:53,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:53,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:53,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59436486] [2024-06-27 22:47:53,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:53,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:53,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:53,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:53,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:53,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 410 transitions, 8719 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:53,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:53,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:53,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:54,290 INFO L124 PetriNetUnfolderBase]: 2203/4133 cut-off events. [2024-06-27 22:47:54,290 INFO L125 PetriNetUnfolderBase]: For 126531/126534 co-relation queries the response was YES. [2024-06-27 22:47:54,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31783 conditions, 4133 events. 2203/4133 cut-off events. For 126531/126534 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 29977 event pairs, 814 based on Foata normal form. 11/3969 useless extension candidates. Maximal degree in co-relation 31654. Up to 3528 conditions per place. [2024-06-27 22:47:54,332 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 334 selfloop transitions, 98 changer transitions 0/439 dead transitions. [2024-06-27 22:47:54,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 439 transitions, 9907 flow [2024-06-27 22:47:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-06-27 22:47:54,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43714285714285717 [2024-06-27 22:47:54,334 INFO L175 Difference]: Start difference. First operand has 271 places, 410 transitions, 8719 flow. Second operand 10 states and 153 transitions. [2024-06-27 22:47:54,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 439 transitions, 9907 flow [2024-06-27 22:47:54,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 439 transitions, 9697 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:54,864 INFO L231 Difference]: Finished difference. Result has 275 places, 411 transitions, 8758 flow [2024-06-27 22:47:54,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8509, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8758, PETRI_PLACES=275, PETRI_TRANSITIONS=411} [2024-06-27 22:47:54,865 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 236 predicate places. [2024-06-27 22:47:54,865 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 411 transitions, 8758 flow [2024-06-27 22:47:54,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:54,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:54,865 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:47:54,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:47:54,866 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:47:54,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash 486976839, now seen corresponding path program 1 times [2024-06-27 22:47:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585337079] [2024-06-27 22:47:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585337079] [2024-06-27 22:47:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585337079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:56,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816236114] [2024-06-27 22:47:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:56,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:56,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:56,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 411 transitions, 8758 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:56,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:56,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:56,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:57,551 INFO L124 PetriNetUnfolderBase]: 2226/4173 cut-off events. [2024-06-27 22:47:57,552 INFO L125 PetriNetUnfolderBase]: For 115892/115895 co-relation queries the response was YES. [2024-06-27 22:47:57,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32233 conditions, 4173 events. 2226/4173 cut-off events. For 115892/115895 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 30374 event pairs, 818 based on Foata normal form. 3/3996 useless extension candidates. Maximal degree in co-relation 32102. Up to 3706 conditions per place. [2024-06-27 22:47:57,602 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 294 selfloop transitions, 132 changer transitions 0/433 dead transitions. [2024-06-27 22:47:57,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 433 transitions, 9834 flow [2024-06-27 22:47:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-27 22:47:57,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-27 22:47:57,603 INFO L175 Difference]: Start difference. First operand has 275 places, 411 transitions, 8758 flow. Second operand 10 states and 147 transitions. [2024-06-27 22:47:57,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 433 transitions, 9834 flow [2024-06-27 22:47:58,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 433 transitions, 9457 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-27 22:47:58,222 INFO L231 Difference]: Finished difference. Result has 275 places, 414 transitions, 8730 flow [2024-06-27 22:47:58,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8381, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8730, PETRI_PLACES=275, PETRI_TRANSITIONS=414} [2024-06-27 22:47:58,223 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 236 predicate places. [2024-06-27 22:47:58,223 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 414 transitions, 8730 flow [2024-06-27 22:47:58,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:58,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:58,223 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:47:58,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:47:58,223 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:47:58,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash -228399997, now seen corresponding path program 2 times [2024-06-27 22:47:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:58,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522266513] [2024-06-27 22:47:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:59,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:59,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522266513] [2024-06-27 22:47:59,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522266513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:59,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:59,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:59,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291233816] [2024-06-27 22:47:59,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:59,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:59,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:59,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:59,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:59,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:47:59,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 414 transitions, 8730 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:59,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:59,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:47:59,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:00,855 INFO L124 PetriNetUnfolderBase]: 2249/4216 cut-off events. [2024-06-27 22:48:00,855 INFO L125 PetriNetUnfolderBase]: For 116963/116966 co-relation queries the response was YES. [2024-06-27 22:48:00,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32466 conditions, 4216 events. 2249/4216 cut-off events. For 116963/116966 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 30796 event pairs, 838 based on Foata normal form. 3/4037 useless extension candidates. Maximal degree in co-relation 32336. Up to 3836 conditions per place. [2024-06-27 22:48:00,906 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 350 selfloop transitions, 85 changer transitions 0/442 dead transitions. [2024-06-27 22:48:00,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 442 transitions, 9899 flow [2024-06-27 22:48:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:48:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:48:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 169 transitions. [2024-06-27 22:48:00,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4023809523809524 [2024-06-27 22:48:00,907 INFO L175 Difference]: Start difference. First operand has 275 places, 414 transitions, 8730 flow. Second operand 12 states and 169 transitions. [2024-06-27 22:48:00,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 442 transitions, 9899 flow [2024-06-27 22:48:01,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 442 transitions, 9572 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-27 22:48:01,522 INFO L231 Difference]: Finished difference. Result has 278 places, 417 transitions, 8666 flow [2024-06-27 22:48:01,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8403, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8666, PETRI_PLACES=278, PETRI_TRANSITIONS=417} [2024-06-27 22:48:01,523 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 239 predicate places. [2024-06-27 22:48:01,523 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 417 transitions, 8666 flow [2024-06-27 22:48:01,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:01,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:01,524 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:48:01,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:48:01,524 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:48:01,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -228392557, now seen corresponding path program 3 times [2024-06-27 22:48:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528799624] [2024-06-27 22:48:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:02,872 INFO 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:48:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528799624] [2024-06-27 22:48:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528799624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:02,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:02,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126536918] [2024-06-27 22:48:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:02,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:02,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:02,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:02,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:02,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 417 transitions, 8666 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:02,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:02,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:02,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:04,272 INFO L124 PetriNetUnfolderBase]: 2297/4305 cut-off events. [2024-06-27 22:48:04,272 INFO L125 PetriNetUnfolderBase]: For 125084/125087 co-relation queries the response was YES. [2024-06-27 22:48:04,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33229 conditions, 4305 events. 2297/4305 cut-off events. For 125084/125087 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 31634 event pairs, 844 based on Foata normal form. 3/4121 useless extension candidates. Maximal degree in co-relation 33098. Up to 3832 conditions per place. [2024-06-27 22:48:04,322 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 351 selfloop transitions, 93 changer transitions 0/451 dead transitions. [2024-06-27 22:48:04,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 451 transitions, 10078 flow [2024-06-27 22:48:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:48:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:48:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 173 transitions. [2024-06-27 22:48:04,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2024-06-27 22:48:04,324 INFO L175 Difference]: Start difference. First operand has 278 places, 417 transitions, 8666 flow. Second operand 12 states and 173 transitions. [2024-06-27 22:48:04,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 451 transitions, 10078 flow [2024-06-27 22:48:04,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 451 transitions, 9856 flow, removed 24 selfloop flow, removed 11 redundant places. [2024-06-27 22:48:04,976 INFO L231 Difference]: Finished difference. Result has 279 places, 423 transitions, 8810 flow [2024-06-27 22:48:04,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8444, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8810, PETRI_PLACES=279, PETRI_TRANSITIONS=423} [2024-06-27 22:48:04,977 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 240 predicate places. [2024-06-27 22:48:04,977 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 423 transitions, 8810 flow [2024-06-27 22:48:04,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:04,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:04,978 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:48:04,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:48:04,978 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:48:04,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -233964187, now seen corresponding path program 4 times [2024-06-27 22:48:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:04,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785185062] [2024-06-27 22:48:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:06,347 INFO 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:48:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:06,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785185062] [2024-06-27 22:48:06,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785185062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:06,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455285944] [2024-06-27 22:48:06,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:06,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:06,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:06,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:06,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 423 transitions, 8810 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:06,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:06,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:06,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:07,712 INFO L124 PetriNetUnfolderBase]: 2294/4301 cut-off events. [2024-06-27 22:48:07,713 INFO L125 PetriNetUnfolderBase]: For 123690/123693 co-relation queries the response was YES. [2024-06-27 22:48:07,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33108 conditions, 4301 events. 2294/4301 cut-off events. For 123690/123693 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 31554 event pairs, 857 based on Foata normal form. 3/4119 useless extension candidates. Maximal degree in co-relation 32976. Up to 3917 conditions per place. [2024-06-27 22:48:07,765 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 357 selfloop transitions, 82 changer transitions 0/446 dead transitions. [2024-06-27 22:48:07,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 446 transitions, 9905 flow [2024-06-27 22:48:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-27 22:48:07,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-27 22:48:07,766 INFO L175 Difference]: Start difference. First operand has 279 places, 423 transitions, 8810 flow. Second operand 10 states and 147 transitions. [2024-06-27 22:48:07,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 446 transitions, 9905 flow [2024-06-27 22:48:08,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 446 transitions, 9698 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-27 22:48:08,524 INFO L231 Difference]: Finished difference. Result has 281 places, 423 transitions, 8775 flow [2024-06-27 22:48:08,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8603, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8775, PETRI_PLACES=281, PETRI_TRANSITIONS=423} [2024-06-27 22:48:08,525 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 242 predicate places. [2024-06-27 22:48:08,526 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 423 transitions, 8775 flow [2024-06-27 22:48:08,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:08,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:08,526 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:48:08,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:48:08,526 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:48:08,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash -234118009, now seen corresponding path program 7 times [2024-06-27 22:48:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635956454] [2024-06-27 22:48:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:09,942 INFO 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:48:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635956454] [2024-06-27 22:48:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635956454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649802001] [2024-06-27 22:48:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:09,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:10,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:10,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 423 transitions, 8775 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:10,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:10,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:10,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:11,545 INFO L124 PetriNetUnfolderBase]: 2477/4662 cut-off events. [2024-06-27 22:48:11,546 INFO L125 PetriNetUnfolderBase]: For 159285/159288 co-relation queries the response was YES. [2024-06-27 22:48:11,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35854 conditions, 4662 events. 2477/4662 cut-off events. For 159285/159288 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 34991 event pairs, 885 based on Foata normal form. 9/4485 useless extension candidates. Maximal degree in co-relation 35720. Up to 3641 conditions per place. [2024-06-27 22:48:11,597 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 362 selfloop transitions, 94 changer transitions 0/463 dead transitions. [2024-06-27 22:48:11,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 463 transitions, 10287 flow [2024-06-27 22:48:11,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-27 22:48:11,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-06-27 22:48:11,598 INFO L175 Difference]: Start difference. First operand has 281 places, 423 transitions, 8775 flow. Second operand 10 states and 162 transitions. [2024-06-27 22:48:11,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 463 transitions, 10287 flow [2024-06-27 22:48:12,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 463 transitions, 10116 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:48:12,236 INFO L231 Difference]: Finished difference. Result has 283 places, 425 transitions, 8878 flow [2024-06-27 22:48:12,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8604, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8878, PETRI_PLACES=283, PETRI_TRANSITIONS=425} [2024-06-27 22:48:12,237 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 244 predicate places. [2024-06-27 22:48:12,237 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 425 transitions, 8878 flow [2024-06-27 22:48:12,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:12,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:12,238 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:48:12,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:48:12,238 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:48:12,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1539720881, now seen corresponding path program 8 times [2024-06-27 22:48:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:12,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210596185] [2024-06-27 22:48:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:13,755 INFO 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:48:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210596185] [2024-06-27 22:48:13,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210596185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:13,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65827839] [2024-06-27 22:48:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:13,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:13,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:13,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:13,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 425 transitions, 8878 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:13,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:13,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:13,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:15,227 INFO L124 PetriNetUnfolderBase]: 2548/4807 cut-off events. [2024-06-27 22:48:15,227 INFO L125 PetriNetUnfolderBase]: For 166371/166374 co-relation queries the response was YES. [2024-06-27 22:48:15,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36654 conditions, 4807 events. 2548/4807 cut-off events. For 166371/166374 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36424 event pairs, 1002 based on Foata normal form. 11/4627 useless extension candidates. Maximal degree in co-relation 36519. Up to 4242 conditions per place. [2024-06-27 22:48:15,289 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 388 selfloop transitions, 63 changer transitions 0/458 dead transitions. [2024-06-27 22:48:15,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 458 transitions, 10174 flow [2024-06-27 22:48:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2024-06-27 22:48:15,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-27 22:48:15,291 INFO L175 Difference]: Start difference. First operand has 283 places, 425 transitions, 8878 flow. Second operand 10 states and 154 transitions. [2024-06-27 22:48:15,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 458 transitions, 10174 flow [2024-06-27 22:48:16,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 458 transitions, 10016 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 22:48:16,077 INFO L231 Difference]: Finished difference. Result has 287 places, 426 transitions, 8897 flow [2024-06-27 22:48:16,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8722, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8897, PETRI_PLACES=287, PETRI_TRANSITIONS=426} [2024-06-27 22:48:16,077 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 248 predicate places. [2024-06-27 22:48:16,078 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 426 transitions, 8897 flow [2024-06-27 22:48:16,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:16,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:16,078 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:48:16,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:48:16,078 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:48:16,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1715530864, now seen corresponding path program 1 times [2024-06-27 22:48:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149825135] [2024-06-27 22:48:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:17,436 INFO 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:48:17,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:17,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149825135] [2024-06-27 22:48:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149825135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251725196] [2024-06-27 22:48:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:17,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:17,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:17,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:17,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 426 transitions, 8897 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:17,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:17,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:17,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:18,731 INFO L124 PetriNetUnfolderBase]: 2546/4801 cut-off events. [2024-06-27 22:48:18,731 INFO L125 PetriNetUnfolderBase]: For 147984/147987 co-relation queries the response was YES. [2024-06-27 22:48:18,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36580 conditions, 4801 events. 2546/4801 cut-off events. For 147984/147987 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36377 event pairs, 998 based on Foata normal form. 2/4605 useless extension candidates. Maximal degree in co-relation 36443. Up to 4367 conditions per place. [2024-06-27 22:48:18,789 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 346 selfloop transitions, 90 changer transitions 0/443 dead transitions. [2024-06-27 22:48:18,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 443 transitions, 9927 flow [2024-06-27 22:48:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:48:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:48:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-27 22:48:18,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-27 22:48:18,790 INFO L175 Difference]: Start difference. First operand has 287 places, 426 transitions, 8897 flow. Second operand 8 states and 123 transitions. [2024-06-27 22:48:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 443 transitions, 9927 flow [2024-06-27 22:48:19,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 443 transitions, 9803 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 22:48:19,811 INFO L231 Difference]: Finished difference. Result has 288 places, 426 transitions, 8996 flow [2024-06-27 22:48:19,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8773, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8996, PETRI_PLACES=288, PETRI_TRANSITIONS=426} [2024-06-27 22:48:19,811 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-27 22:48:19,812 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 426 transitions, 8996 flow [2024-06-27 22:48:19,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:19,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:19,812 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:48:19,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:48:19,812 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:48:19,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2081786789, now seen corresponding path program 5 times [2024-06-27 22:48:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:19,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183757567] [2024-06-27 22:48:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:21,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183757567] [2024-06-27 22:48:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183757567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:21,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:21,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632068163] [2024-06-27 22:48:21,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:21,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:21,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:21,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:21,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:21,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:21,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 426 transitions, 8996 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:21,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:21,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:21,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:22,670 INFO L124 PetriNetUnfolderBase]: 2568/4836 cut-off events. [2024-06-27 22:48:22,670 INFO L125 PetriNetUnfolderBase]: For 152510/152513 co-relation queries the response was YES. [2024-06-27 22:48:22,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36978 conditions, 4836 events. 2568/4836 cut-off events. For 152510/152513 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 36596 event pairs, 987 based on Foata normal form. 3/4641 useless extension candidates. Maximal degree in co-relation 36840. Up to 4504 conditions per place. [2024-06-27 22:48:22,724 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 426 selfloop transitions, 17 changer transitions 0/450 dead transitions. [2024-06-27 22:48:22,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 450 transitions, 10130 flow [2024-06-27 22:48:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2024-06-27 22:48:22,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2024-06-27 22:48:22,725 INFO L175 Difference]: Start difference. First operand has 288 places, 426 transitions, 8996 flow. Second operand 9 states and 130 transitions. [2024-06-27 22:48:22,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 450 transitions, 10130 flow [2024-06-27 22:48:23,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 450 transitions, 9772 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-27 22:48:23,609 INFO L231 Difference]: Finished difference. Result has 288 places, 429 transitions, 8774 flow [2024-06-27 22:48:23,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8638, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8774, PETRI_PLACES=288, PETRI_TRANSITIONS=429} [2024-06-27 22:48:23,609 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-27 22:48:23,610 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 429 transitions, 8774 flow [2024-06-27 22:48:23,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:23,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:23,610 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:48:23,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:48:23,610 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:48:23,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2091877289, now seen corresponding path program 6 times [2024-06-27 22:48:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:23,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487830539] [2024-06-27 22:48:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:24,950 INFO 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:48:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:24,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487830539] [2024-06-27 22:48:24,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487830539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:24,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:24,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:24,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784700290] [2024-06-27 22:48:24,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:24,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:24,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:24,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:25,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:25,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 429 transitions, 8774 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:25,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:25,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:25,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:26,545 INFO L124 PetriNetUnfolderBase]: 2616/4924 cut-off events. [2024-06-27 22:48:26,545 INFO L125 PetriNetUnfolderBase]: For 159032/159035 co-relation queries the response was YES. [2024-06-27 22:48:26,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37710 conditions, 4924 events. 2616/4924 cut-off events. For 159032/159035 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 37436 event pairs, 1020 based on Foata normal form. 3/4729 useless extension candidates. Maximal degree in co-relation 37572. Up to 4519 conditions per place. [2024-06-27 22:48:26,605 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 419 selfloop transitions, 39 changer transitions 0/465 dead transitions. [2024-06-27 22:48:26,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 465 transitions, 10274 flow [2024-06-27 22:48:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-27 22:48:26,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 22:48:26,607 INFO L175 Difference]: Start difference. First operand has 288 places, 429 transitions, 8774 flow. Second operand 9 states and 135 transitions. [2024-06-27 22:48:26,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 465 transitions, 10274 flow [2024-06-27 22:48:27,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 465 transitions, 10180 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-27 22:48:27,503 INFO L231 Difference]: Finished difference. Result has 289 places, 435 transitions, 8962 flow [2024-06-27 22:48:27,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8680, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8962, PETRI_PLACES=289, PETRI_TRANSITIONS=435} [2024-06-27 22:48:27,503 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 250 predicate places. [2024-06-27 22:48:27,503 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 435 transitions, 8962 flow [2024-06-27 22:48:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:27,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:27,504 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:48:27,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:48:27,504 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:48:27,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1915250455, now seen corresponding path program 7 times [2024-06-27 22:48:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:27,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674248105] [2024-06-27 22:48:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:27,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:28,865 INFO 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:48:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674248105] [2024-06-27 22:48:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674248105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:28,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773744861] [2024-06-27 22:48:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:28,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:28,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:28,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:28,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:28,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 435 transitions, 8962 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:28,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:28,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:28,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:30,277 INFO L124 PetriNetUnfolderBase]: 2639/4972 cut-off events. [2024-06-27 22:48:30,277 INFO L125 PetriNetUnfolderBase]: For 163434/163437 co-relation queries the response was YES. [2024-06-27 22:48:30,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38174 conditions, 4972 events. 2639/4972 cut-off events. For 163434/163437 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 37916 event pairs, 1037 based on Foata normal form. 3/4777 useless extension candidates. Maximal degree in co-relation 38035. Up to 4563 conditions per place. [2024-06-27 22:48:30,339 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 373 selfloop transitions, 81 changer transitions 0/461 dead transitions. [2024-06-27 22:48:30,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 461 transitions, 10189 flow [2024-06-27 22:48:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:48:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:48:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-27 22:48:30,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-27 22:48:30,341 INFO L175 Difference]: Start difference. First operand has 289 places, 435 transitions, 8962 flow. Second operand 8 states and 127 transitions. [2024-06-27 22:48:30,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 461 transitions, 10189 flow [2024-06-27 22:48:31,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 461 transitions, 10044 flow, removed 46 selfloop flow, removed 8 redundant places. [2024-06-27 22:48:31,244 INFO L231 Difference]: Finished difference. Result has 289 places, 438 transitions, 9094 flow [2024-06-27 22:48:31,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8817, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9094, PETRI_PLACES=289, PETRI_TRANSITIONS=438} [2024-06-27 22:48:31,244 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 250 predicate places. [2024-06-27 22:48:31,245 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 438 transitions, 9094 flow [2024-06-27 22:48:31,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:31,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:31,245 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:48:31,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:48:31,245 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:48:31,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2091884729, now seen corresponding path program 8 times [2024-06-27 22:48:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:31,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363816567] [2024-06-27 22:48:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:32,492 INFO 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:48:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363816567] [2024-06-27 22:48:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363816567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307732145] [2024-06-27 22:48:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:32,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:32,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:32,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 438 transitions, 9094 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:32,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:32,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:32,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:33,968 INFO L124 PetriNetUnfolderBase]: 2636/4963 cut-off events. [2024-06-27 22:48:33,969 INFO L125 PetriNetUnfolderBase]: For 160760/160763 co-relation queries the response was YES. [2024-06-27 22:48:34,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38021 conditions, 4963 events. 2636/4963 cut-off events. For 160760/160763 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 37873 event pairs, 1024 based on Foata normal form. 3/4765 useless extension candidates. Maximal degree in co-relation 37882. Up to 4618 conditions per place. [2024-06-27 22:48:34,030 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 412 selfloop transitions, 40 changer transitions 0/459 dead transitions. [2024-06-27 22:48:34,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 459 transitions, 10180 flow [2024-06-27 22:48:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-27 22:48:34,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4031746031746032 [2024-06-27 22:48:34,031 INFO L175 Difference]: Start difference. First operand has 289 places, 438 transitions, 9094 flow. Second operand 9 states and 127 transitions. [2024-06-27 22:48:34,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 459 transitions, 10180 flow [2024-06-27 22:48:34,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 459 transitions, 9921 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-06-27 22:48:34,989 INFO L231 Difference]: Finished difference. Result has 293 places, 438 transitions, 8926 flow [2024-06-27 22:48:34,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8835, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8926, PETRI_PLACES=293, PETRI_TRANSITIONS=438} [2024-06-27 22:48:34,990 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 254 predicate places. [2024-06-27 22:48:34,990 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 438 transitions, 8926 flow [2024-06-27 22:48:34,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:34,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:34,990 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:48:34,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 22:48:34,990 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:48:34,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1715684469, now seen corresponding path program 9 times [2024-06-27 22:48:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797186536] [2024-06-27 22:48:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:36,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:48:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797186536] [2024-06-27 22:48:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797186536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:36,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:36,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:48:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639316412] [2024-06-27 22:48:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:36,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:48:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:48:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:48:36,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:36,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 438 transitions, 8926 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:48:36,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:36,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:36,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:37,961 INFO L124 PetriNetUnfolderBase]: 2793/5276 cut-off events. [2024-06-27 22:48:37,962 INFO L125 PetriNetUnfolderBase]: For 197204/197207 co-relation queries the response was YES. [2024-06-27 22:48:38,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40068 conditions, 5276 events. 2793/5276 cut-off events. For 197204/197207 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 40932 event pairs, 1045 based on Foata normal form. 9/5083 useless extension candidates. Maximal degree in co-relation 39928. Up to 4255 conditions per place. [2024-06-27 22:48:38,030 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 399 selfloop transitions, 74 changer transitions 0/480 dead transitions. [2024-06-27 22:48:38,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 480 transitions, 10498 flow [2024-06-27 22:48:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-27 22:48:38,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-06-27 22:48:38,031 INFO L175 Difference]: Start difference. First operand has 293 places, 438 transitions, 8926 flow. Second operand 10 states and 162 transitions. [2024-06-27 22:48:38,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 480 transitions, 10498 flow [2024-06-27 22:48:39,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 480 transitions, 10431 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 22:48:39,098 INFO L231 Difference]: Finished difference. Result has 296 places, 440 transitions, 9097 flow [2024-06-27 22:48:39,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8859, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9097, PETRI_PLACES=296, PETRI_TRANSITIONS=440} [2024-06-27 22:48:39,099 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 257 predicate places. [2024-06-27 22:48:39,099 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 440 transitions, 9097 flow [2024-06-27 22:48:39,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:48:39,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:39,100 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:48:39,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 22:48:39,100 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:48:39,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1715680749, now seen corresponding path program 10 times [2024-06-27 22:48:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405502871] [2024-06-27 22:48:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:40,565 INFO 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:48:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405502871] [2024-06-27 22:48:40,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405502871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:40,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:40,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:48:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641710080] [2024-06-27 22:48:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:40,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:48:40,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:48:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:48:40,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:40,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 440 transitions, 9097 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:48:40,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:40,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:40,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:42,110 INFO L124 PetriNetUnfolderBase]: 2780/5252 cut-off events. [2024-06-27 22:48:42,110 INFO L125 PetriNetUnfolderBase]: For 183493/183496 co-relation queries the response was YES. [2024-06-27 22:48:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39508 conditions, 5252 events. 2780/5252 cut-off events. For 183493/183496 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 40648 event pairs, 1132 based on Foata normal form. 11/5062 useless extension candidates. Maximal degree in co-relation 39367. Up to 4657 conditions per place. [2024-06-27 22:48:42,184 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 397 selfloop transitions, 68 changer transitions 0/472 dead transitions. [2024-06-27 22:48:42,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 472 transitions, 10371 flow [2024-06-27 22:48:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2024-06-27 22:48:42,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-27 22:48:42,185 INFO L175 Difference]: Start difference. First operand has 296 places, 440 transitions, 9097 flow. Second operand 10 states and 154 transitions. [2024-06-27 22:48:42,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 472 transitions, 10371 flow [2024-06-27 22:48:43,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 472 transitions, 10221 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 22:48:43,233 INFO L231 Difference]: Finished difference. Result has 300 places, 440 transitions, 9090 flow [2024-06-27 22:48:43,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8947, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9090, PETRI_PLACES=300, PETRI_TRANSITIONS=440} [2024-06-27 22:48:43,234 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 261 predicate places. [2024-06-27 22:48:43,234 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 440 transitions, 9090 flow [2024-06-27 22:48:43,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 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:48:43,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:43,234 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:48:43,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 22:48:43,235 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:48:43,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1709959017, now seen corresponding path program 9 times [2024-06-27 22:48:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617144983] [2024-06-27 22:48:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617144983] [2024-06-27 22:48:44,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617144983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:44,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:44,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120206881] [2024-06-27 22:48:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:44,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:44,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:44,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 440 transitions, 9090 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:44,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:44,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:44,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:46,187 INFO L124 PetriNetUnfolderBase]: 2831/5347 cut-off events. [2024-06-27 22:48:46,187 INFO L125 PetriNetUnfolderBase]: For 175008/175011 co-relation queries the response was YES. [2024-06-27 22:48:46,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40559 conditions, 5347 events. 2831/5347 cut-off events. For 175008/175011 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 41493 event pairs, 1134 based on Foata normal form. 3/5146 useless extension candidates. Maximal degree in co-relation 40416. Up to 4841 conditions per place. [2024-06-27 22:48:46,260 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 397 selfloop transitions, 76 changer transitions 0/480 dead transitions. [2024-06-27 22:48:46,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 480 transitions, 10765 flow [2024-06-27 22:48:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-27 22:48:46,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-27 22:48:46,261 INFO L175 Difference]: Start difference. First operand has 300 places, 440 transitions, 9090 flow. Second operand 9 states and 138 transitions. [2024-06-27 22:48:46,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 480 transitions, 10765 flow [2024-06-27 22:48:47,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 480 transitions, 10666 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 22:48:47,335 INFO L231 Difference]: Finished difference. Result has 303 places, 448 transitions, 9442 flow [2024-06-27 22:48:47,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8998, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9442, PETRI_PLACES=303, PETRI_TRANSITIONS=448} [2024-06-27 22:48:47,335 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 264 predicate places. [2024-06-27 22:48:47,336 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 448 transitions, 9442 flow [2024-06-27 22:48:47,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:47,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:47,336 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:48:47,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 22:48:47,336 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:48:47,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1709966457, now seen corresponding path program 10 times [2024-06-27 22:48:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510201593] [2024-06-27 22:48:47,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:48,732 INFO 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:48:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:48,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510201593] [2024-06-27 22:48:48,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510201593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:48,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:48,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:48,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230901081] [2024-06-27 22:48:48,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:48,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:48,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:48,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:48,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:48,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:48:48,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 448 transitions, 9442 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:48,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:48,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:48:48,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:50,371 INFO L124 PetriNetUnfolderBase]: 2828/5343 cut-off events. [2024-06-27 22:48:50,371 INFO L125 PetriNetUnfolderBase]: For 173861/173864 co-relation queries the response was YES. [2024-06-27 22:48:50,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40538 conditions, 5343 events. 2828/5343 cut-off events. For 173861/173864 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 41520 event pairs, 1144 based on Foata normal form. 3/5140 useless extension candidates. Maximal degree in co-relation 40393. Up to 4920 conditions per place. [2024-06-27 22:48:50,442 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 398 selfloop transitions, 72 changer transitions 0/477 dead transitions. [2024-06-27 22:48:50,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 477 transitions, 10695 flow [2024-06-27 22:48:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2024-06-27 22:48:50,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253968253968254 [2024-06-27 22:48:50,443 INFO L175 Difference]: Start difference. First operand has 303 places, 448 transitions, 9442 flow. Second operand 9 states and 134 transitions. [2024-06-27 22:48:50,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 477 transitions, 10695 flow [2024-06-27 22:48:51,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 477 transitions, 10442 flow, removed 89 selfloop flow, removed 5 redundant places. [2024-06-27 22:48:51,771 INFO L231 Difference]: Finished difference. Result has 307 places, 448 transitions, 9341 flow [2024-06-27 22:48:51,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9189, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9341, PETRI_PLACES=307, PETRI_TRANSITIONS=448} [2024-06-27 22:48:51,771 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 268 predicate places. [2024-06-27 22:48:51,772 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 448 transitions, 9341 flow [2024-06-27 22:48:51,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:51,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:51,772 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:48:51,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 22:48:51,772 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:48:51,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1410268929, now seen corresponding path program 11 times [2024-06-27 22:48:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866469053] [2024-06-27 22:48:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:53,097 INFO 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:48:53,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:53,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866469053] [2024-06-27 22:48:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866469053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:53,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:48:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070579372] [2024-06-27 22:48:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:53,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:48:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:48:53,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:48:53,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:48:53,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 448 transitions, 9341 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:48:53,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:53,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:48:53,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:54,723 INFO L124 PetriNetUnfolderBase]: 2773/5353 cut-off events. [2024-06-27 22:48:54,723 INFO L125 PetriNetUnfolderBase]: For 207082/207124 co-relation queries the response was YES. [2024-06-27 22:48:54,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40773 conditions, 5353 events. 2773/5353 cut-off events. For 207082/207124 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 42682 event pairs, 868 based on Foata normal form. 26/5170 useless extension candidates. Maximal degree in co-relation 40626. Up to 2980 conditions per place. [2024-06-27 22:48:54,785 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 198 selfloop transitions, 277 changer transitions 0/491 dead transitions. [2024-06-27 22:48:54,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 491 transitions, 10904 flow [2024-06-27 22:48:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-27 22:48:54,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:48:54,786 INFO L175 Difference]: Start difference. First operand has 307 places, 448 transitions, 9341 flow. Second operand 10 states and 175 transitions. [2024-06-27 22:48:54,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 491 transitions, 10904 flow [2024-06-27 22:48:56,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 491 transitions, 10760 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 22:48:56,068 INFO L231 Difference]: Finished difference. Result has 310 places, 450 transitions, 9851 flow [2024-06-27 22:48:56,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9197, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9851, PETRI_PLACES=310, PETRI_TRANSITIONS=450} [2024-06-27 22:48:56,069 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 271 predicate places. [2024-06-27 22:48:56,069 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 450 transitions, 9851 flow [2024-06-27 22:48:56,069 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:48:56,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:56,069 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:48:56,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 22:48:56,069 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:48:56,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash 542019641, now seen corresponding path program 12 times [2024-06-27 22:48:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064556478] [2024-06-27 22:48:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064556478] [2024-06-27 22:48:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064556478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:57,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:48:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628669038] [2024-06-27 22:48:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:57,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:48:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:57,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:48:57,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:48:57,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:48:57,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 450 transitions, 9851 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:48:57,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:57,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:48:57,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:59,084 INFO L124 PetriNetUnfolderBase]: 2876/5561 cut-off events. [2024-06-27 22:48:59,084 INFO L125 PetriNetUnfolderBase]: For 225133/225179 co-relation queries the response was YES. [2024-06-27 22:48:59,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42877 conditions, 5561 events. 2876/5561 cut-off events. For 225133/225179 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 44839 event pairs, 1075 based on Foata normal form. 36/5348 useless extension candidates. Maximal degree in co-relation 42729. Up to 4194 conditions per place. [2024-06-27 22:48:59,157 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 214 selfloop transitions, 251 changer transitions 0/481 dead transitions. [2024-06-27 22:48:59,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 481 transitions, 11087 flow [2024-06-27 22:48:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:48:59,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 22:48:59,159 INFO L175 Difference]: Start difference. First operand has 310 places, 450 transitions, 9851 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:48:59,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 481 transitions, 11087 flow [2024-06-27 22:49:00,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 481 transitions, 10666 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-27 22:49:00,532 INFO L231 Difference]: Finished difference. Result has 313 places, 451 transitions, 9996 flow [2024-06-27 22:49:00,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9436, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9996, PETRI_PLACES=313, PETRI_TRANSITIONS=451} [2024-06-27 22:49:00,533 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 274 predicate places. [2024-06-27 22:49:00,533 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 451 transitions, 9996 flow [2024-06-27 22:49:00,533 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:49:00,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:00,533 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:49:00,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 22:49:00,533 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:49:00,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1954464009, now seen corresponding path program 13 times [2024-06-27 22:49:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639141698] [2024-06-27 22:49:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:01,891 INFO 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:49:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639141698] [2024-06-27 22:49:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639141698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:01,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:01,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:49:01,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559216566] [2024-06-27 22:49:01,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:01,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:49:01,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:01,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:49:01,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:49:01,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:49:01,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 451 transitions, 9996 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:49:01,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:01,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:49:01,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:03,470 INFO L124 PetriNetUnfolderBase]: 2938/5690 cut-off events. [2024-06-27 22:49:03,470 INFO L125 PetriNetUnfolderBase]: For 221432/221478 co-relation queries the response was YES. [2024-06-27 22:49:03,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44002 conditions, 5690 events. 2938/5690 cut-off events. For 221432/221478 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 46211 event pairs, 1004 based on Foata normal form. 30/5477 useless extension candidates. Maximal degree in co-relation 43853. Up to 3930 conditions per place. [2024-06-27 22:49:03,545 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 221 selfloop transitions, 255 changer transitions 0/492 dead transitions. [2024-06-27 22:49:03,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 492 transitions, 11382 flow [2024-06-27 22:49:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:49:03,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2024-06-27 22:49:03,547 INFO L175 Difference]: Start difference. First operand has 313 places, 451 transitions, 9996 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:49:03,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 492 transitions, 11382 flow [2024-06-27 22:49:05,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 492 transitions, 10866 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-27 22:49:05,265 INFO L231 Difference]: Finished difference. Result has 315 places, 452 transitions, 10042 flow [2024-06-27 22:49:05,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9480, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10042, PETRI_PLACES=315, PETRI_TRANSITIONS=452} [2024-06-27 22:49:05,266 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 276 predicate places. [2024-06-27 22:49:05,266 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 452 transitions, 10042 flow [2024-06-27 22:49:05,266 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:49:05,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:05,266 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:49:05,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 22:49:05,267 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:49:05,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1313511729, now seen corresponding path program 14 times [2024-06-27 22:49:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961018956] [2024-06-27 22:49:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961018956] [2024-06-27 22:49:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961018956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:06,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:06,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:49:06,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918679744] [2024-06-27 22:49:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:06,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:49:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:06,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:49:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:49:06,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:49:06,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 452 transitions, 10042 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:06,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:06,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:49:06,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:08,626 INFO L124 PetriNetUnfolderBase]: 3421/6474 cut-off events. [2024-06-27 22:49:08,626 INFO L125 PetriNetUnfolderBase]: For 241066/241069 co-relation queries the response was YES. [2024-06-27 22:49:08,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49842 conditions, 6474 events. 3421/6474 cut-off events. For 241066/241069 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 52280 event pairs, 1406 based on Foata normal form. 13/6248 useless extension candidates. Maximal degree in co-relation 49692. Up to 5565 conditions per place. [2024-06-27 22:49:08,710 INFO L140 encePairwiseOnDemand]: 21/35 looper letters, 357 selfloop transitions, 170 changer transitions 0/534 dead transitions. [2024-06-27 22:49:08,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 534 transitions, 12463 flow [2024-06-27 22:49:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:49:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:49:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2024-06-27 22:49:08,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432967032967033 [2024-06-27 22:49:08,711 INFO L175 Difference]: Start difference. First operand has 315 places, 452 transitions, 10042 flow. Second operand 13 states and 197 transitions. [2024-06-27 22:49:08,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 534 transitions, 12463 flow [2024-06-27 22:49:10,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 534 transitions, 11857 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 22:49:10,180 INFO L231 Difference]: Finished difference. Result has 325 places, 498 transitions, 11088 flow [2024-06-27 22:49:10,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=9506, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11088, PETRI_PLACES=325, PETRI_TRANSITIONS=498} [2024-06-27 22:49:10,181 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 286 predicate places. [2024-06-27 22:49:10,181 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 498 transitions, 11088 flow [2024-06-27 22:49:10,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:10,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:10,181 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:49:10,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 22:49:10,182 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:49:10,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 628861553, now seen corresponding path program 11 times [2024-06-27 22:49:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044044002] [2024-06-27 22:49:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:11,466 INFO 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:49:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044044002] [2024-06-27 22:49:11,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044044002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:11,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:11,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:49:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429943637] [2024-06-27 22:49:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:11,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:49:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:11,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:49:11,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:49:11,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:49:11,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 498 transitions, 11088 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:11,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:11,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:49:11,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:13,511 INFO L124 PetriNetUnfolderBase]: 3448/6531 cut-off events. [2024-06-27 22:49:13,511 INFO L125 PetriNetUnfolderBase]: For 223817/223820 co-relation queries the response was YES. [2024-06-27 22:49:13,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50407 conditions, 6531 events. 3448/6531 cut-off events. For 223817/223820 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 52893 event pairs, 1421 based on Foata normal form. 5/6288 useless extension candidates. Maximal degree in co-relation 50251. Up to 5884 conditions per place. [2024-06-27 22:49:13,593 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 319 selfloop transitions, 201 changer transitions 0/527 dead transitions. [2024-06-27 22:49:13,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 527 transitions, 12388 flow [2024-06-27 22:49:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:49:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:49:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-27 22:49:13,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2024-06-27 22:49:13,594 INFO L175 Difference]: Start difference. First operand has 325 places, 498 transitions, 11088 flow. Second operand 9 states and 149 transitions. [2024-06-27 22:49:13,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 527 transitions, 12388 flow [2024-06-27 22:49:15,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 527 transitions, 12164 flow, removed 91 selfloop flow, removed 3 redundant places. [2024-06-27 22:49:15,173 INFO L231 Difference]: Finished difference. Result has 332 places, 504 transitions, 11537 flow [2024-06-27 22:49:15,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=10864, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11537, PETRI_PLACES=332, PETRI_TRANSITIONS=504} [2024-06-27 22:49:15,174 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 293 predicate places. [2024-06-27 22:49:15,174 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 504 transitions, 11537 flow [2024-06-27 22:49:15,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:15,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:15,175 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:49:15,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 22:49:15,175 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:49:15,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash 628707731, now seen corresponding path program 15 times [2024-06-27 22:49:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286980859] [2024-06-27 22:49:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:16,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286980859] [2024-06-27 22:49:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286980859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:16,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:49:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775245349] [2024-06-27 22:49:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:49:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:49:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:49:16,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:49:16,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 504 transitions, 11537 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:49:16,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:16,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:49:16,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:18,476 INFO L124 PetriNetUnfolderBase]: 3392/6566 cut-off events. [2024-06-27 22:49:18,476 INFO L125 PetriNetUnfolderBase]: For 284577/284625 co-relation queries the response was YES. [2024-06-27 22:49:18,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52421 conditions, 6566 events. 3392/6566 cut-off events. For 284577/284625 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 54820 event pairs, 1295 based on Foata normal form. 30/6321 useless extension candidates. Maximal degree in co-relation 52263. Up to 4282 conditions per place. [2024-06-27 22:49:18,564 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 278 selfloop transitions, 243 changer transitions 0/539 dead transitions. [2024-06-27 22:49:18,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 539 transitions, 13126 flow [2024-06-27 22:49:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 22:49:18,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2024-06-27 22:49:18,565 INFO L175 Difference]: Start difference. First operand has 332 places, 504 transitions, 11537 flow. Second operand 10 states and 169 transitions. [2024-06-27 22:49:18,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 539 transitions, 13126 flow [2024-06-27 22:49:20,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 539 transitions, 12701 flow, removed 82 selfloop flow, removed 7 redundant places. [2024-06-27 22:49:20,418 INFO L231 Difference]: Finished difference. Result has 335 places, 506 transitions, 11704 flow [2024-06-27 22:49:20,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11112, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11704, PETRI_PLACES=335, PETRI_TRANSITIONS=506} [2024-06-27 22:49:20,418 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 296 predicate places. [2024-06-27 22:49:20,418 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 506 transitions, 11704 flow [2024-06-27 22:49:20,419 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:49:20,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:20,419 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:49:20,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 22:49:20,419 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:49:20,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash -50612357, now seen corresponding path program 16 times [2024-06-27 22:49:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646817314] [2024-06-27 22:49:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:21,678 INFO 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:49:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646817314] [2024-06-27 22:49:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646817314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:49:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147174236] [2024-06-27 22:49:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:21,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:49:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:21,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:49:21,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:49:21,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:49:21,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 506 transitions, 11704 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:49:21,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:21,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:49:21,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:23,543 INFO L124 PetriNetUnfolderBase]: 3483/6751 cut-off events. [2024-06-27 22:49:23,543 INFO L125 PetriNetUnfolderBase]: For 299296/299344 co-relation queries the response was YES. [2024-06-27 22:49:23,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53586 conditions, 6751 events. 3483/6751 cut-off events. For 299296/299344 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 56829 event pairs, 1432 based on Foata normal form. 41/6481 useless extension candidates. Maximal degree in co-relation 53428. Up to 5547 conditions per place. [2024-06-27 22:49:23,640 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 283 selfloop transitions, 232 changer transitions 0/533 dead transitions. [2024-06-27 22:49:23,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 533 transitions, 13014 flow [2024-06-27 22:49:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 22:49:23,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2024-06-27 22:49:23,642 INFO L175 Difference]: Start difference. First operand has 335 places, 506 transitions, 11704 flow. Second operand 10 states and 163 transitions. [2024-06-27 22:49:23,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 533 transitions, 13014 flow [2024-06-27 22:49:25,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 533 transitions, 12680 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-27 22:49:25,886 INFO L231 Difference]: Finished difference. Result has 338 places, 507 transitions, 11898 flow [2024-06-27 22:49:25,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11370, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11898, PETRI_PLACES=338, PETRI_TRANSITIONS=507} [2024-06-27 22:49:25,887 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 299 predicate places. [2024-06-27 22:49:25,887 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 507 transitions, 11898 flow [2024-06-27 22:49:25,887 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:49:25,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:25,887 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:49:25,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 22:49:25,888 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:49:25,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1584814879, now seen corresponding path program 12 times [2024-06-27 22:49:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:25,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785528378] [2024-06-27 22:49:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:27,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:49:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:27,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785528378] [2024-06-27 22:49:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785528378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:27,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:27,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:49:27,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020723484] [2024-06-27 22:49:27,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:27,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:49:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:49:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:49:27,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:49:27,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 507 transitions, 11898 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:27,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:27,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:49:27,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:29,502 INFO L124 PetriNetUnfolderBase]: 3782/7183 cut-off events. [2024-06-27 22:49:29,503 INFO L125 PetriNetUnfolderBase]: For 281883/281886 co-relation queries the response was YES. [2024-06-27 22:49:29,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56970 conditions, 7183 events. 3782/7183 cut-off events. For 281883/281886 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 59529 event pairs, 1599 based on Foata normal form. 5/6917 useless extension candidates. Maximal degree in co-relation 56811. Up to 6494 conditions per place. [2024-06-27 22:49:29,594 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 338 selfloop transitions, 208 changer transitions 0/553 dead transitions. [2024-06-27 22:49:29,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 553 transitions, 13747 flow [2024-06-27 22:49:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:49:29,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 22:49:29,595 INFO L175 Difference]: Start difference. First operand has 338 places, 507 transitions, 11898 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:49:29,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 553 transitions, 13747 flow [2024-06-27 22:49:31,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 553 transitions, 12932 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-27 22:49:31,495 INFO L231 Difference]: Finished difference. Result has 340 places, 528 transitions, 12115 flow [2024-06-27 22:49:31,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11125, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12115, PETRI_PLACES=340, PETRI_TRANSITIONS=528} [2024-06-27 22:49:31,495 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 301 predicate places. [2024-06-27 22:49:31,495 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 528 transitions, 12115 flow [2024-06-27 22:49:31,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:31,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:31,496 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:49:31,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 22:49:31,496 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:49:31,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 809873453, now seen corresponding path program 17 times [2024-06-27 22:49:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973699934] [2024-06-27 22:49:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:32,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:49:32,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973699934] [2024-06-27 22:49:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973699934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:32,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:32,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:49:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105907040] [2024-06-27 22:49:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:32,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:49:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:49:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:49:33,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:49:33,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 528 transitions, 12115 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:49:33,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:33,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:49:33,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:35,129 INFO L124 PetriNetUnfolderBase]: 3512/6806 cut-off events. [2024-06-27 22:49:35,129 INFO L125 PetriNetUnfolderBase]: For 275542/275590 co-relation queries the response was YES. [2024-06-27 22:49:35,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52900 conditions, 6806 events. 3512/6806 cut-off events. For 275542/275590 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 57261 event pairs, 1405 based on Foata normal form. 40/6559 useless extension candidates. Maximal degree in co-relation 52740. Up to 4380 conditions per place. [2024-06-27 22:49:35,232 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 271 selfloop transitions, 262 changer transitions 0/552 dead transitions. [2024-06-27 22:49:35,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 552 transitions, 13372 flow [2024-06-27 22:49:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-27 22:49:35,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-06-27 22:49:35,233 INFO L175 Difference]: Start difference. First operand has 340 places, 528 transitions, 12115 flow. Second operand 10 states and 162 transitions. [2024-06-27 22:49:35,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 552 transitions, 13372 flow [2024-06-27 22:49:37,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 552 transitions, 13012 flow, removed 70 selfloop flow, removed 5 redundant places. [2024-06-27 22:49:37,328 INFO L231 Difference]: Finished difference. Result has 345 places, 528 transitions, 12330 flow [2024-06-27 22:49:37,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11755, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12330, PETRI_PLACES=345, PETRI_TRANSITIONS=528} [2024-06-27 22:49:37,329 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 306 predicate places. [2024-06-27 22:49:37,329 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 528 transitions, 12330 flow [2024-06-27 22:49:37,329 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:49:37,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:37,329 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:49:37,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 22:49:37,329 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:49:37,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 10455673, now seen corresponding path program 13 times [2024-06-27 22:49:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966913601] [2024-06-27 22:49:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:38,732 INFO 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:49:38,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:38,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966913601] [2024-06-27 22:49:38,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966913601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:38,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:38,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:49:38,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569919643] [2024-06-27 22:49:38,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:38,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:49:38,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:49:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:49:38,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:49:38,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 528 transitions, 12330 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:38,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:38,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:49:38,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:40,946 INFO L124 PetriNetUnfolderBase]: 3792/7203 cut-off events. [2024-06-27 22:49:40,946 INFO L125 PetriNetUnfolderBase]: For 235942/235945 co-relation queries the response was YES. [2024-06-27 22:49:41,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55526 conditions, 7203 events. 3792/7203 cut-off events. For 235942/235945 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 59803 event pairs, 1633 based on Foata normal form. 3/6931 useless extension candidates. Maximal degree in co-relation 55365. Up to 6699 conditions per place. [2024-06-27 22:49:41,065 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 458 selfloop transitions, 96 changer transitions 0/561 dead transitions. [2024-06-27 22:49:41,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 561 transitions, 13834 flow [2024-06-27 22:49:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:49:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:49:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 178 transitions. [2024-06-27 22:49:41,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-27 22:49:41,066 INFO L175 Difference]: Start difference. First operand has 345 places, 528 transitions, 12330 flow. Second operand 12 states and 178 transitions. [2024-06-27 22:49:41,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 561 transitions, 13834 flow [2024-06-27 22:49:43,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 561 transitions, 13255 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-27 22:49:43,030 INFO L231 Difference]: Finished difference. Result has 345 places, 533 transitions, 12113 flow [2024-06-27 22:49:43,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11751, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12113, PETRI_PLACES=345, PETRI_TRANSITIONS=533} [2024-06-27 22:49:43,031 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 306 predicate places. [2024-06-27 22:49:43,031 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 533 transitions, 12113 flow [2024-06-27 22:49:43,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:43,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:43,031 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:49:43,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 22:49:43,031 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:49:43,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 88932427, now seen corresponding path program 18 times [2024-06-27 22:49:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950602268] [2024-06-27 22:49:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:44,482 INFO 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:49:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:44,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950602268] [2024-06-27 22:49:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950602268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:44,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:44,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:49:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799146527] [2024-06-27 22:49:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:44,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:49:44,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:49:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:49:44,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:49:44,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 533 transitions, 12113 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:49:44,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:44,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:49:44,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:46,461 INFO L124 PetriNetUnfolderBase]: 3522/6826 cut-off events. [2024-06-27 22:49:46,461 INFO L125 PetriNetUnfolderBase]: For 218268/218314 co-relation queries the response was YES. [2024-06-27 22:49:46,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51505 conditions, 6826 events. 3522/6826 cut-off events. For 218268/218314 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 57485 event pairs, 1468 based on Foata normal form. 36/6549 useless extension candidates. Maximal degree in co-relation 51345. Up to 5183 conditions per place. [2024-06-27 22:49:46,554 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 391 selfloop transitions, 148 changer transitions 0/558 dead transitions. [2024-06-27 22:49:46,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 558 transitions, 13421 flow [2024-06-27 22:49:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 22:49:46,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 22:49:46,555 INFO L175 Difference]: Start difference. First operand has 345 places, 533 transitions, 12113 flow. Second operand 10 states and 160 transitions. [2024-06-27 22:49:46,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 558 transitions, 13421 flow [2024-06-27 22:49:47,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 558 transitions, 13187 flow, removed 48 selfloop flow, removed 8 redundant places. [2024-06-27 22:49:47,770 INFO L231 Difference]: Finished difference. Result has 347 places, 533 transitions, 12208 flow [2024-06-27 22:49:47,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11879, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12208, PETRI_PLACES=347, PETRI_TRANSITIONS=533} [2024-06-27 22:49:47,771 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 308 predicate places. [2024-06-27 22:49:47,771 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 533 transitions, 12208 flow [2024-06-27 22:49:47,771 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:49:47,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:47,771 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:49:47,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 22:49:47,772 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:49:47,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1725815583, now seen corresponding path program 14 times [2024-06-27 22:49:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157173304] [2024-06-27 22:49:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:49,166 INFO 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:49:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157173304] [2024-06-27 22:49:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157173304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:49:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922416649] [2024-06-27 22:49:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:49,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:49:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:49:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:49:49,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:49:49,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 533 transitions, 12208 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:49,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:49,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:49:49,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:51,449 INFO L124 PetriNetUnfolderBase]: 3801/7219 cut-off events. [2024-06-27 22:49:51,449 INFO L125 PetriNetUnfolderBase]: For 178762/178765 co-relation queries the response was YES. [2024-06-27 22:49:51,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54091 conditions, 7219 events. 3801/7219 cut-off events. For 178762/178765 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 59976 event pairs, 1630 based on Foata normal form. 3/6948 useless extension candidates. Maximal degree in co-relation 53930. Up to 6716 conditions per place. [2024-06-27 22:49:51,531 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 462 selfloop transitions, 94 changer transitions 0/563 dead transitions. [2024-06-27 22:49:51,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 563 transitions, 13710 flow [2024-06-27 22:49:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-27 22:49:51,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44571428571428573 [2024-06-27 22:49:51,532 INFO L175 Difference]: Start difference. First operand has 347 places, 533 transitions, 12208 flow. Second operand 10 states and 156 transitions. [2024-06-27 22:49:51,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 563 transitions, 13710 flow [2024-06-27 22:49:52,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 563 transitions, 13122 flow, removed 17 selfloop flow, removed 12 redundant places. [2024-06-27 22:49:52,763 INFO L231 Difference]: Finished difference. Result has 345 places, 538 transitions, 11983 flow [2024-06-27 22:49:52,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11620, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11983, PETRI_PLACES=345, PETRI_TRANSITIONS=538} [2024-06-27 22:49:52,764 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 306 predicate places. [2024-06-27 22:49:52,764 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 538 transitions, 11983 flow [2024-06-27 22:49:52,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:52,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:52,764 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:49:52,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 22:49:52,764 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:49:52,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1731387213, now seen corresponding path program 15 times [2024-06-27 22:49:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252912203] [2024-06-27 22:49:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:52,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:54,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:54,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252912203] [2024-06-27 22:49:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252912203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:54,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:54,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:49:54,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611150929] [2024-06-27 22:49:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:54,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:49:54,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:49:54,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:49:54,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:49:54,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 538 transitions, 11983 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:54,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:54,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:49:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:56,486 INFO L124 PetriNetUnfolderBase]: 3812/7241 cut-off events. [2024-06-27 22:49:56,486 INFO L125 PetriNetUnfolderBase]: For 167076/167079 co-relation queries the response was YES. [2024-06-27 22:49:56,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53139 conditions, 7241 events. 3812/7241 cut-off events. For 167076/167079 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 60197 event pairs, 1616 based on Foata normal form. 3/6973 useless extension candidates. Maximal degree in co-relation 52980. Up to 6652 conditions per place. [2024-06-27 22:49:56,581 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 466 selfloop transitions, 105 changer transitions 0/578 dead transitions. [2024-06-27 22:49:56,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 578 transitions, 13582 flow [2024-06-27 22:49:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:49:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:49:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-06-27 22:49:56,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44415584415584414 [2024-06-27 22:49:56,582 INFO L175 Difference]: Start difference. First operand has 345 places, 538 transitions, 11983 flow. Second operand 11 states and 171 transitions. [2024-06-27 22:49:56,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 578 transitions, 13582 flow [2024-06-27 22:49:57,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 578 transitions, 13285 flow, removed 58 selfloop flow, removed 8 redundant places. [2024-06-27 22:49:57,805 INFO L231 Difference]: Finished difference. Result has 349 places, 550 transitions, 12226 flow [2024-06-27 22:49:57,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11712, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12226, PETRI_PLACES=349, PETRI_TRANSITIONS=550} [2024-06-27 22:49:57,805 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 310 predicate places. [2024-06-27 22:49:57,805 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 550 transitions, 12226 flow [2024-06-27 22:49:57,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:57,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:57,806 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:49:57,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 22:49:57,806 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:49:57,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2083586337, now seen corresponding path program 1 times [2024-06-27 22:49:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:57,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495989575] [2024-06-27 22:49:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:59,598 INFO 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:49:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495989575] [2024-06-27 22:49:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495989575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:49:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440297162] [2024-06-27 22:49:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:59,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:49:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:49:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:49:59,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:49:59,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 550 transitions, 12226 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:59,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:59,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:49:59,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:01,742 INFO L124 PetriNetUnfolderBase]: 3862/7347 cut-off events. [2024-06-27 22:50:01,742 INFO L125 PetriNetUnfolderBase]: For 185170/185173 co-relation queries the response was YES. [2024-06-27 22:50:01,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54281 conditions, 7347 events. 3862/7347 cut-off events. For 185170/185173 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 61346 event pairs, 1673 based on Foata normal form. 7/7078 useless extension candidates. Maximal degree in co-relation 54121. Up to 6625 conditions per place. [2024-06-27 22:50:01,847 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 413 selfloop transitions, 158 changer transitions 0/578 dead transitions. [2024-06-27 22:50:01,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 578 transitions, 13696 flow [2024-06-27 22:50:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2024-06-27 22:50:01,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2024-06-27 22:50:01,849 INFO L175 Difference]: Start difference. First operand has 349 places, 550 transitions, 12226 flow. Second operand 10 states and 152 transitions. [2024-06-27 22:50:01,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 578 transitions, 13696 flow [2024-06-27 22:50:03,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 578 transitions, 13372 flow, removed 106 selfloop flow, removed 7 redundant places. [2024-06-27 22:50:03,173 INFO L231 Difference]: Finished difference. Result has 352 places, 551 transitions, 12279 flow [2024-06-27 22:50:03,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11902, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12279, PETRI_PLACES=352, PETRI_TRANSITIONS=551} [2024-06-27 22:50:03,174 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 313 predicate places. [2024-06-27 22:50:03,174 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 551 transitions, 12279 flow [2024-06-27 22:50:03,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:03,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:03,174 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:50:03,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 22:50:03,174 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:50:03,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:03,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1503279413, now seen corresponding path program 2 times [2024-06-27 22:50:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:03,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375716284] [2024-06-27 22:50:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:03,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:50:04,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375716284] [2024-06-27 22:50:04,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375716284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:04,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:04,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:50:04,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629643794] [2024-06-27 22:50:04,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:04,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:50:04,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:04,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:50:04,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:50:04,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:04,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 551 transitions, 12279 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:04,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:04,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:04,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:07,109 INFO L124 PetriNetUnfolderBase]: 3912/7448 cut-off events. [2024-06-27 22:50:07,109 INFO L125 PetriNetUnfolderBase]: For 185010/185013 co-relation queries the response was YES. [2024-06-27 22:50:07,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54471 conditions, 7448 events. 3912/7448 cut-off events. For 185010/185013 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 62409 event pairs, 1730 based on Foata normal form. 7/7180 useless extension candidates. Maximal degree in co-relation 54308. Up to 6760 conditions per place. [2024-06-27 22:50:07,226 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 477 selfloop transitions, 96 changer transitions 0/580 dead transitions. [2024-06-27 22:50:07,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 580 transitions, 13791 flow [2024-06-27 22:50:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2024-06-27 22:50:07,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 22:50:07,227 INFO L175 Difference]: Start difference. First operand has 352 places, 551 transitions, 12279 flow. Second operand 10 states and 150 transitions. [2024-06-27 22:50:07,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 580 transitions, 13791 flow [2024-06-27 22:50:08,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 580 transitions, 13394 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-27 22:50:08,754 INFO L231 Difference]: Finished difference. Result has 354 places, 552 transitions, 12141 flow [2024-06-27 22:50:08,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11882, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12141, PETRI_PLACES=354, PETRI_TRANSITIONS=552} [2024-06-27 22:50:08,755 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 315 predicate places. [2024-06-27 22:50:08,755 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 552 transitions, 12141 flow [2024-06-27 22:50:08,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:08,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:08,755 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:50:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 22:50:08,755 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:50:08,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1509766163, now seen corresponding path program 3 times [2024-06-27 22:50:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541089269] [2024-06-27 22:50:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:10,308 INFO 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:50:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541089269] [2024-06-27 22:50:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541089269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:50:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264834511] [2024-06-27 22:50:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:10,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:50:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:50:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:50:10,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:10,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 552 transitions, 12141 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:10,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:10,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:10,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:12,737 INFO L124 PetriNetUnfolderBase]: 3962/7548 cut-off events. [2024-06-27 22:50:12,737 INFO L125 PetriNetUnfolderBase]: For 188115/188118 co-relation queries the response was YES. [2024-06-27 22:50:12,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54885 conditions, 7548 events. 3962/7548 cut-off events. For 188115/188118 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 63563 event pairs, 1748 based on Foata normal form. 7/7277 useless extension candidates. Maximal degree in co-relation 54721. Up to 6812 conditions per place. [2024-06-27 22:50:12,844 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 479 selfloop transitions, 103 changer transitions 0/589 dead transitions. [2024-06-27 22:50:12,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 589 transitions, 13762 flow [2024-06-27 22:50:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:50:12,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 22:50:12,846 INFO L175 Difference]: Start difference. First operand has 354 places, 552 transitions, 12141 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:50:12,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 589 transitions, 13762 flow [2024-06-27 22:50:14,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 589 transitions, 13535 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-27 22:50:14,234 INFO L231 Difference]: Finished difference. Result has 356 places, 553 transitions, 12184 flow [2024-06-27 22:50:14,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11914, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12184, PETRI_PLACES=356, PETRI_TRANSITIONS=553} [2024-06-27 22:50:14,235 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 317 predicate places. [2024-06-27 22:50:14,235 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 553 transitions, 12184 flow [2024-06-27 22:50:14,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:14,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:14,235 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:50:14,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 22:50:14,235 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:50:14,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1663252863, now seen corresponding path program 4 times [2024-06-27 22:50:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927700146] [2024-06-27 22:50:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:16,298 INFO 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:50:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:16,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927700146] [2024-06-27 22:50:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927700146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:50:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785557761] [2024-06-27 22:50:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:16,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:50:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:50:16,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:50:16,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:16,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 553 transitions, 12184 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:50:16,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:16,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:16,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:18,708 INFO L124 PetriNetUnfolderBase]: 4012/7649 cut-off events. [2024-06-27 22:50:18,709 INFO L125 PetriNetUnfolderBase]: For 191402/191405 co-relation queries the response was YES. [2024-06-27 22:50:18,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55510 conditions, 7649 events. 4012/7649 cut-off events. For 191402/191405 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 64621 event pairs, 1818 based on Foata normal form. 7/7378 useless extension candidates. Maximal degree in co-relation 55345. Up to 7037 conditions per place. [2024-06-27 22:50:18,824 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 486 selfloop transitions, 94 changer transitions 0/587 dead transitions. [2024-06-27 22:50:18,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 587 transitions, 13808 flow [2024-06-27 22:50:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-27 22:50:18,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43142857142857144 [2024-06-27 22:50:18,825 INFO L175 Difference]: Start difference. First operand has 356 places, 553 transitions, 12184 flow. Second operand 10 states and 151 transitions. [2024-06-27 22:50:18,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 587 transitions, 13808 flow [2024-06-27 22:50:20,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 587 transitions, 13560 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-27 22:50:20,193 INFO L231 Difference]: Finished difference. Result has 358 places, 554 transitions, 12189 flow [2024-06-27 22:50:20,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11936, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12189, PETRI_PLACES=358, PETRI_TRANSITIONS=554} [2024-06-27 22:50:20,194 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 319 predicate places. [2024-06-27 22:50:20,194 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 554 transitions, 12189 flow [2024-06-27 22:50:20,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:50:20,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:20,194 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:50:20,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 22:50:20,194 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:50:20,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1663259559, now seen corresponding path program 1 times [2024-06-27 22:50:20,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:20,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443542939] [2024-06-27 22:50:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:21,924 INFO 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:50:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443542939] [2024-06-27 22:50:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443542939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:21,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:21,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:50:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683441489] [2024-06-27 22:50:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:21,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:50:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:50:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:50:21,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:21,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 554 transitions, 12189 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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:50:21,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:21,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:21,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:24,470 INFO L124 PetriNetUnfolderBase]: 4002/7629 cut-off events. [2024-06-27 22:50:24,471 INFO L125 PetriNetUnfolderBase]: For 173681/173684 co-relation queries the response was YES. [2024-06-27 22:50:24,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54683 conditions, 7629 events. 4002/7629 cut-off events. For 173681/173684 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 64418 event pairs, 1788 based on Foata normal form. 9/7365 useless extension candidates. Maximal degree in co-relation 54517. Up to 6335 conditions per place. [2024-06-27 22:50:24,557 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 467 selfloop transitions, 116 changer transitions 0/590 dead transitions. [2024-06-27 22:50:24,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 590 transitions, 13805 flow [2024-06-27 22:50:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-27 22:50:24,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2024-06-27 22:50:24,558 INFO L175 Difference]: Start difference. First operand has 358 places, 554 transitions, 12189 flow. Second operand 10 states and 157 transitions. [2024-06-27 22:50:24,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 590 transitions, 13805 flow [2024-06-27 22:50:25,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 590 transitions, 13564 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-06-27 22:50:25,672 INFO L231 Difference]: Finished difference. Result has 360 places, 554 transitions, 12206 flow [2024-06-27 22:50:25,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11948, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12206, PETRI_PLACES=360, PETRI_TRANSITIONS=554} [2024-06-27 22:50:25,672 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 321 predicate places. [2024-06-27 22:50:25,673 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 554 transitions, 12206 flow [2024-06-27 22:50:25,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 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:50:25,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:25,673 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:50:25,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 22:50:25,673 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:50:25,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1497019083, now seen corresponding path program 5 times [2024-06-27 22:50:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023754895] [2024-06-27 22:50:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:27,489 INFO 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:50:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:27,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023754895] [2024-06-27 22:50:27,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023754895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:27,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:27,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:50:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978928840] [2024-06-27 22:50:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:27,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:50:27,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:50:27,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:50:27,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:27,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 554 transitions, 12206 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:50:27,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:27,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:27,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:30,046 INFO L124 PetriNetUnfolderBase]: 4052/7731 cut-off events. [2024-06-27 22:50:30,046 INFO L125 PetriNetUnfolderBase]: For 169628/169631 co-relation queries the response was YES. [2024-06-27 22:50:30,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55327 conditions, 7731 events. 4052/7731 cut-off events. For 169628/169631 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 65540 event pairs, 1854 based on Foata normal form. 7/7460 useless extension candidates. Maximal degree in co-relation 55160. Up to 7115 conditions per place. [2024-06-27 22:50:30,156 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 503 selfloop transitions, 85 changer transitions 0/595 dead transitions. [2024-06-27 22:50:30,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 595 transitions, 13982 flow [2024-06-27 22:50:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2024-06-27 22:50:30,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 22:50:30,158 INFO L175 Difference]: Start difference. First operand has 360 places, 554 transitions, 12206 flow. Second operand 10 states and 150 transitions. [2024-06-27 22:50:30,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 595 transitions, 13982 flow [2024-06-27 22:50:31,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 595 transitions, 13498 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-27 22:50:31,494 INFO L231 Difference]: Finished difference. Result has 356 places, 555 transitions, 11959 flow [2024-06-27 22:50:31,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11722, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11959, PETRI_PLACES=356, PETRI_TRANSITIONS=555} [2024-06-27 22:50:31,495 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 317 predicate places. [2024-06-27 22:50:31,495 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 555 transitions, 11959 flow [2024-06-27 22:50:31,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:50:31,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:31,496 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:50:31,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 22:50:31,496 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:50:31,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1490532333, now seen corresponding path program 6 times [2024-06-27 22:50:31,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:31,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409209794] [2024-06-27 22:50:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:32,963 INFO 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:50:32,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:32,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409209794] [2024-06-27 22:50:32,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409209794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:32,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:32,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:50:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680277367] [2024-06-27 22:50:32,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:32,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:50:32,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:32,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:50:32,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:50:33,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:33,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 555 transitions, 11959 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:33,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:33,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:33,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:35,315 INFO L124 PetriNetUnfolderBase]: 4102/7831 cut-off events. [2024-06-27 22:50:35,315 INFO L125 PetriNetUnfolderBase]: For 170937/170940 co-relation queries the response was YES. [2024-06-27 22:50:35,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55247 conditions, 7831 events. 4102/7831 cut-off events. For 170937/170940 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 66584 event pairs, 1852 based on Foata normal form. 7/7564 useless extension candidates. Maximal degree in co-relation 55083. Up to 7013 conditions per place. [2024-06-27 22:50:35,423 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 489 selfloop transitions, 92 changer transitions 0/588 dead transitions. [2024-06-27 22:50:35,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 588 transitions, 13566 flow [2024-06-27 22:50:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:50:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:50:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-27 22:50:35,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2024-06-27 22:50:35,425 INFO L175 Difference]: Start difference. First operand has 356 places, 555 transitions, 11959 flow. Second operand 8 states and 131 transitions. [2024-06-27 22:50:35,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 588 transitions, 13566 flow [2024-06-27 22:50:36,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 588 transitions, 13353 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-27 22:50:36,697 INFO L231 Difference]: Finished difference. Result has 355 places, 556 transitions, 12001 flow [2024-06-27 22:50:36,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11746, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12001, PETRI_PLACES=355, PETRI_TRANSITIONS=556} [2024-06-27 22:50:36,698 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 316 predicate places. [2024-06-27 22:50:36,698 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 556 transitions, 12001 flow [2024-06-27 22:50:36,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:36,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:36,698 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:50:36,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 22:50:36,698 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:50:36,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash -644372069, now seen corresponding path program 7 times [2024-06-27 22:50:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887746269] [2024-06-27 22:50:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:50:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887746269] [2024-06-27 22:50:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887746269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:38,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:38,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:50:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442189042] [2024-06-27 22:50:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:38,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:50:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:50:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:50:38,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:38,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 556 transitions, 12001 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:38,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:38,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:38,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:40,951 INFO L124 PetriNetUnfolderBase]: 4152/7935 cut-off events. [2024-06-27 22:50:40,951 INFO L125 PetriNetUnfolderBase]: For 170600/170603 co-relation queries the response was YES. [2024-06-27 22:50:41,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55849 conditions, 7935 events. 4152/7935 cut-off events. For 170600/170603 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 67767 event pairs, 1870 based on Foata normal form. 7/7666 useless extension candidates. Maximal degree in co-relation 55686. Up to 7019 conditions per place. [2024-06-27 22:50:41,049 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 478 selfloop transitions, 99 changer transitions 0/584 dead transitions. [2024-06-27 22:50:41,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 584 transitions, 13526 flow [2024-06-27 22:50:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:50:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:50:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-27 22:50:41,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-27 22:50:41,051 INFO L175 Difference]: Start difference. First operand has 355 places, 556 transitions, 12001 flow. Second operand 9 states and 138 transitions. [2024-06-27 22:50:41,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 584 transitions, 13526 flow [2024-06-27 22:50:42,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 584 transitions, 13295 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 22:50:42,288 INFO L231 Difference]: Finished difference. Result has 358 places, 557 transitions, 12045 flow [2024-06-27 22:50:42,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11770, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12045, PETRI_PLACES=358, PETRI_TRANSITIONS=557} [2024-06-27 22:50:42,288 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 319 predicate places. [2024-06-27 22:50:42,289 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 557 transitions, 12045 flow [2024-06-27 22:50:42,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:42,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:42,289 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:50:42,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 22:50:42,289 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:50:42,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash -110880181, now seen corresponding path program 8 times [2024-06-27 22:50:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098843824] [2024-06-27 22:50:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:43,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:50:43,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:43,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098843824] [2024-06-27 22:50:43,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098843824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:43,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:43,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:50:43,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040425042] [2024-06-27 22:50:43,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:43,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:50:43,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:43,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:50:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:50:43,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:43,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 557 transitions, 12045 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:43,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:43,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:43,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:46,319 INFO L124 PetriNetUnfolderBase]: 4205/8022 cut-off events. [2024-06-27 22:50:46,319 INFO L125 PetriNetUnfolderBase]: For 175225/175228 co-relation queries the response was YES. [2024-06-27 22:50:46,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56472 conditions, 8022 events. 4205/8022 cut-off events. For 175225/175228 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 68552 event pairs, 1964 based on Foata normal form. 7/7740 useless extension candidates. Maximal degree in co-relation 56308. Up to 7489 conditions per place. [2024-06-27 22:50:46,430 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 559 selfloop transitions, 23 changer transitions 0/589 dead transitions. [2024-06-27 22:50:46,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 589 transitions, 13657 flow [2024-06-27 22:50:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:50:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:50:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-27 22:50:46,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43174603174603177 [2024-06-27 22:50:46,431 INFO L175 Difference]: Start difference. First operand has 358 places, 557 transitions, 12045 flow. Second operand 9 states and 136 transitions. [2024-06-27 22:50:46,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 589 transitions, 13657 flow [2024-06-27 22:50:47,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 589 transitions, 13402 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-27 22:50:47,646 INFO L231 Difference]: Finished difference. Result has 362 places, 565 transitions, 12160 flow [2024-06-27 22:50:47,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11798, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12160, PETRI_PLACES=362, PETRI_TRANSITIONS=565} [2024-06-27 22:50:47,646 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 323 predicate places. [2024-06-27 22:50:47,647 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 565 transitions, 12160 flow [2024-06-27 22:50:47,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:47,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:47,647 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:50:47,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 22:50:47,647 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:50:47,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2063972585, now seen corresponding path program 9 times [2024-06-27 22:50:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858639211] [2024-06-27 22:50:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:47,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:50:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858639211] [2024-06-27 22:50:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858639211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:50:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551301808] [2024-06-27 22:50:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:49,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:50:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:50:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:50:49,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:50:49,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 565 transitions, 12160 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:49,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:49,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:50:49,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:51,432 INFO L124 PetriNetUnfolderBase]: 4258/8141 cut-off events. [2024-06-27 22:50:51,433 INFO L125 PetriNetUnfolderBase]: For 188839/188842 co-relation queries the response was YES. [2024-06-27 22:50:51,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58008 conditions, 8141 events. 4258/8141 cut-off events. For 188839/188842 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 69965 event pairs, 1868 based on Foata normal form. 9/7878 useless extension candidates. Maximal degree in co-relation 57841. Up to 7099 conditions per place. [2024-06-27 22:50:51,548 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 375 selfloop transitions, 221 changer transitions 0/603 dead transitions. [2024-06-27 22:50:51,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 603 transitions, 13923 flow [2024-06-27 22:50:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:50:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:50:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-27 22:50:51,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 22:50:51,549 INFO L175 Difference]: Start difference. First operand has 362 places, 565 transitions, 12160 flow. Second operand 9 states and 147 transitions. [2024-06-27 22:50:51,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 603 transitions, 13923 flow [2024-06-27 22:50:52,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 603 transitions, 13617 flow, removed 135 selfloop flow, removed 5 redundant places. [2024-06-27 22:50:52,965 INFO L231 Difference]: Finished difference. Result has 367 places, 568 transitions, 12513 flow [2024-06-27 22:50:52,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11854, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12513, PETRI_PLACES=367, PETRI_TRANSITIONS=568} [2024-06-27 22:50:52,965 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 328 predicate places. [2024-06-27 22:50:52,965 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 568 transitions, 12513 flow [2024-06-27 22:50:52,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:52,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:52,966 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:50:52,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 22:50:52,966 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:50:52,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash 324126701, now seen corresponding path program 10 times [2024-06-27 22:50:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:52,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774693569] [2024-06-27 22:50:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:54,406 INFO 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:50:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774693569] [2024-06-27 22:50:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774693569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:50:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572588142] [2024-06-27 22:50:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:54,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:50:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:54,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:50:54,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:50:54,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:50:54,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 568 transitions, 12513 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:50:54,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:54,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:50:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:56,635 INFO L124 PetriNetUnfolderBase]: 3990/7786 cut-off events. [2024-06-27 22:50:56,635 INFO L125 PetriNetUnfolderBase]: For 192236/192282 co-relation queries the response was YES. [2024-06-27 22:50:56,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56332 conditions, 7786 events. 3990/7786 cut-off events. For 192236/192282 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 68193 event pairs, 1832 based on Foata normal form. 24/7443 useless extension candidates. Maximal degree in co-relation 56163. Up to 6727 conditions per place. [2024-06-27 22:50:56,995 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 438 selfloop transitions, 133 changer transitions 0/590 dead transitions. [2024-06-27 22:50:56,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 590 transitions, 13900 flow [2024-06-27 22:50:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:50:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:50:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-27 22:50:56,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 22:50:56,996 INFO L175 Difference]: Start difference. First operand has 367 places, 568 transitions, 12513 flow. Second operand 9 states and 145 transitions. [2024-06-27 22:50:56,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 590 transitions, 13900 flow [2024-06-27 22:50:58,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 590 transitions, 13505 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-06-27 22:50:58,316 INFO L231 Difference]: Finished difference. Result has 371 places, 569 transitions, 12470 flow [2024-06-27 22:50:58,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=12118, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12470, PETRI_PLACES=371, PETRI_TRANSITIONS=569} [2024-06-27 22:50:58,317 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 332 predicate places. [2024-06-27 22:50:58,317 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 569 transitions, 12470 flow [2024-06-27 22:50:58,317 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:50:58,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:58,317 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:50:58,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 22:50:58,317 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:50:58,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1365156179, now seen corresponding path program 11 times [2024-06-27 22:50:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666438141] [2024-06-27 22:50:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:59,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:50:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666438141] [2024-06-27 22:50:59,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666438141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:59,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:59,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:50:59,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759536482] [2024-06-27 22:50:59,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:59,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:50:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:50:59,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:51:00,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:51:00,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 569 transitions, 12470 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:51:00,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:00,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:51:00,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:02,262 INFO L124 PetriNetUnfolderBase]: 3997/7797 cut-off events. [2024-06-27 22:51:02,262 INFO L125 PetriNetUnfolderBase]: For 175938/175984 co-relation queries the response was YES. [2024-06-27 22:51:02,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56148 conditions, 7797 events. 3997/7797 cut-off events. For 175938/175984 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 68287 event pairs, 1764 based on Foata normal form. 24/7453 useless extension candidates. Maximal degree in co-relation 55977. Up to 6728 conditions per place. [2024-06-27 22:51:02,368 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 441 selfloop transitions, 139 changer transitions 0/599 dead transitions. [2024-06-27 22:51:02,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 599 transitions, 13873 flow [2024-06-27 22:51:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:51:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:51:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:51:02,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 22:51:02,370 INFO L175 Difference]: Start difference. First operand has 371 places, 569 transitions, 12470 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:51:02,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 599 transitions, 13873 flow [2024-06-27 22:51:03,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 599 transitions, 12812 flow, removed 54 selfloop flow, removed 48 redundant places. [2024-06-27 22:51:03,340 INFO L231 Difference]: Finished difference. Result has 334 places, 578 transitions, 11890 flow [2024-06-27 22:51:03,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=11278, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11890, PETRI_PLACES=334, PETRI_TRANSITIONS=578} [2024-06-27 22:51:03,340 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 295 predicate places. [2024-06-27 22:51:03,340 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 578 transitions, 11890 flow [2024-06-27 22:51:03,341 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:51:03,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:03,341 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:51:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 22:51:03,341 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:03,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash 893738737, now seen corresponding path program 1 times [2024-06-27 22:51:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003674102] [2024-06-27 22:51:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003674102] [2024-06-27 22:51:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003674102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:03,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:03,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:51:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182024545] [2024-06-27 22:51:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:51:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:51:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:51:03,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 22:51:03,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 578 transitions, 11890 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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:51:03,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:03,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 22:51:03,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:05,237 INFO L124 PetriNetUnfolderBase]: 3337/7060 cut-off events. [2024-06-27 22:51:05,238 INFO L125 PetriNetUnfolderBase]: For 110166/110259 co-relation queries the response was YES. [2024-06-27 22:51:05,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44420 conditions, 7060 events. 3337/7060 cut-off events. For 110166/110259 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 64054 event pairs, 438 based on Foata normal form. 706/7451 useless extension candidates. Maximal degree in co-relation 44288. Up to 2427 conditions per place. [2024-06-27 22:51:05,302 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 235 selfloop transitions, 158 changer transitions 0/511 dead transitions. [2024-06-27 22:51:05,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 511 transitions, 11675 flow [2024-06-27 22:51:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-27 22:51:05,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-27 22:51:05,303 INFO L175 Difference]: Start difference. First operand has 334 places, 578 transitions, 11890 flow. Second operand 5 states and 106 transitions. [2024-06-27 22:51:05,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 511 transitions, 11675 flow [2024-06-27 22:51:05,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 511 transitions, 9281 flow, removed 283 selfloop flow, removed 52 redundant places. [2024-06-27 22:51:05,841 INFO L231 Difference]: Finished difference. Result has 288 places, 502 transitions, 8934 flow [2024-06-27 22:51:05,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8449, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8934, PETRI_PLACES=288, PETRI_TRANSITIONS=502} [2024-06-27 22:51:05,841 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 249 predicate places. [2024-06-27 22:51:05,842 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 502 transitions, 8934 flow [2024-06-27 22:51:05,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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:51:05,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:05,842 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:51:05,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 22:51:05,842 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:05,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 146168246, now seen corresponding path program 1 times [2024-06-27 22:51:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314178900] [2024-06-27 22:51:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:06,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:51:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314178900] [2024-06-27 22:51:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314178900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:06,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:06,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:51:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148166437] [2024-06-27 22:51:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:06,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:51:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:51:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:51:06,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2024-06-27 22:51:06,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 502 transitions, 8934 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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:06,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:06,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2024-06-27 22:51:06,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:07,639 INFO L124 PetriNetUnfolderBase]: 2154/5438 cut-off events. [2024-06-27 22:51:07,639 INFO L125 PetriNetUnfolderBase]: For 40933/41004 co-relation queries the response was YES. [2024-06-27 22:51:07,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28773 conditions, 5438 events. 2154/5438 cut-off events. For 40933/41004 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 55290 event pairs, 644 based on Foata normal form. 47/4987 useless extension candidates. Maximal degree in co-relation 28677. Up to 1872 conditions per place. [2024-06-27 22:51:07,691 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 96 selfloop transitions, 124 changer transitions 142/533 dead transitions. [2024-06-27 22:51:07,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 533 transitions, 9729 flow [2024-06-27 22:51:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:51:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:51:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-06-27 22:51:07,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5742857142857143 [2024-06-27 22:51:07,692 INFO L175 Difference]: Start difference. First operand has 288 places, 502 transitions, 8934 flow. Second operand 10 states and 201 transitions. [2024-06-27 22:51:07,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 533 transitions, 9729 flow [2024-06-27 22:51:07,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 533 transitions, 9387 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:51:07,973 INFO L231 Difference]: Finished difference. Result has 296 places, 379 transitions, 6632 flow [2024-06-27 22:51:07,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8594, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6632, PETRI_PLACES=296, PETRI_TRANSITIONS=379} [2024-06-27 22:51:07,973 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 257 predicate places. [2024-06-27 22:51:07,974 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 379 transitions, 6632 flow [2024-06-27 22:51:07,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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:07,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:07,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:07,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 22:51:07,974 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:07,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1296648876, now seen corresponding path program 2 times [2024-06-27 22:51:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125305381] [2024-06-27 22:51:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:51:07,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:51:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:51:08,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:51:08,057 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:51:08,058 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:51:08,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 22:51:08,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:51:08,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:51:08,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:51:08,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:51:08,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 22:51:08,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 22:51:08,063 INFO L445 BasicCegarLoop]: Path program histogram: [18, 15, 11, 9, 9, 8, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:08,069 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:51:08,069 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:51:08,151 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:51:08,151 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:51:08,152 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:51:08 BasicIcfg [2024-06-27 22:51:08,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:51:08,153 INFO L158 Benchmark]: Toolchain (without parser) took 355006.48ms. Allocated memory was 180.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 108.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-06-27 22:51:08,153 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:51:08,153 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:51:08,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 731.12ms. Allocated memory is still 180.4MB. Free memory was 108.0MB in the beginning and 129.9MB in the end (delta: -21.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-06-27 22:51:08,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.24ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 123.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 22:51:08,154 INFO L158 Benchmark]: Boogie Preprocessor took 105.29ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 119.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:51:08,154 INFO L158 Benchmark]: RCFGBuilder took 914.34ms. Allocated memory is still 180.4MB. Free memory was 119.4MB in the beginning and 136.2MB in the end (delta: -16.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-06-27 22:51:08,155 INFO L158 Benchmark]: TraceAbstraction took 353140.77ms. Allocated memory was 180.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 135.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-06-27 22:51:08,155 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 731.12ms. Allocated memory is still 180.4MB. Free memory was 108.0MB in the beginning and 129.9MB in the end (delta: -21.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.24ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 123.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.29ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 119.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 914.34ms. Allocated memory is still 180.4MB. Free memory was 119.4MB in the beginning and 136.2MB in the end (delta: -16.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * TraceAbstraction took 353140.77ms. Allocated memory was 180.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 135.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.5GB. 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; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, 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] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, 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] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, 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] [L795] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 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_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_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) >= 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) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((2LL - (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) 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$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 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_used) >= 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_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL))); [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, t2010=-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] [L796] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 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_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_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) >= 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) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((2LL - (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) 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$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 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_used) >= 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_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-2, t2010=-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] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 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) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 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 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 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, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 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) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 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 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 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=1, __unbuffered_p1_EAX=1, arg={0: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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0: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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 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, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-2, t2010=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L823] 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, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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: 352.9s, OverallIterations: 109, TraceHistogramMax: 1, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 209.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5552 SdHoareTripleChecker+Valid, 34.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4703 mSDsluCounter, 2998 SdHoareTripleChecker+Invalid, 30.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2359 mSDsCounter, 1715 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39583 IncrementalHoareTripleChecker+Invalid, 41298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1715 mSolverCounterUnsat, 639 mSDtfsCounter, 39583 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 991 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16626occurred in iteration=59, InterpolantAutomatonStates: 939, 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, 1.7s SatisfiabilityAnalysisTime, 140.1s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1633 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 1500 ConstructedInterpolants, 0 QuantifiedInterpolants, 82690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 108 InterpolantComputations, 108 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:51:08,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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