./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe005_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe005_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 76401ed0 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe005_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 19:44:17,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:44:17,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:44:17,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:44:17,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:44:17,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:44:17,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:44:17,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:44:17,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:44:17,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:44:17,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:44:17,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:44:17,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:44:17,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:44:17,554 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:44:17,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:44:17,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:44:17,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:44:17,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:44:17,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:44:17,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:44:17,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:44:17,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:44:17,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:44:17,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:44:17,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:44:17,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:44:17,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:44:17,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:44:17,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:44:17,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:44:17,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:44:17,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:44:17,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:44:17,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:44:17,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:44:17,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:44:17,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:44:17,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:44:17,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:44:17,562 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:44:17,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:44:17,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:44:17,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 19:44:17,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:44:17,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:44:17,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:44:17,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:44:17,818 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:44:17,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-20 19:44:19,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:44:19,258 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:44:19,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-20 19:44:19,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5e8eef8/e1c6541902934478a64a52cea24559c5/FLAG4980c001c [2024-06-20 19:44:19,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5e8eef8/e1c6541902934478a64a52cea24559c5 [2024-06-20 19:44:19,295 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:44:19,296 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:44:19,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-20 19:44:19,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:44:19,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:44:19,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:44:19,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:44:19,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:44:19,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:44:19" (1/2) ... [2024-06-20 19:44:19,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8a2425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:44:19, skipping insertion in model container [2024-06-20 19:44:19,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:44:19" (1/2) ... [2024-06-20 19:44:19,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b1142ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:44:19, skipping insertion in model container [2024-06-20 19:44:19,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:44:19" (2/2) ... [2024-06-20 19:44:19,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8a2425 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:19, skipping insertion in model container [2024-06-20 19:44:19,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:44:19" (2/2) ... [2024-06-20 19:44:19,514 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:44:19,683 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:44:19,685 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-20 19:44:19,686 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-20 19:44:19,686 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-20 19:44:19,687 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:44:19,687 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-20 19:44:19,731 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:44:20,056 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:44:20,073 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:44:20,502 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:44:20,556 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:44:20,557 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20 WrapperNode [2024-06-20 19:44:20,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:44:20,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:44:20,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:44:20,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:44:20,565 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 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,615 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 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,748 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-06-20 19:44:20,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:44:20,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:44:20,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:44:20,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:44:20,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,843 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-20 19:44:20,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:44:20,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:44:20,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:44:20,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:44:20,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (1/1) ... [2024-06-20 19:44:20,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:44:20,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:44:20,973 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-20 19:44:20,996 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-20 19:44:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:44:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:44:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:44:21,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:44:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:44:21,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:44:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 19:44:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 19:44:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:44:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:44:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:44:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:44:21,018 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:44:21,146 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:44:21,149 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:44:22,568 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:44:22,570 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:44:22,882 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:44:22,882 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:44:22,883 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:44:22 BoogieIcfgContainer [2024-06-20 19:44:22,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:44:22,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:44:22,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:44:22,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:44:22,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:44:19" (1/4) ... [2024-06-20 19:44:22,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be0661e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:44:22, skipping insertion in model container [2024-06-20 19:44:22,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:44:19" (2/4) ... [2024-06-20 19:44:22,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be0661e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:44:22, skipping insertion in model container [2024-06-20 19:44:22,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:44:20" (3/4) ... [2024-06-20 19:44:22,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be0661e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:44:22, skipping insertion in model container [2024-06-20 19:44:22,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:44:22" (4/4) ... [2024-06-20 19:44:22,893 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-20 19:44:22,910 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:44:22,910 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 19:44:22,910 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:44:23,042 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:44:23,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 19:44:23,162 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-20 19:44:23,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:44:23,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:44:23,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 19:44:23,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-20 19:44:23,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:44:23,191 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;@5364cdf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:44:23,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 19:44:23,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:44:23,203 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:44:23,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:44:23,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:23,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:44:23,205 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:44:23,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 362811812, now seen corresponding path program 1 times [2024-06-20 19:44:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794971545] [2024-06-20 19:44:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:23,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:29,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794971545] [2024-06-20 19:44:29,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794971545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:29,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:29,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:44:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868269751] [2024-06-20 19:44:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:29,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:44:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:44:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:44:29,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-06-20 19:44:29,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:29,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:29,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-06-20 19:44:29,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:30,975 INFO L124 PetriNetUnfolderBase]: 942/1465 cut-off events. [2024-06-20 19:44:30,976 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-20 19:44:30,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1465 events. 942/1465 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7311 event pairs, 546 based on Foata normal form. 2/1427 useless extension candidates. Maximal degree in co-relation 2969. Up to 1428 conditions per place. [2024-06-20 19:44:30,992 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-20 19:44:30,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 171 flow [2024-06-20 19:44:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:44:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:44:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-20 19:44:31,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2024-06-20 19:44:31,005 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 80 transitions. [2024-06-20 19:44:31,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 171 flow [2024-06-20 19:44:31,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 19:44:31,010 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-20 19:44:31,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-20 19:44:31,014 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-20 19:44:31,015 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-20 19:44:31,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:31,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:31,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:31,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:44:31,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:44:31,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 769830979, now seen corresponding path program 1 times [2024-06-20 19:44:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205919953] [2024-06-20 19:44:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205919953] [2024-06-20 19:44:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205919953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:36,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:44:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193796903] [2024-06-20 19:44:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:36,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:44:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:36,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:44:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:44:36,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 19:44:36,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:36,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:36,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 19:44:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:37,215 INFO L124 PetriNetUnfolderBase]: 1344/2036 cut-off events. [2024-06-20 19:44:37,216 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2024-06-20 19:44:37,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2036 events. 1344/2036 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9751 event pairs, 792 based on Foata normal form. 3/2037 useless extension candidates. Maximal degree in co-relation 4672. Up to 1993 conditions per place. [2024-06-20 19:44:37,233 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 42 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-20 19:44:37,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 254 flow [2024-06-20 19:44:37,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:44:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:44:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-20 19:44:37,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2024-06-20 19:44:37,237 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 97 transitions. [2024-06-20 19:44:37,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 254 flow [2024-06-20 19:44:37,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:44:37,241 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 152 flow [2024-06-20 19:44:37,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-06-20 19:44:37,242 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-06-20 19:44:37,242 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 152 flow [2024-06-20 19:44:37,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:37,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:37,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:37,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:44:37,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:44:37,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1073228514, now seen corresponding path program 1 times [2024-06-20 19:44:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:37,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488664574] [2024-06-20 19:44:37,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488664574] [2024-06-20 19:44:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488664574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:43,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:44:43,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592569102] [2024-06-20 19:44:43,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:43,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:44:43,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:43,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:44:43,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:44:43,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 19:44:43,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:43,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:43,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 19:44:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:44,559 INFO L124 PetriNetUnfolderBase]: 1338/2027 cut-off events. [2024-06-20 19:44:44,560 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2024-06-20 19:44:44,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 2027 events. 1338/2027 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9814 event pairs, 646 based on Foata normal form. 3/2028 useless extension candidates. Maximal degree in co-relation 5190. Up to 1969 conditions per place. [2024-06-20 19:44:44,572 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-20 19:44:44,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 336 flow [2024-06-20 19:44:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:44:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:44:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-06-20 19:44:44,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5804878048780487 [2024-06-20 19:44:44,576 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 152 flow. Second operand 5 states and 119 transitions. [2024-06-20 19:44:44,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 336 flow [2024-06-20 19:44:44,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 334 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-20 19:44:44,578 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 198 flow [2024-06-20 19:44:44,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-20 19:44:44,579 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-06-20 19:44:44,580 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 198 flow [2024-06-20 19:44:44,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:44,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:44,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:44,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:44:44,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:44:44,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1617039464, now seen corresponding path program 1 times [2024-06-20 19:44:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154401513] [2024-06-20 19:44:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:53,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-20 19:44:53,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154401513] [2024-06-20 19:44:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154401513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:53,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:44:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369348302] [2024-06-20 19:44:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:53,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:44:53,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:53,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:44:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:44:53,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 19:44:53,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:53,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:53,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 19:44:53,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:54,230 INFO L124 PetriNetUnfolderBase]: 1038/1642 cut-off events. [2024-06-20 19:44:54,230 INFO L125 PetriNetUnfolderBase]: For 1667/1667 co-relation queries the response was YES. [2024-06-20 19:44:54,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 1642 events. 1038/1642 cut-off events. For 1667/1667 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8231 event pairs, 474 based on Foata normal form. 4/1592 useless extension candidates. Maximal degree in co-relation 4594. Up to 1525 conditions per place. [2024-06-20 19:44:54,240 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 42 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2024-06-20 19:44:54,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 356 flow [2024-06-20 19:44:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:44:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:44:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-06-20 19:44:54,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-20 19:44:54,244 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 198 flow. Second operand 5 states and 105 transitions. [2024-06-20 19:44:54,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 356 flow [2024-06-20 19:44:54,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 334 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-20 19:44:54,252 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 247 flow [2024-06-20 19:44:54,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-06-20 19:44:54,254 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-20 19:44:54,254 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 247 flow [2024-06-20 19:44:54,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:54,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:54,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:54,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:44:54,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:44:54,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash 580485505, now seen corresponding path program 1 times [2024-06-20 19:44:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:54,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611461300] [2024-06-20 19:44:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:54,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611461300] [2024-06-20 19:44:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611461300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:44:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065493018] [2024-06-20 19:44:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:59,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:44:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:44:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:44:59,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 19:44:59,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:59,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:59,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 19:44:59,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:01,147 INFO L124 PetriNetUnfolderBase]: 1323/2004 cut-off events. [2024-06-20 19:45:01,148 INFO L125 PetriNetUnfolderBase]: For 2854/2854 co-relation queries the response was YES. [2024-06-20 19:45:01,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6276 conditions, 2004 events. 1323/2004 cut-off events. For 2854/2854 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9531 event pairs, 467 based on Foata normal form. 6/2008 useless extension candidates. Maximal degree in co-relation 6255. Up to 1916 conditions per place. [2024-06-20 19:45:01,160 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 59 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2024-06-20 19:45:01,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 461 flow [2024-06-20 19:45:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:45:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:45:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-20 19:45:01,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.556910569105691 [2024-06-20 19:45:01,163 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 247 flow. Second operand 6 states and 137 transitions. [2024-06-20 19:45:01,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 461 flow [2024-06-20 19:45:01,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 448 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 19:45:01,171 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 275 flow [2024-06-20 19:45:01,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-20 19:45:01,173 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-06-20 19:45:01,174 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 275 flow [2024-06-20 19:45:01,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:01,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:01,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:45:01,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:45:01,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1411385553, now seen corresponding path program 1 times [2024-06-20 19:45:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850646979] [2024-06-20 19:45:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:08,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:08,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850646979] [2024-06-20 19:45:08,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850646979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:08,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:08,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:45:08,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485561980] [2024-06-20 19:45:08,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:08,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:45:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:08,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:45:08,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:45:09,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:45:09,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:09,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:09,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:45:09,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:10,143 INFO L124 PetriNetUnfolderBase]: 1378/2095 cut-off events. [2024-06-20 19:45:10,144 INFO L125 PetriNetUnfolderBase]: For 4215/4215 co-relation queries the response was YES. [2024-06-20 19:45:10,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6887 conditions, 2095 events. 1378/2095 cut-off events. For 4215/4215 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10103 event pairs, 516 based on Foata normal form. 6/2097 useless extension candidates. Maximal degree in co-relation 6864. Up to 1942 conditions per place. [2024-06-20 19:45:10,159 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 59 selfloop transitions, 16 changer transitions 0/80 dead transitions. [2024-06-20 19:45:10,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 541 flow [2024-06-20 19:45:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:45:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:45:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-20 19:45:10,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-20 19:45:10,160 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 275 flow. Second operand 6 states and 120 transitions. [2024-06-20 19:45:10,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 541 flow [2024-06-20 19:45:10,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 510 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-20 19:45:10,167 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 348 flow [2024-06-20 19:45:10,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2024-06-20 19:45:10,171 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-06-20 19:45:10,171 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 348 flow [2024-06-20 19:45:10,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:10,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:10,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:10,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:45:10,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:45:10,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1105961737, now seen corresponding path program 1 times [2024-06-20 19:45:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992856366] [2024-06-20 19:45:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:17,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-20 19:45:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992856366] [2024-06-20 19:45:17,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992856366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:17,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:17,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:45:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748315238] [2024-06-20 19:45:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:17,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:45:17,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:17,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:45:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:45:17,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:45:17,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:17,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:17,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:45:17,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:18,480 INFO L124 PetriNetUnfolderBase]: 1412/2162 cut-off events. [2024-06-20 19:45:18,481 INFO L125 PetriNetUnfolderBase]: For 6152/6152 co-relation queries the response was YES. [2024-06-20 19:45:18,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7934 conditions, 2162 events. 1412/2162 cut-off events. For 6152/6152 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10447 event pairs, 547 based on Foata normal form. 4/2164 useless extension candidates. Maximal degree in co-relation 7908. Up to 2069 conditions per place. [2024-06-20 19:45:18,496 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 69 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2024-06-20 19:45:18,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 632 flow [2024-06-20 19:45:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-20 19:45:18,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-20 19:45:18,498 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 348 flow. Second operand 7 states and 134 transitions. [2024-06-20 19:45:18,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 632 flow [2024-06-20 19:45:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 603 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-20 19:45:18,507 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 429 flow [2024-06-20 19:45:18,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2024-06-20 19:45:18,508 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-20 19:45:18,508 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 429 flow [2024-06-20 19:45:18,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:18,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:18,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:18,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:45:18,509 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:45:18,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1855848461, now seen corresponding path program 2 times [2024-06-20 19:45:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:18,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945560283] [2024-06-20 19:45:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:18,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945560283] [2024-06-20 19:45:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945560283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:26,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:45:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129013564] [2024-06-20 19:45:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:26,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:45:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:45:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:45:26,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:45:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:45:26,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:27,157 INFO L124 PetriNetUnfolderBase]: 1434/2199 cut-off events. [2024-06-20 19:45:27,157 INFO L125 PetriNetUnfolderBase]: For 7663/7663 co-relation queries the response was YES. [2024-06-20 19:45:27,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8317 conditions, 2199 events. 1434/2199 cut-off events. For 7663/7663 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10636 event pairs, 538 based on Foata normal form. 4/2201 useless extension candidates. Maximal degree in co-relation 8288. Up to 2083 conditions per place. [2024-06-20 19:45:27,171 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 67 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2024-06-20 19:45:27,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 683 flow [2024-06-20 19:45:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:45:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:45:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-20 19:45:27,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-20 19:45:27,177 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 429 flow. Second operand 6 states and 116 transitions. [2024-06-20 19:45:27,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 683 flow [2024-06-20 19:45:27,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 642 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:45:27,184 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 470 flow [2024-06-20 19:45:27,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2024-06-20 19:45:27,184 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-20 19:45:27,185 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 470 flow [2024-06-20 19:45:27,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:27,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:27,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:27,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:45:27,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:45:27,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1856085611, now seen corresponding path program 3 times [2024-06-20 19:45:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818911088] [2024-06-20 19:45:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:34,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:34,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818911088] [2024-06-20 19:45:34,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818911088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:34,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:34,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:45:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002483650] [2024-06-20 19:45:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:34,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:45:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:45:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:45:34,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:45:34,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:34,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:34,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:45:34,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:35,457 INFO L124 PetriNetUnfolderBase]: 1408/2163 cut-off events. [2024-06-20 19:45:35,458 INFO L125 PetriNetUnfolderBase]: For 9092/9092 co-relation queries the response was YES. [2024-06-20 19:45:35,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8361 conditions, 2163 events. 1408/2163 cut-off events. For 9092/9092 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10464 event pairs, 542 based on Foata normal form. 8/2165 useless extension candidates. Maximal degree in co-relation 8332. Up to 1948 conditions per place. [2024-06-20 19:45:35,471 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 61 selfloop transitions, 24 changer transitions 0/90 dead transitions. [2024-06-20 19:45:35,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 711 flow [2024-06-20 19:45:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:45:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:45:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-20 19:45:35,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2024-06-20 19:45:35,473 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 470 flow. Second operand 6 states and 118 transitions. [2024-06-20 19:45:35,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 711 flow [2024-06-20 19:45:35,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 655 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-20 19:45:35,481 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 505 flow [2024-06-20 19:45:35,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2024-06-20 19:45:35,482 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-20 19:45:35,482 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 505 flow [2024-06-20 19:45:35,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:35,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:35,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:35,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:45:35,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:45:35,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1856094539, now seen corresponding path program 1 times [2024-06-20 19:45:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390915766] [2024-06-20 19:45:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390915766] [2024-06-20 19:45:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390915766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:43,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:45:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223575839] [2024-06-20 19:45:43,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:43,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:45:43,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:43,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:45:43,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:45:43,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:45:43,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 505 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:43,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:43,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:45:43,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:44,550 INFO L124 PetriNetUnfolderBase]: 1414/2172 cut-off events. [2024-06-20 19:45:44,550 INFO L125 PetriNetUnfolderBase]: For 8928/8928 co-relation queries the response was YES. [2024-06-20 19:45:44,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8445 conditions, 2172 events. 1414/2172 cut-off events. For 8928/8928 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10532 event pairs, 501 based on Foata normal form. 4/2170 useless extension candidates. Maximal degree in co-relation 8414. Up to 1999 conditions per place. [2024-06-20 19:45:44,562 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 74 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2024-06-20 19:45:44,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 889 flow [2024-06-20 19:45:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:45:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:45:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-20 19:45:44,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-20 19:45:44,564 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 505 flow. Second operand 7 states and 134 transitions. [2024-06-20 19:45:44,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 889 flow [2024-06-20 19:45:44,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 107 transitions, 841 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-20 19:45:44,574 INFO L231 Difference]: Finished difference. Result has 76 places, 88 transitions, 692 flow [2024-06-20 19:45:44,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=692, PETRI_PLACES=76, PETRI_TRANSITIONS=88} [2024-06-20 19:45:44,575 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2024-06-20 19:45:44,575 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 88 transitions, 692 flow [2024-06-20 19:45:44,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:44,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:44,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:44,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:45:44,576 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:45:44,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1704357308, now seen corresponding path program 1 times [2024-06-20 19:45:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:44,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481693197] [2024-06-20 19:45:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:53,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-20 19:45:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481693197] [2024-06-20 19:45:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481693197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:45:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454320444] [2024-06-20 19:45:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:53,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:45:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:45:53,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:45:53,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:45:53,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 88 transitions, 692 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:53,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:53,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:45:53,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:54,734 INFO L124 PetriNetUnfolderBase]: 1526/2382 cut-off events. [2024-06-20 19:45:54,734 INFO L125 PetriNetUnfolderBase]: For 12147/12147 co-relation queries the response was YES. [2024-06-20 19:45:54,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 2382 events. 1526/2382 cut-off events. For 12147/12147 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11959 event pairs, 428 based on Foata normal form. 32/2406 useless extension candidates. Maximal degree in co-relation 9717. Up to 1882 conditions per place. [2024-06-20 19:45:54,748 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 73 selfloop transitions, 52 changer transitions 0/130 dead transitions. [2024-06-20 19:45:54,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 130 transitions, 1158 flow [2024-06-20 19:45:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:45:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:45:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-20 19:45:54,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060975609756098 [2024-06-20 19:45:54,752 INFO L175 Difference]: Start difference. First operand has 76 places, 88 transitions, 692 flow. Second operand 8 states and 166 transitions. [2024-06-20 19:45:54,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 130 transitions, 1158 flow [2024-06-20 19:45:54,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 130 transitions, 1106 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-20 19:45:54,766 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 928 flow [2024-06-20 19:45:54,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=928, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2024-06-20 19:45:54,767 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-20 19:45:54,767 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 928 flow [2024-06-20 19:45:54,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:54,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:54,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:54,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:45:54,768 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:45:54,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash 284173910, now seen corresponding path program 1 times [2024-06-20 19:45:54,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:54,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063219696] [2024-06-20 19:45:54,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:02,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063219696] [2024-06-20 19:46:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063219696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:02,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:46:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609808894] [2024-06-20 19:46:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:02,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:46:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:46:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:46:02,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:46:02,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 928 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:02,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:02,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:46:02,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:03,863 INFO L124 PetriNetUnfolderBase]: 1549/2421 cut-off events. [2024-06-20 19:46:03,863 INFO L125 PetriNetUnfolderBase]: For 18344/18344 co-relation queries the response was YES. [2024-06-20 19:46:03,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11573 conditions, 2421 events. 1549/2421 cut-off events. For 18344/18344 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12244 event pairs, 476 based on Foata normal form. 2/2421 useless extension candidates. Maximal degree in co-relation 11534. Up to 2284 conditions per place. [2024-06-20 19:46:03,878 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 109 selfloop transitions, 22 changer transitions 0/136 dead transitions. [2024-06-20 19:46:03,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 136 transitions, 1333 flow [2024-06-20 19:46:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:46:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:46:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-20 19:46:03,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46646341463414637 [2024-06-20 19:46:03,882 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 928 flow. Second operand 8 states and 153 transitions. [2024-06-20 19:46:03,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 136 transitions, 1333 flow [2024-06-20 19:46:03,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 136 transitions, 1284 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-20 19:46:03,909 INFO L231 Difference]: Finished difference. Result has 91 places, 109 transitions, 1009 flow [2024-06-20 19:46:03,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1009, PETRI_PLACES=91, PETRI_TRANSITIONS=109} [2024-06-20 19:46:03,910 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-20 19:46:03,910 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 109 transitions, 1009 flow [2024-06-20 19:46:03,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:03,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:03,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:03,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:46:03,911 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:46:03,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1799206254, now seen corresponding path program 2 times [2024-06-20 19:46:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:03,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660370446] [2024-06-20 19:46:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660370446] [2024-06-20 19:46:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660370446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:46:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235659142] [2024-06-20 19:46:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:11,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:46:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:11,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:46:11,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:46:11,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:46:11,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 109 transitions, 1009 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:11,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:11,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:46:11,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:13,000 INFO L124 PetriNetUnfolderBase]: 1522/2368 cut-off events. [2024-06-20 19:46:13,000 INFO L125 PetriNetUnfolderBase]: For 20218/20218 co-relation queries the response was YES. [2024-06-20 19:46:13,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11512 conditions, 2368 events. 1522/2368 cut-off events. For 20218/20218 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11786 event pairs, 462 based on Foata normal form. 2/2368 useless extension candidates. Maximal degree in co-relation 11470. Up to 2222 conditions per place. [2024-06-20 19:46:13,017 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 104 selfloop transitions, 23 changer transitions 0/132 dead transitions. [2024-06-20 19:46:13,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 132 transitions, 1343 flow [2024-06-20 19:46:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:46:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:46:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-20 19:46:13,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-20 19:46:13,021 INFO L175 Difference]: Start difference. First operand has 91 places, 109 transitions, 1009 flow. Second operand 7 states and 135 transitions. [2024-06-20 19:46:13,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 132 transitions, 1343 flow [2024-06-20 19:46:13,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 132 transitions, 1279 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-20 19:46:13,049 INFO L231 Difference]: Finished difference. Result has 93 places, 109 transitions, 1003 flow [2024-06-20 19:46:13,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1003, PETRI_PLACES=93, PETRI_TRANSITIONS=109} [2024-06-20 19:46:13,050 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-20 19:46:13,051 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 109 transitions, 1003 flow [2024-06-20 19:46:13,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:13,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:13,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:13,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:46:13,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:46:13,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1295162892, now seen corresponding path program 1 times [2024-06-20 19:46:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:13,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271184569] [2024-06-20 19:46:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271184569] [2024-06-20 19:46:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271184569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:46:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538894266] [2024-06-20 19:46:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:21,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:46:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:46:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:46:22,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:46:22,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 109 transitions, 1003 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:22,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:22,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:46:22,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:22,973 INFO L124 PetriNetUnfolderBase]: 1544/2403 cut-off events. [2024-06-20 19:46:22,973 INFO L125 PetriNetUnfolderBase]: For 22922/22922 co-relation queries the response was YES. [2024-06-20 19:46:22,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11835 conditions, 2403 events. 1544/2403 cut-off events. For 22922/22922 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11985 event pairs, 468 based on Foata normal form. 4/2401 useless extension candidates. Maximal degree in co-relation 11792. Up to 2147 conditions per place. [2024-06-20 19:46:22,986 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 93 selfloop transitions, 35 changer transitions 0/133 dead transitions. [2024-06-20 19:46:22,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 133 transitions, 1366 flow [2024-06-20 19:46:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:46:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:46:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-20 19:46:22,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738675958188153 [2024-06-20 19:46:22,987 INFO L175 Difference]: Start difference. First operand has 93 places, 109 transitions, 1003 flow. Second operand 7 states and 136 transitions. [2024-06-20 19:46:22,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 133 transitions, 1366 flow [2024-06-20 19:46:23,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 1285 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:46:23,014 INFO L231 Difference]: Finished difference. Result has 94 places, 113 transitions, 1044 flow [2024-06-20 19:46:23,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1044, PETRI_PLACES=94, PETRI_TRANSITIONS=113} [2024-06-20 19:46:23,015 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-20 19:46:23,015 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 113 transitions, 1044 flow [2024-06-20 19:46:23,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:23,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:23,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:23,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:46:23,016 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:46:23,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1295459562, now seen corresponding path program 2 times [2024-06-20 19:46:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:23,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550285506] [2024-06-20 19:46:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:31,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550285506] [2024-06-20 19:46:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550285506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:31,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:46:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090984461] [2024-06-20 19:46:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:31,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:46:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:46:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:46:31,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:46:31,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 113 transitions, 1044 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:31,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:31,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:46:31,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:32,842 INFO L124 PetriNetUnfolderBase]: 1550/2407 cut-off events. [2024-06-20 19:46:32,842 INFO L125 PetriNetUnfolderBase]: For 23239/23239 co-relation queries the response was YES. [2024-06-20 19:46:32,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12264 conditions, 2407 events. 1550/2407 cut-off events. For 23239/23239 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12007 event pairs, 457 based on Foata normal form. 2/2403 useless extension candidates. Maximal degree in co-relation 12220. Up to 2120 conditions per place. [2024-06-20 19:46:32,855 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 93 selfloop transitions, 45 changer transitions 0/143 dead transitions. [2024-06-20 19:46:32,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 143 transitions, 1460 flow [2024-06-20 19:46:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:46:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:46:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-20 19:46:32,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725609756097561 [2024-06-20 19:46:32,859 INFO L175 Difference]: Start difference. First operand has 94 places, 113 transitions, 1044 flow. Second operand 8 states and 155 transitions. [2024-06-20 19:46:32,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 143 transitions, 1460 flow [2024-06-20 19:46:32,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 143 transitions, 1370 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 19:46:32,885 INFO L231 Difference]: Finished difference. Result has 98 places, 119 transitions, 1132 flow [2024-06-20 19:46:32,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1132, PETRI_PLACES=98, PETRI_TRANSITIONS=119} [2024-06-20 19:46:32,886 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-20 19:46:32,886 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 1132 flow [2024-06-20 19:46:32,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:32,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:32,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:32,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:46:32,887 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:46:32,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2056858795, now seen corresponding path program 1 times [2024-06-20 19:46:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278994181] [2024-06-20 19:46:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:45,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278994181] [2024-06-20 19:46:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278994181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:45,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:45,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:46:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626743361] [2024-06-20 19:46:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:45,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:46:45,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:46:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:46:45,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:46:45,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 1132 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:45,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:45,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:46:45,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:46,572 INFO L124 PetriNetUnfolderBase]: 1560/2427 cut-off events. [2024-06-20 19:46:46,572 INFO L125 PetriNetUnfolderBase]: For 26172/26172 co-relation queries the response was YES. [2024-06-20 19:46:46,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12836 conditions, 2427 events. 1560/2427 cut-off events. For 26172/26172 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12140 event pairs, 449 based on Foata normal form. 2/2427 useless extension candidates. Maximal degree in co-relation 12790. Up to 2271 conditions per place. [2024-06-20 19:46:46,583 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 117 selfloop transitions, 23 changer transitions 0/145 dead transitions. [2024-06-20 19:46:46,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 145 transitions, 1580 flow [2024-06-20 19:46:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:46:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:46:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-20 19:46:46,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-20 19:46:46,585 INFO L175 Difference]: Start difference. First operand has 98 places, 119 transitions, 1132 flow. Second operand 6 states and 116 transitions. [2024-06-20 19:46:46,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 145 transitions, 1580 flow [2024-06-20 19:46:46,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 145 transitions, 1489 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 19:46:46,615 INFO L231 Difference]: Finished difference. Result has 100 places, 128 transitions, 1176 flow [2024-06-20 19:46:46,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1176, PETRI_PLACES=100, PETRI_TRANSITIONS=128} [2024-06-20 19:46:46,615 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-06-20 19:46:46,615 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 128 transitions, 1176 flow [2024-06-20 19:46:46,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:46,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:46,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:46,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:46:46,616 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:46:46,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1495345435, now seen corresponding path program 1 times [2024-06-20 19:46:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699323217] [2024-06-20 19:46:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:46:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:46:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:46:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699323217] [2024-06-20 19:46:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699323217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:46:55,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:46:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:46:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032683637] [2024-06-20 19:46:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:46:55,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:46:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:46:55,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:46:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:46:56,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:46:56,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 128 transitions, 1176 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:56,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:46:56,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:46:56,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:46:57,208 INFO L124 PetriNetUnfolderBase]: 1669/2600 cut-off events. [2024-06-20 19:46:57,208 INFO L125 PetriNetUnfolderBase]: For 33154/33154 co-relation queries the response was YES. [2024-06-20 19:46:57,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13953 conditions, 2600 events. 1669/2600 cut-off events. For 33154/33154 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13160 event pairs, 473 based on Foata normal form. 28/2618 useless extension candidates. Maximal degree in co-relation 13905. Up to 2135 conditions per place. [2024-06-20 19:46:57,223 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 106 selfloop transitions, 49 changer transitions 0/160 dead transitions. [2024-06-20 19:46:57,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 160 transitions, 1641 flow [2024-06-20 19:46:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:46:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:46:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-20 19:46:57,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-20 19:46:57,226 INFO L175 Difference]: Start difference. First operand has 100 places, 128 transitions, 1176 flow. Second operand 8 states and 159 transitions. [2024-06-20 19:46:57,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 160 transitions, 1641 flow [2024-06-20 19:46:57,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 160 transitions, 1627 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-20 19:46:57,251 INFO L231 Difference]: Finished difference. Result has 107 places, 131 transitions, 1312 flow [2024-06-20 19:46:57,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1312, PETRI_PLACES=107, PETRI_TRANSITIONS=131} [2024-06-20 19:46:57,252 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-20 19:46:57,252 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 131 transitions, 1312 flow [2024-06-20 19:46:57,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:46:57,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:46:57,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:46:57,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:46:57,253 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:46:57,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:46:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1504542205, now seen corresponding path program 2 times [2024-06-20 19:46:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:46:57,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025147806] [2024-06-20 19:46:57,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:46:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:46:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:06,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025147806] [2024-06-20 19:47:06,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025147806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:06,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:06,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444575853] [2024-06-20 19:47:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:06,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:06,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:06,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:47:06,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 131 transitions, 1312 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:06,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:06,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:47:06,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:07,266 INFO L124 PetriNetUnfolderBase]: 1686/2641 cut-off events. [2024-06-20 19:47:07,266 INFO L125 PetriNetUnfolderBase]: For 34964/34964 co-relation queries the response was YES. [2024-06-20 19:47:07,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14804 conditions, 2641 events. 1686/2641 cut-off events. For 34964/34964 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13491 event pairs, 476 based on Foata normal form. 4/2639 useless extension candidates. Maximal degree in co-relation 14753. Up to 2400 conditions per place. [2024-06-20 19:47:07,282 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 123 selfloop transitions, 31 changer transitions 0/159 dead transitions. [2024-06-20 19:47:07,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 159 transitions, 1753 flow [2024-06-20 19:47:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-20 19:47:07,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-20 19:47:07,285 INFO L175 Difference]: Start difference. First operand has 107 places, 131 transitions, 1312 flow. Second operand 8 states and 150 transitions. [2024-06-20 19:47:07,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 159 transitions, 1753 flow [2024-06-20 19:47:07,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 159 transitions, 1644 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:47:07,313 INFO L231 Difference]: Finished difference. Result has 110 places, 135 transitions, 1338 flow [2024-06-20 19:47:07,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1338, PETRI_PLACES=110, PETRI_TRANSITIONS=135} [2024-06-20 19:47:07,314 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-20 19:47:07,314 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 135 transitions, 1338 flow [2024-06-20 19:47:07,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:07,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:07,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:07,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:47:07,315 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:07,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1504551505, now seen corresponding path program 3 times [2024-06-20 19:47:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:07,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397716462] [2024-06-20 19:47:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:16,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397716462] [2024-06-20 19:47:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397716462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:16,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:16,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19562808] [2024-06-20 19:47:16,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:16,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:16,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:16,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:47:16,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 135 transitions, 1338 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:16,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:16,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:47:16,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:17,667 INFO L124 PetriNetUnfolderBase]: 1678/2634 cut-off events. [2024-06-20 19:47:17,667 INFO L125 PetriNetUnfolderBase]: For 37724/37724 co-relation queries the response was YES. [2024-06-20 19:47:17,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14901 conditions, 2634 events. 1678/2634 cut-off events. For 37724/37724 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13526 event pairs, 432 based on Foata normal form. 4/2632 useless extension candidates. Maximal degree in co-relation 14848. Up to 2311 conditions per place. [2024-06-20 19:47:17,683 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 122 selfloop transitions, 37 changer transitions 0/164 dead transitions. [2024-06-20 19:47:17,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 164 transitions, 1803 flow [2024-06-20 19:47:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-20 19:47:17,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-20 19:47:17,686 INFO L175 Difference]: Start difference. First operand has 110 places, 135 transitions, 1338 flow. Second operand 8 states and 151 transitions. [2024-06-20 19:47:17,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 164 transitions, 1803 flow [2024-06-20 19:47:17,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 164 transitions, 1711 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-20 19:47:17,718 INFO L231 Difference]: Finished difference. Result has 114 places, 139 transitions, 1406 flow [2024-06-20 19:47:17,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1406, PETRI_PLACES=114, PETRI_TRANSITIONS=139} [2024-06-20 19:47:17,718 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-20 19:47:17,718 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 139 transitions, 1406 flow [2024-06-20 19:47:17,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:17,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:17,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:17,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:47:17,719 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:17,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash -28165203, now seen corresponding path program 2 times [2024-06-20 19:47:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759143748] [2024-06-20 19:47:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:17,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:29,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759143748] [2024-06-20 19:47:29,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759143748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:29,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:29,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:47:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267346573] [2024-06-20 19:47:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:29,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:47:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:29,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:47:29,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:47:29,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:47:29,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 139 transitions, 1406 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-20 19:47:29,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:29,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:47:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:30,749 INFO L124 PetriNetUnfolderBase]: 1692/2655 cut-off events. [2024-06-20 19:47:30,749 INFO L125 PetriNetUnfolderBase]: For 41534/41534 co-relation queries the response was YES. [2024-06-20 19:47:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15358 conditions, 2655 events. 1692/2655 cut-off events. For 41534/41534 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13638 event pairs, 470 based on Foata normal form. 6/2659 useless extension candidates. Maximal degree in co-relation 15303. Up to 2478 conditions per place. [2024-06-20 19:47:30,769 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 125 selfloop transitions, 27 changer transitions 0/157 dead transitions. [2024-06-20 19:47:30,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 157 transitions, 1808 flow [2024-06-20 19:47:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:47:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:47:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-06-20 19:47:30,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073170731707317 [2024-06-20 19:47:30,771 INFO L175 Difference]: Start difference. First operand has 114 places, 139 transitions, 1406 flow. Second operand 5 states and 104 transitions. [2024-06-20 19:47:30,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 157 transitions, 1808 flow [2024-06-20 19:47:30,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 157 transitions, 1691 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-20 19:47:30,810 INFO L231 Difference]: Finished difference. Result has 114 places, 142 transitions, 1401 flow [2024-06-20 19:47:30,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1401, PETRI_PLACES=114, PETRI_TRANSITIONS=142} [2024-06-20 19:47:30,810 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-20 19:47:30,810 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 142 transitions, 1401 flow [2024-06-20 19:47:30,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-20 19:47:30,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:30,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:30,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:47:30,811 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:30,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1483899493, now seen corresponding path program 1 times [2024-06-20 19:47:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:30,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671729984] [2024-06-20 19:47:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671729984] [2024-06-20 19:47:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671729984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:39,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:39,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225395637] [2024-06-20 19:47:39,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:39,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:39,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:39,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:39,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:47:39,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 142 transitions, 1401 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:39,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:39,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:47:39,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:40,719 INFO L124 PetriNetUnfolderBase]: 1709/2683 cut-off events. [2024-06-20 19:47:40,720 INFO L125 PetriNetUnfolderBase]: For 44474/44474 co-relation queries the response was YES. [2024-06-20 19:47:40,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15734 conditions, 2683 events. 1709/2683 cut-off events. For 44474/44474 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13854 event pairs, 308 based on Foata normal form. 4/2685 useless extension candidates. Maximal degree in co-relation 15678. Up to 2477 conditions per place. [2024-06-20 19:47:40,779 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 147 selfloop transitions, 21 changer transitions 0/173 dead transitions. [2024-06-20 19:47:40,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 173 transitions, 1867 flow [2024-06-20 19:47:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 19:47:40,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 19:47:40,781 INFO L175 Difference]: Start difference. First operand has 114 places, 142 transitions, 1401 flow. Second operand 8 states and 152 transitions. [2024-06-20 19:47:40,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 173 transitions, 1867 flow [2024-06-20 19:47:40,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 173 transitions, 1825 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 19:47:40,812 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 1444 flow [2024-06-20 19:47:40,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1444, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2024-06-20 19:47:40,813 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-20 19:47:40,813 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 1444 flow [2024-06-20 19:47:40,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:40,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:40,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:40,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:47:40,814 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:40,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 943338711, now seen corresponding path program 2 times [2024-06-20 19:47:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960615480] [2024-06-20 19:47:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:48,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-20 19:47:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960615480] [2024-06-20 19:47:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960615480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:48,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249468439] [2024-06-20 19:47:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:48,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:48,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:47:48,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 1444 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:48,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:48,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:47:48,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:49,887 INFO L124 PetriNetUnfolderBase]: 1726/2713 cut-off events. [2024-06-20 19:47:49,887 INFO L125 PetriNetUnfolderBase]: For 48583/48583 co-relation queries the response was YES. [2024-06-20 19:47:49,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16193 conditions, 2713 events. 1726/2713 cut-off events. For 48583/48583 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13994 event pairs, 429 based on Foata normal form. 4/2715 useless extension candidates. Maximal degree in co-relation 16136. Up to 2522 conditions per place. [2024-06-20 19:47:49,902 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 144 selfloop transitions, 25 changer transitions 0/174 dead transitions. [2024-06-20 19:47:49,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 174 transitions, 1914 flow [2024-06-20 19:47:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 19:47:49,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 19:47:49,908 INFO L175 Difference]: Start difference. First operand has 119 places, 144 transitions, 1444 flow. Second operand 8 states and 152 transitions. [2024-06-20 19:47:49,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 174 transitions, 1914 flow [2024-06-20 19:47:49,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 174 transitions, 1847 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:47:49,947 INFO L231 Difference]: Finished difference. Result has 121 places, 146 transitions, 1475 flow [2024-06-20 19:47:49,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1475, PETRI_PLACES=121, PETRI_TRANSITIONS=146} [2024-06-20 19:47:49,948 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-20 19:47:49,949 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 1475 flow [2024-06-20 19:47:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:49,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:49,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:49,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:47:49,949 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:49,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash -226864693, now seen corresponding path program 3 times [2024-06-20 19:47:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48990963] [2024-06-20 19:47:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:47:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:47:58,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:47:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48990963] [2024-06-20 19:47:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48990963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:47:58,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:47:58,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:47:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630422018] [2024-06-20 19:47:58,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:47:58,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:47:58,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:47:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:47:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:47:58,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:47:58,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 1475 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:58,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:47:58,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:47:58,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:47:59,764 INFO L124 PetriNetUnfolderBase]: 1718/2701 cut-off events. [2024-06-20 19:47:59,764 INFO L125 PetriNetUnfolderBase]: For 52079/52079 co-relation queries the response was YES. [2024-06-20 19:47:59,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16283 conditions, 2701 events. 1718/2701 cut-off events. For 52079/52079 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13953 event pairs, 430 based on Foata normal form. 4/2703 useless extension candidates. Maximal degree in co-relation 16225. Up to 2518 conditions per place. [2024-06-20 19:47:59,782 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 146 selfloop transitions, 24 changer transitions 0/175 dead transitions. [2024-06-20 19:47:59,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 175 transitions, 1950 flow [2024-06-20 19:47:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:47:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:47:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 19:47:59,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 19:47:59,785 INFO L175 Difference]: Start difference. First operand has 121 places, 146 transitions, 1475 flow. Second operand 8 states and 149 transitions. [2024-06-20 19:47:59,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 175 transitions, 1950 flow [2024-06-20 19:47:59,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 1872 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-20 19:47:59,831 INFO L231 Difference]: Finished difference. Result has 124 places, 149 transitions, 1511 flow [2024-06-20 19:47:59,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1511, PETRI_PLACES=124, PETRI_TRANSITIONS=149} [2024-06-20 19:47:59,831 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2024-06-20 19:47:59,831 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 149 transitions, 1511 flow [2024-06-20 19:47:59,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:47:59,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:47:59,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:47:59,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:47:59,832 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:47:59,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:47:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2122251089, now seen corresponding path program 1 times [2024-06-20 19:47:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:47:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765166965] [2024-06-20 19:47:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:47:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:47:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765166965] [2024-06-20 19:48:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765166965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:10,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:48:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545012749] [2024-06-20 19:48:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:10,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:48:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:48:10,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:48:10,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 19:48:10,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 149 transitions, 1511 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:10,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:10,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 19:48:10,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:12,005 INFO L124 PetriNetUnfolderBase]: 1740/2741 cut-off events. [2024-06-20 19:48:12,005 INFO L125 PetriNetUnfolderBase]: For 56033/56033 co-relation queries the response was YES. [2024-06-20 19:48:12,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16740 conditions, 2741 events. 1740/2741 cut-off events. For 56033/56033 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14250 event pairs, 435 based on Foata normal form. 2/2737 useless extension candidates. Maximal degree in co-relation 16680. Up to 2431 conditions per place. [2024-06-20 19:48:12,022 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 128 selfloop transitions, 49 changer transitions 0/182 dead transitions. [2024-06-20 19:48:12,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 182 transitions, 2051 flow [2024-06-20 19:48:12,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:48:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:48:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-20 19:48:12,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-20 19:48:12,026 INFO L175 Difference]: Start difference. First operand has 124 places, 149 transitions, 1511 flow. Second operand 9 states and 180 transitions. [2024-06-20 19:48:12,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 182 transitions, 2051 flow [2024-06-20 19:48:12,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 182 transitions, 1965 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-20 19:48:12,071 INFO L231 Difference]: Finished difference. Result has 128 places, 155 transitions, 1627 flow [2024-06-20 19:48:12,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1627, PETRI_PLACES=128, PETRI_TRANSITIONS=155} [2024-06-20 19:48:12,072 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-20 19:48:12,072 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 155 transitions, 1627 flow [2024-06-20 19:48:12,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:12,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:12,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:12,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:48:12,073 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:12,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -661885284, now seen corresponding path program 1 times [2024-06-20 19:48:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:12,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447920847] [2024-06-20 19:48:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447920847] [2024-06-20 19:48:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447920847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:25,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:48:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351604447] [2024-06-20 19:48:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:25,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:48:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:48:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:48:25,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:48:25,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 155 transitions, 1627 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:25,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:25,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:48:25,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:26,930 INFO L124 PetriNetUnfolderBase]: 1760/2771 cut-off events. [2024-06-20 19:48:26,930 INFO L125 PetriNetUnfolderBase]: For 61265/61265 co-relation queries the response was YES. [2024-06-20 19:48:26,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17374 conditions, 2771 events. 1760/2771 cut-off events. For 61265/61265 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14416 event pairs, 434 based on Foata normal form. 4/2773 useless extension candidates. Maximal degree in co-relation 17313. Up to 2528 conditions per place. [2024-06-20 19:48:26,949 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 142 selfloop transitions, 35 changer transitions 0/182 dead transitions. [2024-06-20 19:48:26,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 182 transitions, 2219 flow [2024-06-20 19:48:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:48:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:48:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-20 19:48:26,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738675958188153 [2024-06-20 19:48:26,950 INFO L175 Difference]: Start difference. First operand has 128 places, 155 transitions, 1627 flow. Second operand 7 states and 136 transitions. [2024-06-20 19:48:26,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 182 transitions, 2219 flow [2024-06-20 19:48:26,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 182 transitions, 2077 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-20 19:48:26,995 INFO L231 Difference]: Finished difference. Result has 129 places, 161 transitions, 1643 flow [2024-06-20 19:48:26,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1643, PETRI_PLACES=129, PETRI_TRANSITIONS=161} [2024-06-20 19:48:26,995 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-20 19:48:26,995 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 161 transitions, 1643 flow [2024-06-20 19:48:26,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:26,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:26,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:26,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:48:26,996 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:26,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash -603839351, now seen corresponding path program 2 times [2024-06-20 19:48:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407400036] [2024-06-20 19:48:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:34,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407400036] [2024-06-20 19:48:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407400036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:34,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:34,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:48:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974579602] [2024-06-20 19:48:34,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:34,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:48:34,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:34,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:48:34,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:48:34,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:48:34,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 161 transitions, 1643 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:34,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:34,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:48:34,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:36,139 INFO L124 PetriNetUnfolderBase]: 1771/2786 cut-off events. [2024-06-20 19:48:36,139 INFO L125 PetriNetUnfolderBase]: For 65911/65911 co-relation queries the response was YES. [2024-06-20 19:48:36,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17768 conditions, 2786 events. 1771/2786 cut-off events. For 65911/65911 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14523 event pairs, 441 based on Foata normal form. 2/2778 useless extension candidates. Maximal degree in co-relation 17706. Up to 2361 conditions per place. [2024-06-20 19:48:36,161 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 120 selfloop transitions, 67 changer transitions 0/192 dead transitions. [2024-06-20 19:48:36,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 192 transitions, 2317 flow [2024-06-20 19:48:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:48:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:48:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-20 19:48:36,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725609756097561 [2024-06-20 19:48:36,164 INFO L175 Difference]: Start difference. First operand has 129 places, 161 transitions, 1643 flow. Second operand 8 states and 155 transitions. [2024-06-20 19:48:36,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 192 transitions, 2317 flow [2024-06-20 19:48:36,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 192 transitions, 2270 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-20 19:48:36,219 INFO L231 Difference]: Finished difference. Result has 134 places, 167 transitions, 1864 flow [2024-06-20 19:48:36,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1864, PETRI_PLACES=134, PETRI_TRANSITIONS=167} [2024-06-20 19:48:36,220 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-20 19:48:36,220 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 167 transitions, 1864 flow [2024-06-20 19:48:36,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:36,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:36,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:36,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:48:36,220 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:36,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:36,221 INFO L85 PathProgramCache]: Analyzing trace with hash -888939221, now seen corresponding path program 3 times [2024-06-20 19:48:36,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721802123] [2024-06-20 19:48:36,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:36,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:48:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:48:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:48:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721802123] [2024-06-20 19:48:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721802123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:48:45,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:48:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:48:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183694735] [2024-06-20 19:48:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:48:45,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:48:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:48:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:48:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:48:46,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:48:46,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 167 transitions, 1864 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:46,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:48:46,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:48:46,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:48:47,295 INFO L124 PetriNetUnfolderBase]: 1766/2779 cut-off events. [2024-06-20 19:48:47,295 INFO L125 PetriNetUnfolderBase]: For 71429/71429 co-relation queries the response was YES. [2024-06-20 19:48:47,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18275 conditions, 2779 events. 1766/2779 cut-off events. For 71429/71429 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14435 event pairs, 441 based on Foata normal form. 2/2771 useless extension candidates. Maximal degree in co-relation 18211. Up to 2424 conditions per place. [2024-06-20 19:48:47,312 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 131 selfloop transitions, 54 changer transitions 0/190 dead transitions. [2024-06-20 19:48:47,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 190 transitions, 2316 flow [2024-06-20 19:48:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:48:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:48:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-20 19:48:47,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-20 19:48:47,315 INFO L175 Difference]: Start difference. First operand has 134 places, 167 transitions, 1864 flow. Second operand 8 states and 154 transitions. [2024-06-20 19:48:47,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 190 transitions, 2316 flow [2024-06-20 19:48:47,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 190 transitions, 2183 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-20 19:48:47,385 INFO L231 Difference]: Finished difference. Result has 138 places, 167 transitions, 1847 flow [2024-06-20 19:48:47,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1847, PETRI_PLACES=138, PETRI_TRANSITIONS=167} [2024-06-20 19:48:47,385 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2024-06-20 19:48:47,386 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 167 transitions, 1847 flow [2024-06-20 19:48:47,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:48:47,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:48:47,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:48:47,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:48:47,386 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:48:47,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:48:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash -452198052, now seen corresponding path program 2 times [2024-06-20 19:48:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:48:47,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732179213] [2024-06-20 19:48:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:48:47,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:48:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:01,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-20 19:49:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732179213] [2024-06-20 19:49:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732179213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:01,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:01,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043350069] [2024-06-20 19:49:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:01,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:01,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:01,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:01,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:49:01,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 167 transitions, 1847 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:01,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:01,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:49:01,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:02,384 INFO L124 PetriNetUnfolderBase]: 1754/2769 cut-off events. [2024-06-20 19:49:02,385 INFO L125 PetriNetUnfolderBase]: For 73689/73689 co-relation queries the response was YES. [2024-06-20 19:49:02,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18299 conditions, 2769 events. 1754/2769 cut-off events. For 73689/73689 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14430 event pairs, 431 based on Foata normal form. 4/2771 useless extension candidates. Maximal degree in co-relation 18233. Up to 2557 conditions per place. [2024-06-20 19:49:02,406 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 150 selfloop transitions, 30 changer transitions 0/185 dead transitions. [2024-06-20 19:49:02,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 185 transitions, 2299 flow [2024-06-20 19:49:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:49:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:49:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-20 19:49:02,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-20 19:49:02,407 INFO L175 Difference]: Start difference. First operand has 138 places, 167 transitions, 1847 flow. Second operand 6 states and 120 transitions. [2024-06-20 19:49:02,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 185 transitions, 2299 flow [2024-06-20 19:49:02,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 185 transitions, 2133 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 19:49:02,484 INFO L231 Difference]: Finished difference. Result has 137 places, 167 transitions, 1747 flow [2024-06-20 19:49:02,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1747, PETRI_PLACES=137, PETRI_TRANSITIONS=167} [2024-06-20 19:49:02,485 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-20 19:49:02,485 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 167 transitions, 1747 flow [2024-06-20 19:49:02,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:02,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:02,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:02,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:49:02,486 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:02,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash -629234464, now seen corresponding path program 1 times [2024-06-20 19:49:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178629541] [2024-06-20 19:49:02,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178629541] [2024-06-20 19:49:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178629541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:12,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085235571] [2024-06-20 19:49:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:12,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:12,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:49:12,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 167 transitions, 1747 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:12,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:12,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:49:12,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:13,681 INFO L124 PetriNetUnfolderBase]: 1801/2828 cut-off events. [2024-06-20 19:49:13,681 INFO L125 PetriNetUnfolderBase]: For 77952/77952 co-relation queries the response was YES. [2024-06-20 19:49:13,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18705 conditions, 2828 events. 1801/2828 cut-off events. For 77952/77952 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14677 event pairs, 433 based on Foata normal form. 3/2825 useless extension candidates. Maximal degree in co-relation 18638. Up to 2471 conditions per place. [2024-06-20 19:49:13,699 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 154 selfloop transitions, 48 changer transitions 0/207 dead transitions. [2024-06-20 19:49:13,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 207 transitions, 2575 flow [2024-06-20 19:49:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:49:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:49:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-20 19:49:13,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808362369337979 [2024-06-20 19:49:13,701 INFO L175 Difference]: Start difference. First operand has 137 places, 167 transitions, 1747 flow. Second operand 7 states and 138 transitions. [2024-06-20 19:49:13,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 207 transitions, 2575 flow [2024-06-20 19:49:13,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 207 transitions, 2475 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-20 19:49:13,768 INFO L231 Difference]: Finished difference. Result has 141 places, 185 transitions, 2005 flow [2024-06-20 19:49:13,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2005, PETRI_PLACES=141, PETRI_TRANSITIONS=185} [2024-06-20 19:49:13,769 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2024-06-20 19:49:13,769 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 185 transitions, 2005 flow [2024-06-20 19:49:13,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:13,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:13,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:13,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:49:13,770 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:13,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash -460196002, now seen corresponding path program 2 times [2024-06-20 19:49:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331030128] [2024-06-20 19:49:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331030128] [2024-06-20 19:49:23,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331030128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:23,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078821606] [2024-06-20 19:49:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:24,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:49:24,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 185 transitions, 2005 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:24,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:24,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:49:24,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:25,280 INFO L124 PetriNetUnfolderBase]: 1969/3092 cut-off events. [2024-06-20 19:49:25,280 INFO L125 PetriNetUnfolderBase]: For 93798/93798 co-relation queries the response was YES. [2024-06-20 19:49:25,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21481 conditions, 3092 events. 1969/3092 cut-off events. For 93798/93798 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16364 event pairs, 440 based on Foata normal form. 9/3099 useless extension candidates. Maximal degree in co-relation 21411. Up to 2798 conditions per place. [2024-06-20 19:49:25,302 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 187 selfloop transitions, 36 changer transitions 0/228 dead transitions. [2024-06-20 19:49:25,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 228 transitions, 2875 flow [2024-06-20 19:49:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:49:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:49:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 19:49:25,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 19:49:25,303 INFO L175 Difference]: Start difference. First operand has 141 places, 185 transitions, 2005 flow. Second operand 8 states and 152 transitions. [2024-06-20 19:49:25,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 228 transitions, 2875 flow [2024-06-20 19:49:25,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 228 transitions, 2793 flow, removed 40 selfloop flow, removed 1 redundant places. [2024-06-20 19:49:25,398 INFO L231 Difference]: Finished difference. Result has 149 places, 205 transitions, 2298 flow [2024-06-20 19:49:25,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2298, PETRI_PLACES=149, PETRI_TRANSITIONS=205} [2024-06-20 19:49:25,399 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-20 19:49:25,399 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 205 transitions, 2298 flow [2024-06-20 19:49:25,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:25,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:25,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:25,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:49:25,399 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:25,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash -10476832, now seen corresponding path program 3 times [2024-06-20 19:49:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148795700] [2024-06-20 19:49:25,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148795700] [2024-06-20 19:49:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148795700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:35,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:35,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:35,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49248260] [2024-06-20 19:49:35,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:35,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:35,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:35,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:35,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:35,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:49:35,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 205 transitions, 2298 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:35,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:35,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:49:35,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:36,574 INFO L124 PetriNetUnfolderBase]: 2124/3323 cut-off events. [2024-06-20 19:49:36,575 INFO L125 PetriNetUnfolderBase]: For 106389/106389 co-relation queries the response was YES. [2024-06-20 19:49:36,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24069 conditions, 3323 events. 2124/3323 cut-off events. For 106389/106389 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17812 event pairs, 483 based on Foata normal form. 9/3330 useless extension candidates. Maximal degree in co-relation 23995. Up to 2867 conditions per place. [2024-06-20 19:49:36,597 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 180 selfloop transitions, 68 changer transitions 0/253 dead transitions. [2024-06-20 19:49:36,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 253 transitions, 3266 flow [2024-06-20 19:49:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:49:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:49:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-06-20 19:49:36,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-20 19:49:36,598 INFO L175 Difference]: Start difference. First operand has 149 places, 205 transitions, 2298 flow. Second operand 7 states and 147 transitions. [2024-06-20 19:49:36,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 253 transitions, 3266 flow [2024-06-20 19:49:36,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 253 transitions, 3142 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-06-20 19:49:36,686 INFO L231 Difference]: Finished difference. Result has 155 places, 226 transitions, 2712 flow [2024-06-20 19:49:36,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2712, PETRI_PLACES=155, PETRI_TRANSITIONS=226} [2024-06-20 19:49:36,686 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2024-06-20 19:49:36,686 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 226 transitions, 2712 flow [2024-06-20 19:49:36,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:36,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:36,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:36,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:49:36,687 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:36,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -10230568, now seen corresponding path program 1 times [2024-06-20 19:49:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938726706] [2024-06-20 19:49:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:49,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938726706] [2024-06-20 19:49:49,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938726706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:49,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:49,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:49:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616554766] [2024-06-20 19:49:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:49,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:49:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:49,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:49:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:49:49,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:49:49,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 226 transitions, 2712 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-20 19:49:49,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:49,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:49:49,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:51,091 INFO L124 PetriNetUnfolderBase]: 2119/3319 cut-off events. [2024-06-20 19:49:51,091 INFO L125 PetriNetUnfolderBase]: For 113607/113607 co-relation queries the response was YES. [2024-06-20 19:49:51,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25234 conditions, 3319 events. 2119/3319 cut-off events. For 113607/113607 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17803 event pairs, 506 based on Foata normal form. 2/3319 useless extension candidates. Maximal degree in co-relation 25156. Up to 3143 conditions per place. [2024-06-20 19:49:51,115 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 219 selfloop transitions, 13 changer transitions 0/237 dead transitions. [2024-06-20 19:49:51,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 237 transitions, 3240 flow [2024-06-20 19:49:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:49:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:49:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-20 19:49:51,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585365853658537 [2024-06-20 19:49:51,116 INFO L175 Difference]: Start difference. First operand has 155 places, 226 transitions, 2712 flow. Second operand 5 states and 94 transitions. [2024-06-20 19:49:51,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 237 transitions, 3240 flow [2024-06-20 19:49:51,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 237 transitions, 3144 flow, removed 43 selfloop flow, removed 2 redundant places. [2024-06-20 19:49:51,224 INFO L231 Difference]: Finished difference. Result has 158 places, 228 transitions, 2685 flow [2024-06-20 19:49:51,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2685, PETRI_PLACES=158, PETRI_TRANSITIONS=228} [2024-06-20 19:49:51,224 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places. [2024-06-20 19:49:51,224 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 228 transitions, 2685 flow [2024-06-20 19:49:51,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-20 19:49:51,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:49:51,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:49:51,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:49:51,225 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:49:51,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:49:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash 950997912, now seen corresponding path program 1 times [2024-06-20 19:49:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:49:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543406829] [2024-06-20 19:49:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:49:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:49:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:49:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:49:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:49:58,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543406829] [2024-06-20 19:49:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543406829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:49:58,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:49:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:49:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594787380] [2024-06-20 19:49:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:49:58,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:49:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:49:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:49:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:49:58,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:49:58,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 228 transitions, 2685 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:49:58,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:49:58,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:49:58,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:49:59,953 INFO L124 PetriNetUnfolderBase]: 2136/3340 cut-off events. [2024-06-20 19:49:59,953 INFO L125 PetriNetUnfolderBase]: For 118601/118601 co-relation queries the response was YES. [2024-06-20 19:49:59,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25481 conditions, 3340 events. 2136/3340 cut-off events. For 118601/118601 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17901 event pairs, 352 based on Foata normal form. 4/3334 useless extension candidates. Maximal degree in co-relation 25401. Up to 3057 conditions per place. [2024-06-20 19:49:59,982 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 227 selfloop transitions, 20 changer transitions 0/252 dead transitions. [2024-06-20 19:49:59,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 252 transitions, 3297 flow [2024-06-20 19:49:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:49:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:49:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-20 19:49:59,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-20 19:49:59,985 INFO L175 Difference]: Start difference. First operand has 158 places, 228 transitions, 2685 flow. Second operand 7 states and 131 transitions. [2024-06-20 19:49:59,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 252 transitions, 3297 flow [2024-06-20 19:50:00,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 252 transitions, 3244 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-20 19:50:00,093 INFO L231 Difference]: Finished difference. Result has 162 places, 230 transitions, 2727 flow [2024-06-20 19:50:00,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2632, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2727, PETRI_PLACES=162, PETRI_TRANSITIONS=230} [2024-06-20 19:50:00,093 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2024-06-20 19:50:00,093 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 230 transitions, 2727 flow [2024-06-20 19:50:00,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:00,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:00,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:00,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:50:00,094 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:50:00,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 793358676, now seen corresponding path program 2 times [2024-06-20 19:50:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838638642] [2024-06-20 19:50:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838638642] [2024-06-20 19:50:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838638642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:50:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152366803] [2024-06-20 19:50:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:09,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:50:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:50:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:50:09,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:50:09,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 230 transitions, 2727 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:09,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:09,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:50:09,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:10,642 INFO L124 PetriNetUnfolderBase]: 2128/3328 cut-off events. [2024-06-20 19:50:10,642 INFO L125 PetriNetUnfolderBase]: For 122973/122973 co-relation queries the response was YES. [2024-06-20 19:50:10,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25615 conditions, 3328 events. 2128/3328 cut-off events. For 122973/122973 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17823 event pairs, 461 based on Foata normal form. 4/3322 useless extension candidates. Maximal degree in co-relation 25534. Up to 2805 conditions per place. [2024-06-20 19:50:10,744 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 200 selfloop transitions, 51 changer transitions 0/256 dead transitions. [2024-06-20 19:50:10,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 256 transitions, 3392 flow [2024-06-20 19:50:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:50:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:50:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-20 19:50:10,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-20 19:50:10,748 INFO L175 Difference]: Start difference. First operand has 162 places, 230 transitions, 2727 flow. Second operand 7 states and 135 transitions. [2024-06-20 19:50:10,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 256 transitions, 3392 flow [2024-06-20 19:50:10,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 256 transitions, 3315 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-20 19:50:10,867 INFO L231 Difference]: Finished difference. Result has 165 places, 235 transitions, 2876 flow [2024-06-20 19:50:10,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2650, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2876, PETRI_PLACES=165, PETRI_TRANSITIONS=235} [2024-06-20 19:50:10,868 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 123 predicate places. [2024-06-20 19:50:10,868 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 235 transitions, 2876 flow [2024-06-20 19:50:10,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:10,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:10,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:10,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:50:10,868 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:50:10,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 239434460, now seen corresponding path program 1 times [2024-06-20 19:50:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749370350] [2024-06-20 19:50:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:19,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-20 19:50:19,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749370350] [2024-06-20 19:50:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749370350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:19,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:50:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558911327] [2024-06-20 19:50:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:19,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:50:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:50:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:50:19,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:50:19,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 235 transitions, 2876 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:19,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:19,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:50:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:21,084 INFO L124 PetriNetUnfolderBase]: 2296/3612 cut-off events. [2024-06-20 19:50:21,084 INFO L125 PetriNetUnfolderBase]: For 146623/146623 co-relation queries the response was YES. [2024-06-20 19:50:21,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28304 conditions, 3612 events. 2296/3612 cut-off events. For 146623/146623 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19904 event pairs, 457 based on Foata normal form. 12/3614 useless extension candidates. Maximal degree in co-relation 28221. Up to 2857 conditions per place. [2024-06-20 19:50:21,114 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 200 selfloop transitions, 69 changer transitions 0/274 dead transitions. [2024-06-20 19:50:21,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 274 transitions, 3793 flow [2024-06-20 19:50:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:50:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:50:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-20 19:50:21,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48509485094850946 [2024-06-20 19:50:21,117 INFO L175 Difference]: Start difference. First operand has 165 places, 235 transitions, 2876 flow. Second operand 9 states and 179 transitions. [2024-06-20 19:50:21,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 274 transitions, 3793 flow [2024-06-20 19:50:21,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 274 transitions, 3672 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-20 19:50:21,277 INFO L231 Difference]: Finished difference. Result has 172 places, 238 transitions, 3000 flow [2024-06-20 19:50:21,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2755, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3000, PETRI_PLACES=172, PETRI_TRANSITIONS=238} [2024-06-20 19:50:21,278 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2024-06-20 19:50:21,278 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 238 transitions, 3000 flow [2024-06-20 19:50:21,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:21,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:21,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:21,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:50:21,278 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:50:21,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 239167550, now seen corresponding path program 2 times [2024-06-20 19:50:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186232958] [2024-06-20 19:50:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186232958] [2024-06-20 19:50:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186232958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:50:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158577004] [2024-06-20 19:50:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:33,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:50:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:50:33,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:50:33,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:50:33,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 238 transitions, 3000 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:33,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:33,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:50:33,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:34,738 INFO L124 PetriNetUnfolderBase]: 2285/3609 cut-off events. [2024-06-20 19:50:34,739 INFO L125 PetriNetUnfolderBase]: For 147367/147367 co-relation queries the response was YES. [2024-06-20 19:50:34,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27940 conditions, 3609 events. 2285/3609 cut-off events. For 147367/147367 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19973 event pairs, 509 based on Foata normal form. 16/3619 useless extension candidates. Maximal degree in co-relation 27854. Up to 3132 conditions per place. [2024-06-20 19:50:34,767 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 218 selfloop transitions, 52 changer transitions 0/275 dead transitions. [2024-06-20 19:50:34,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 275 transitions, 3707 flow [2024-06-20 19:50:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:50:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:50:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-20 19:50:34,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658536585365854 [2024-06-20 19:50:34,769 INFO L175 Difference]: Start difference. First operand has 172 places, 238 transitions, 3000 flow. Second operand 10 states and 191 transitions. [2024-06-20 19:50:34,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 275 transitions, 3707 flow [2024-06-20 19:50:34,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 275 transitions, 3576 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-20 19:50:34,952 INFO L231 Difference]: Finished difference. Result has 177 places, 240 transitions, 3000 flow [2024-06-20 19:50:34,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2869, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3000, PETRI_PLACES=177, PETRI_TRANSITIONS=240} [2024-06-20 19:50:34,953 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-20 19:50:34,953 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 240 transitions, 3000 flow [2024-06-20 19:50:34,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:34,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:34,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:34,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:50:34,954 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:50:34,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash 950672362, now seen corresponding path program 1 times [2024-06-20 19:50:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617995275] [2024-06-20 19:50:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617995275] [2024-06-20 19:50:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617995275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:45,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:45,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:50:45,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43587878] [2024-06-20 19:50:45,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:45,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:50:45,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:50:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:50:45,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:50:45,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 240 transitions, 3000 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:45,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:45,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:50:45,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:46,620 INFO L124 PetriNetUnfolderBase]: 2327/3673 cut-off events. [2024-06-20 19:50:46,620 INFO L125 PetriNetUnfolderBase]: For 146861/146861 co-relation queries the response was YES. [2024-06-20 19:50:46,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28654 conditions, 3673 events. 2327/3673 cut-off events. For 146861/146861 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20422 event pairs, 504 based on Foata normal form. 2/3673 useless extension candidates. Maximal degree in co-relation 28566. Up to 3401 conditions per place. [2024-06-20 19:50:46,655 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 229 selfloop transitions, 36 changer transitions 0/270 dead transitions. [2024-06-20 19:50:46,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 270 transitions, 3869 flow [2024-06-20 19:50:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:50:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:50:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-20 19:50:46,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-20 19:50:46,657 INFO L175 Difference]: Start difference. First operand has 177 places, 240 transitions, 3000 flow. Second operand 7 states and 134 transitions. [2024-06-20 19:50:46,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 270 transitions, 3869 flow [2024-06-20 19:50:46,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 270 transitions, 3771 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-20 19:50:46,835 INFO L231 Difference]: Finished difference. Result has 177 places, 249 transitions, 3174 flow [2024-06-20 19:50:46,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2902, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3174, PETRI_PLACES=177, PETRI_TRANSITIONS=249} [2024-06-20 19:50:46,835 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-20 19:50:46,835 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 249 transitions, 3174 flow [2024-06-20 19:50:46,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:46,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:46,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:46,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:50:46,836 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:50:46,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash -145675990, now seen corresponding path program 2 times [2024-06-20 19:50:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643233774] [2024-06-20 19:50:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:50:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:50:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:50:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643233774] [2024-06-20 19:50:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643233774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:50:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:50:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:50:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128806808] [2024-06-20 19:50:56,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:50:56,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:50:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:50:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:50:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:50:56,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:50:56,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 249 transitions, 3174 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:56,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:50:56,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:50:56,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:50:58,349 INFO L124 PetriNetUnfolderBase]: 2321/3655 cut-off events. [2024-06-20 19:50:58,350 INFO L125 PetriNetUnfolderBase]: For 152020/152020 co-relation queries the response was YES. [2024-06-20 19:50:58,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28707 conditions, 3655 events. 2321/3655 cut-off events. For 152020/152020 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 20257 event pairs, 498 based on Foata normal form. 2/3655 useless extension candidates. Maximal degree in co-relation 28617. Up to 3453 conditions per place. [2024-06-20 19:50:58,381 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 238 selfloop transitions, 22 changer transitions 0/265 dead transitions. [2024-06-20 19:50:58,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 265 transitions, 3766 flow [2024-06-20 19:50:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:50:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:50:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-20 19:50:58,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-20 19:50:58,382 INFO L175 Difference]: Start difference. First operand has 177 places, 249 transitions, 3174 flow. Second operand 7 states and 128 transitions. [2024-06-20 19:50:58,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 265 transitions, 3766 flow [2024-06-20 19:50:58,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 265 transitions, 3704 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-20 19:50:58,577 INFO L231 Difference]: Finished difference. Result has 181 places, 249 transitions, 3162 flow [2024-06-20 19:50:58,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3112, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3162, PETRI_PLACES=181, PETRI_TRANSITIONS=249} [2024-06-20 19:50:58,578 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places. [2024-06-20 19:50:58,578 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 249 transitions, 3162 flow [2024-06-20 19:50:58,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:50:58,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:50:58,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:50:58,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:50:58,579 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:50:58,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:50:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1100214320, now seen corresponding path program 3 times [2024-06-20 19:50:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:50:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634083887] [2024-06-20 19:50:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:50:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:50:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:07,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:07,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634083887] [2024-06-20 19:51:07,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634083887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:07,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:07,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:51:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898147441] [2024-06-20 19:51:07,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:07,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:51:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:51:07,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:51:07,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:51:07,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 249 transitions, 3162 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:07,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:07,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:51:07,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:09,240 INFO L124 PetriNetUnfolderBase]: 2379/3757 cut-off events. [2024-06-20 19:51:09,240 INFO L125 PetriNetUnfolderBase]: For 169308/169308 co-relation queries the response was YES. [2024-06-20 19:51:09,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29599 conditions, 3757 events. 2379/3757 cut-off events. For 169308/169308 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21023 event pairs, 519 based on Foata normal form. 16/3763 useless extension candidates. Maximal degree in co-relation 29508. Up to 3254 conditions per place. [2024-06-20 19:51:09,270 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 221 selfloop transitions, 55 changer transitions 0/281 dead transitions. [2024-06-20 19:51:09,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 281 transitions, 3892 flow [2024-06-20 19:51:09,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:51:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:51:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-20 19:51:09,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2024-06-20 19:51:09,273 INFO L175 Difference]: Start difference. First operand has 181 places, 249 transitions, 3162 flow. Second operand 9 states and 173 transitions. [2024-06-20 19:51:09,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 281 transitions, 3892 flow [2024-06-20 19:51:09,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 281 transitions, 3820 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-20 19:51:09,465 INFO L231 Difference]: Finished difference. Result has 186 places, 250 transitions, 3247 flow [2024-06-20 19:51:09,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3090, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3247, PETRI_PLACES=186, PETRI_TRANSITIONS=250} [2024-06-20 19:51:09,466 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2024-06-20 19:51:09,466 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 250 transitions, 3247 flow [2024-06-20 19:51:09,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:09,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:09,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:09,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:51:09,467 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:09,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1787043718, now seen corresponding path program 4 times [2024-06-20 19:51:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131114305] [2024-06-20 19:51:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:19,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131114305] [2024-06-20 19:51:19,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131114305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:19,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:19,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:51:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300730353] [2024-06-20 19:51:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:19,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:51:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:51:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:51:19,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-20 19:51:19,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 250 transitions, 3247 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-20 19:51:19,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:19,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-20 19:51:19,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:21,231 INFO L124 PetriNetUnfolderBase]: 2461/3909 cut-off events. [2024-06-20 19:51:21,231 INFO L125 PetriNetUnfolderBase]: For 177862/177862 co-relation queries the response was YES. [2024-06-20 19:51:21,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30800 conditions, 3909 events. 2461/3909 cut-off events. For 177862/177862 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 22233 event pairs, 529 based on Foata normal form. 12/3911 useless extension candidates. Maximal degree in co-relation 30708. Up to 3217 conditions per place. [2024-06-20 19:51:21,267 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 223 selfloop transitions, 58 changer transitions 0/286 dead transitions. [2024-06-20 19:51:21,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 286 transitions, 4039 flow [2024-06-20 19:51:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:51:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:51:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-20 19:51:21,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44986449864498645 [2024-06-20 19:51:21,270 INFO L175 Difference]: Start difference. First operand has 186 places, 250 transitions, 3247 flow. Second operand 9 states and 166 transitions. [2024-06-20 19:51:21,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 286 transitions, 4039 flow [2024-06-20 19:51:21,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 286 transitions, 3910 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:51:21,528 INFO L231 Difference]: Finished difference. Result has 189 places, 252 transitions, 3313 flow [2024-06-20 19:51:21,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3118, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3313, PETRI_PLACES=189, PETRI_TRANSITIONS=252} [2024-06-20 19:51:21,529 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2024-06-20 19:51:21,529 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 252 transitions, 3313 flow [2024-06-20 19:51:21,529 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-20 19:51:21,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:21,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:21,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:51:21,530 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:21,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash -538086802, now seen corresponding path program 5 times [2024-06-20 19:51:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:21,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672630363] [2024-06-20 19:51:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:21,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672630363] [2024-06-20 19:51:31,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672630363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:31,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:31,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:51:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460710158] [2024-06-20 19:51:31,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:31,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:51:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:31,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:51:31,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:51:31,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:51:31,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 252 transitions, 3313 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:31,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:31,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:51:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:33,154 INFO L124 PetriNetUnfolderBase]: 2563/4093 cut-off events. [2024-06-20 19:51:33,154 INFO L125 PetriNetUnfolderBase]: For 196534/196534 co-relation queries the response was YES. [2024-06-20 19:51:33,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32593 conditions, 4093 events. 2563/4093 cut-off events. For 196534/196534 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23594 event pairs, 518 based on Foata normal form. 12/4095 useless extension candidates. Maximal degree in co-relation 32499. Up to 2776 conditions per place. [2024-06-20 19:51:33,187 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 207 selfloop transitions, 79 changer transitions 0/291 dead transitions. [2024-06-20 19:51:33,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 291 transitions, 4285 flow [2024-06-20 19:51:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:51:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:51:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-20 19:51:33,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2024-06-20 19:51:33,190 INFO L175 Difference]: Start difference. First operand has 189 places, 252 transitions, 3313 flow. Second operand 9 states and 177 transitions. [2024-06-20 19:51:33,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 291 transitions, 4285 flow [2024-06-20 19:51:33,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 291 transitions, 4152 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:51:33,448 INFO L231 Difference]: Finished difference. Result has 192 places, 254 transitions, 3430 flow [2024-06-20 19:51:33,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3180, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3430, PETRI_PLACES=192, PETRI_TRANSITIONS=254} [2024-06-20 19:51:33,449 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2024-06-20 19:51:33,449 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 254 transitions, 3430 flow [2024-06-20 19:51:33,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:33,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:33,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:33,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:51:33,450 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:33,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1538882340, now seen corresponding path program 6 times [2024-06-20 19:51:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457134599] [2024-06-20 19:51:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:42,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457134599] [2024-06-20 19:51:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457134599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:51:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438198289] [2024-06-20 19:51:42,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:42,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:51:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:51:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:51:43,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:51:43,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 254 transitions, 3430 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:43,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:43,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:51:43,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:44,944 INFO L124 PetriNetUnfolderBase]: 2604/4164 cut-off events. [2024-06-20 19:51:44,944 INFO L125 PetriNetUnfolderBase]: For 206580/206580 co-relation queries the response was YES. [2024-06-20 19:51:44,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33374 conditions, 4164 events. 2604/4164 cut-off events. For 206580/206580 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 24226 event pairs, 578 based on Foata normal form. 12/4166 useless extension candidates. Maximal degree in co-relation 33279. Up to 3450 conditions per place. [2024-06-20 19:51:44,979 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 216 selfloop transitions, 70 changer transitions 0/291 dead transitions. [2024-06-20 19:51:44,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 291 transitions, 4364 flow [2024-06-20 19:51:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:51:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:51:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-20 19:51:44,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2024-06-20 19:51:44,982 INFO L175 Difference]: Start difference. First operand has 192 places, 254 transitions, 3430 flow. Second operand 9 states and 177 transitions. [2024-06-20 19:51:44,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 291 transitions, 4364 flow [2024-06-20 19:51:45,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 291 transitions, 4254 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-20 19:51:45,278 INFO L231 Difference]: Finished difference. Result has 196 places, 255 transitions, 3510 flow [2024-06-20 19:51:45,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3320, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3510, PETRI_PLACES=196, PETRI_TRANSITIONS=255} [2024-06-20 19:51:45,278 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-20 19:51:45,278 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 255 transitions, 3510 flow [2024-06-20 19:51:45,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:45,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:45,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:45,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:51:45,279 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:45,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1539149250, now seen corresponding path program 7 times [2024-06-20 19:51:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149577860] [2024-06-20 19:51:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:51:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:51:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:51:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149577860] [2024-06-20 19:51:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149577860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:51:54,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:51:54,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:51:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839425431] [2024-06-20 19:51:54,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:51:54,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:51:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:51:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:51:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:51:55,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:51:55,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 255 transitions, 3510 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:55,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:51:55,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:51:55,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:51:56,839 INFO L124 PetriNetUnfolderBase]: 2576/4124 cut-off events. [2024-06-20 19:51:56,839 INFO L125 PetriNetUnfolderBase]: For 204658/204658 co-relation queries the response was YES. [2024-06-20 19:51:56,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32718 conditions, 4124 events. 2576/4124 cut-off events. For 204658/204658 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24017 event pairs, 575 based on Foata normal form. 16/4134 useless extension candidates. Maximal degree in co-relation 32621. Up to 3596 conditions per place. [2024-06-20 19:51:56,872 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 227 selfloop transitions, 54 changer transitions 0/286 dead transitions. [2024-06-20 19:51:56,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 286 transitions, 4212 flow [2024-06-20 19:51:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:51:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:51:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-20 19:51:56,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 19:51:56,875 INFO L175 Difference]: Start difference. First operand has 196 places, 255 transitions, 3510 flow. Second operand 9 states and 171 transitions. [2024-06-20 19:51:56,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 286 transitions, 4212 flow [2024-06-20 19:51:57,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 286 transitions, 3962 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-20 19:51:57,139 INFO L231 Difference]: Finished difference. Result has 197 places, 255 transitions, 3375 flow [2024-06-20 19:51:57,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3260, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3375, PETRI_PLACES=197, PETRI_TRANSITIONS=255} [2024-06-20 19:51:57,140 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-20 19:51:57,140 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 255 transitions, 3375 flow [2024-06-20 19:51:57,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:51:57,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:51:57,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:51:57,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:51:57,140 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:51:57,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:51:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -994850012, now seen corresponding path program 3 times [2024-06-20 19:51:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:51:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098454939] [2024-06-20 19:51:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:51:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:51:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:07,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098454939] [2024-06-20 19:52:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098454939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:52:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271592514] [2024-06-20 19:52:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:07,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:52:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:52:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:52:07,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:52:07,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 255 transitions, 3375 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:07,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:07,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:52:07,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:08,700 INFO L124 PetriNetUnfolderBase]: 2580/4148 cut-off events. [2024-06-20 19:52:08,700 INFO L125 PetriNetUnfolderBase]: For 196867/196867 co-relation queries the response was YES. [2024-06-20 19:52:08,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32230 conditions, 4148 events. 2580/4148 cut-off events. For 196867/196867 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24328 event pairs, 573 based on Foata normal form. 4/4146 useless extension candidates. Maximal degree in co-relation 32133. Up to 3609 conditions per place. [2024-06-20 19:52:08,740 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 207 selfloop transitions, 71 changer transitions 0/283 dead transitions. [2024-06-20 19:52:08,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 283 transitions, 4312 flow [2024-06-20 19:52:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:52:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:52:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-20 19:52:08,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808362369337979 [2024-06-20 19:52:08,741 INFO L175 Difference]: Start difference. First operand has 197 places, 255 transitions, 3375 flow. Second operand 7 states and 138 transitions. [2024-06-20 19:52:08,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 283 transitions, 4312 flow [2024-06-20 19:52:09,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 283 transitions, 4199 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-20 19:52:09,087 INFO L231 Difference]: Finished difference. Result has 197 places, 262 transitions, 3544 flow [2024-06-20 19:52:09,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3262, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3544, PETRI_PLACES=197, PETRI_TRANSITIONS=262} [2024-06-20 19:52:09,087 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-20 19:52:09,088 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 262 transitions, 3544 flow [2024-06-20 19:52:09,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:09,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:09,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:09,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:52:09,088 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:52:09,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash -994491962, now seen corresponding path program 4 times [2024-06-20 19:52:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:09,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449238377] [2024-06-20 19:52:09,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:09,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:19,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:19,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449238377] [2024-06-20 19:52:19,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449238377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:19,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:19,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:52:19,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046670058] [2024-06-20 19:52:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:19,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:52:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:19,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:52:19,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:52:19,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:52:19,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 262 transitions, 3544 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:19,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:19,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:52:19,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:20,706 INFO L124 PetriNetUnfolderBase]: 2532/4074 cut-off events. [2024-06-20 19:52:20,706 INFO L125 PetriNetUnfolderBase]: For 200805/200805 co-relation queries the response was YES. [2024-06-20 19:52:20,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31674 conditions, 4074 events. 2532/4074 cut-off events. For 200805/200805 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23860 event pairs, 540 based on Foata normal form. 12/4084 useless extension candidates. Maximal degree in co-relation 31575. Up to 3749 conditions per place. [2024-06-20 19:52:20,745 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 237 selfloop transitions, 40 changer transitions 0/282 dead transitions. [2024-06-20 19:52:20,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 282 transitions, 4212 flow [2024-06-20 19:52:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:52:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:52:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-20 19:52:20,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-20 19:52:20,747 INFO L175 Difference]: Start difference. First operand has 197 places, 262 transitions, 3544 flow. Second operand 8 states and 151 transitions. [2024-06-20 19:52:20,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 282 transitions, 4212 flow [2024-06-20 19:52:21,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 282 transitions, 4046 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-20 19:52:21,027 INFO L231 Difference]: Finished difference. Result has 202 places, 262 transitions, 3472 flow [2024-06-20 19:52:21,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3472, PETRI_PLACES=202, PETRI_TRANSITIONS=262} [2024-06-20 19:52:21,028 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-20 19:52:21,028 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 262 transitions, 3472 flow [2024-06-20 19:52:21,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:21,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:21,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:21,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:52:21,029 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:52:21,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash -397073180, now seen corresponding path program 5 times [2024-06-20 19:52:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:21,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495299406] [2024-06-20 19:52:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495299406] [2024-06-20 19:52:30,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495299406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:30,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:30,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:52:30,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957074062] [2024-06-20 19:52:30,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:30,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:52:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:52:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:52:31,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:52:31,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 262 transitions, 3472 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:31,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:31,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:52:31,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:32,549 INFO L124 PetriNetUnfolderBase]: 2528/4081 cut-off events. [2024-06-20 19:52:32,550 INFO L125 PetriNetUnfolderBase]: For 200387/200387 co-relation queries the response was YES. [2024-06-20 19:52:32,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31194 conditions, 4081 events. 2528/4081 cut-off events. For 200387/200387 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23959 event pairs, 544 based on Foata normal form. 12/4091 useless extension candidates. Maximal degree in co-relation 31094. Up to 3552 conditions per place. [2024-06-20 19:52:32,586 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 218 selfloop transitions, 69 changer transitions 0/292 dead transitions. [2024-06-20 19:52:32,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 292 transitions, 4333 flow [2024-06-20 19:52:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:52:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:52:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-06-20 19:52:32,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2024-06-20 19:52:32,588 INFO L175 Difference]: Start difference. First operand has 202 places, 262 transitions, 3472 flow. Second operand 7 states and 147 transitions. [2024-06-20 19:52:32,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 292 transitions, 4333 flow [2024-06-20 19:52:32,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 292 transitions, 4251 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-20 19:52:32,854 INFO L231 Difference]: Finished difference. Result has 203 places, 266 transitions, 3664 flow [2024-06-20 19:52:32,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3392, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3664, PETRI_PLACES=203, PETRI_TRANSITIONS=266} [2024-06-20 19:52:32,855 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places. [2024-06-20 19:52:32,855 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 266 transitions, 3664 flow [2024-06-20 19:52:32,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:32,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:32,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:32,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:52:32,856 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:52:32,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash -331455604, now seen corresponding path program 6 times [2024-06-20 19:52:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:32,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816270343] [2024-06-20 19:52:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:42,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816270343] [2024-06-20 19:52:42,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816270343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:42,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:42,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:52:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067639434] [2024-06-20 19:52:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:42,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:52:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:52:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:52:42,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:52:42,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 266 transitions, 3664 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:42,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:42,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:52:42,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:44,285 INFO L124 PetriNetUnfolderBase]: 2498/4034 cut-off events. [2024-06-20 19:52:44,286 INFO L125 PetriNetUnfolderBase]: For 198344/198344 co-relation queries the response was YES. [2024-06-20 19:52:44,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31079 conditions, 4034 events. 2498/4034 cut-off events. For 198344/198344 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23673 event pairs, 538 based on Foata normal form. 6/4038 useless extension candidates. Maximal degree in co-relation 30977. Up to 3737 conditions per place. [2024-06-20 19:52:44,322 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 243 selfloop transitions, 37 changer transitions 0/285 dead transitions. [2024-06-20 19:52:44,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 285 transitions, 4312 flow [2024-06-20 19:52:44,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:52:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:52:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-20 19:52:44,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2024-06-20 19:52:44,323 INFO L175 Difference]: Start difference. First operand has 203 places, 266 transitions, 3664 flow. Second operand 6 states and 122 transitions. [2024-06-20 19:52:44,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 285 transitions, 4312 flow [2024-06-20 19:52:44,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 285 transitions, 4165 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-20 19:52:44,619 INFO L231 Difference]: Finished difference. Result has 205 places, 266 transitions, 3613 flow [2024-06-20 19:52:44,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3517, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3613, PETRI_PLACES=205, PETRI_TRANSITIONS=266} [2024-06-20 19:52:44,620 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2024-06-20 19:52:44,620 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 266 transitions, 3613 flow [2024-06-20 19:52:44,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:44,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:44,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:44,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:52:44,620 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:52:44,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:44,621 INFO L85 PathProgramCache]: Analyzing trace with hash -986270204, now seen corresponding path program 1 times [2024-06-20 19:52:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:44,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204349669] [2024-06-20 19:52:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:52:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:52:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:52:55,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204349669] [2024-06-20 19:52:55,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204349669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:52:55,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:52:55,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:52:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599359119] [2024-06-20 19:52:55,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:52:55,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:52:55,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:52:55,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:52:55,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:52:55,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:52:55,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 266 transitions, 3613 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:55,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:52:55,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:52:55,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:52:57,037 INFO L124 PetriNetUnfolderBase]: 2529/4075 cut-off events. [2024-06-20 19:52:57,037 INFO L125 PetriNetUnfolderBase]: For 204663/204663 co-relation queries the response was YES. [2024-06-20 19:52:57,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31387 conditions, 4075 events. 2529/4075 cut-off events. For 204663/204663 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23917 event pairs, 544 based on Foata normal form. 3/4072 useless extension candidates. Maximal degree in co-relation 31284. Up to 3492 conditions per place. [2024-06-20 19:52:57,073 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 203 selfloop transitions, 93 changer transitions 0/301 dead transitions. [2024-06-20 19:52:57,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 301 transitions, 4783 flow [2024-06-20 19:52:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:52:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:52:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-20 19:52:57,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-20 19:52:57,075 INFO L175 Difference]: Start difference. First operand has 205 places, 266 transitions, 3613 flow. Second operand 8 states and 159 transitions. [2024-06-20 19:52:57,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 301 transitions, 4783 flow [2024-06-20 19:52:57,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 301 transitions, 4719 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-20 19:52:57,364 INFO L231 Difference]: Finished difference. Result has 210 places, 276 transitions, 3951 flow [2024-06-20 19:52:57,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3549, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3951, PETRI_PLACES=210, PETRI_TRANSITIONS=276} [2024-06-20 19:52:57,364 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places. [2024-06-20 19:52:57,364 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 276 transitions, 3951 flow [2024-06-20 19:52:57,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:52:57,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:52:57,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:52:57,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:52:57,365 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:52:57,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:52:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1968569452, now seen corresponding path program 2 times [2024-06-20 19:52:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:52:57,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484066399] [2024-06-20 19:52:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:52:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:52:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484066399] [2024-06-20 19:53:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484066399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272897657] [2024-06-20 19:53:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:08,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:08,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:53:08,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 276 transitions, 3951 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:08,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:08,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:53:08,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:09,816 INFO L124 PetriNetUnfolderBase]: 2539/4093 cut-off events. [2024-06-20 19:53:09,817 INFO L125 PetriNetUnfolderBase]: For 217232/217232 co-relation queries the response was YES. [2024-06-20 19:53:09,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32735 conditions, 4093 events. 2539/4093 cut-off events. For 217232/217232 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 23989 event pairs, 543 based on Foata normal form. 2/4089 useless extension candidates. Maximal degree in co-relation 32630. Up to 3705 conditions per place. [2024-06-20 19:53:09,857 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 257 selfloop transitions, 65 changer transitions 0/327 dead transitions. [2024-06-20 19:53:09,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 327 transitions, 5348 flow [2024-06-20 19:53:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:53:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:53:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-20 19:53:09,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-20 19:53:09,860 INFO L175 Difference]: Start difference. First operand has 210 places, 276 transitions, 3951 flow. Second operand 8 states and 150 transitions. [2024-06-20 19:53:09,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 327 transitions, 5348 flow [2024-06-20 19:53:10,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 327 transitions, 5105 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-06-20 19:53:10,215 INFO L231 Difference]: Finished difference. Result has 217 places, 308 transitions, 4473 flow [2024-06-20 19:53:10,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3749, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4473, PETRI_PLACES=217, PETRI_TRANSITIONS=308} [2024-06-20 19:53:10,216 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places. [2024-06-20 19:53:10,216 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 308 transitions, 4473 flow [2024-06-20 19:53:10,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:10,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:10,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:10,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:53:10,216 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:53:10,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1968569607, now seen corresponding path program 1 times [2024-06-20 19:53:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:10,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668183547] [2024-06-20 19:53:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668183547] [2024-06-20 19:53:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668183547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:20,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326188253] [2024-06-20 19:53:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:20,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:20,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:53:20,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 308 transitions, 4473 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:20,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:20,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:53:20,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:22,386 INFO L124 PetriNetUnfolderBase]: 2657/4256 cut-off events. [2024-06-20 19:53:22,386 INFO L125 PetriNetUnfolderBase]: For 246054/246054 co-relation queries the response was YES. [2024-06-20 19:53:22,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35218 conditions, 4256 events. 2657/4256 cut-off events. For 246054/246054 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24961 event pairs, 528 based on Foata normal form. 6/4256 useless extension candidates. Maximal degree in co-relation 35108. Up to 3385 conditions per place. [2024-06-20 19:53:22,430 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 219 selfloop transitions, 125 changer transitions 0/349 dead transitions. [2024-06-20 19:53:22,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 349 transitions, 5807 flow [2024-06-20 19:53:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:53:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:53:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-20 19:53:22,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-20 19:53:22,432 INFO L175 Difference]: Start difference. First operand has 217 places, 308 transitions, 4473 flow. Second operand 8 states and 160 transitions. [2024-06-20 19:53:22,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 349 transitions, 5807 flow [2024-06-20 19:53:22,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 349 transitions, 5642 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-06-20 19:53:22,790 INFO L231 Difference]: Finished difference. Result has 224 places, 324 transitions, 4970 flow [2024-06-20 19:53:22,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4308, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4970, PETRI_PLACES=224, PETRI_TRANSITIONS=324} [2024-06-20 19:53:22,791 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-20 19:53:22,791 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 324 transitions, 4970 flow [2024-06-20 19:53:22,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:22,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:22,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:53:22,792 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:53:22,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -982460924, now seen corresponding path program 3 times [2024-06-20 19:53:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577128525] [2024-06-20 19:53:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:34,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577128525] [2024-06-20 19:53:34,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577128525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:34,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:34,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:34,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204069058] [2024-06-20 19:53:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:34,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:34,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:34,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:53:34,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 324 transitions, 4970 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:34,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:34,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:53:34,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:36,501 INFO L124 PetriNetUnfolderBase]: 2702/4319 cut-off events. [2024-06-20 19:53:36,501 INFO L125 PetriNetUnfolderBase]: For 264408/264408 co-relation queries the response was YES. [2024-06-20 19:53:36,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37353 conditions, 4319 events. 2702/4319 cut-off events. For 264408/264408 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25305 event pairs, 523 based on Foata normal form. 9/4326 useless extension candidates. Maximal degree in co-relation 37239. Up to 3953 conditions per place. [2024-06-20 19:53:36,545 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 297 selfloop transitions, 56 changer transitions 0/358 dead transitions. [2024-06-20 19:53:36,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 358 transitions, 6075 flow [2024-06-20 19:53:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:53:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:53:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-20 19:53:36,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-20 19:53:36,546 INFO L175 Difference]: Start difference. First operand has 224 places, 324 transitions, 4970 flow. Second operand 9 states and 169 transitions. [2024-06-20 19:53:36,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 358 transitions, 6075 flow [2024-06-20 19:53:36,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 358 transitions, 5940 flow, removed 62 selfloop flow, removed 2 redundant places. [2024-06-20 19:53:36,900 INFO L231 Difference]: Finished difference. Result has 231 places, 334 transitions, 5187 flow [2024-06-20 19:53:36,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4843, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5187, PETRI_PLACES=231, PETRI_TRANSITIONS=334} [2024-06-20 19:53:36,901 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places. [2024-06-20 19:53:36,901 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 334 transitions, 5187 flow [2024-06-20 19:53:36,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:36,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:36,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:36,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:53:36,901 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:53:36,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:36,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1972288677, now seen corresponding path program 2 times [2024-06-20 19:53:36,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:36,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109668411] [2024-06-20 19:53:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:53:47,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:47,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109668411] [2024-06-20 19:53:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109668411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788561114] [2024-06-20 19:53:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:47,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:53:47,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:53:47,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 334 transitions, 5187 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:47,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:53:47,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:53:47,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:53:49,309 INFO L124 PetriNetUnfolderBase]: 2828/4511 cut-off events. [2024-06-20 19:53:49,310 INFO L125 PetriNetUnfolderBase]: For 282398/282398 co-relation queries the response was YES. [2024-06-20 19:53:49,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39552 conditions, 4511 events. 2828/4511 cut-off events. For 282398/282398 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 26596 event pairs, 533 based on Foata normal form. 6/4515 useless extension candidates. Maximal degree in co-relation 39435. Up to 4054 conditions per place. [2024-06-20 19:53:49,357 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 312 selfloop transitions, 55 changer transitions 0/372 dead transitions. [2024-06-20 19:53:49,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 372 transitions, 6584 flow [2024-06-20 19:53:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:53:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:53:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-20 19:53:49,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-20 19:53:49,359 INFO L175 Difference]: Start difference. First operand has 231 places, 334 transitions, 5187 flow. Second operand 9 states and 170 transitions. [2024-06-20 19:53:49,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 372 transitions, 6584 flow [2024-06-20 19:53:49,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 372 transitions, 6335 flow, removed 75 selfloop flow, removed 7 redundant places. [2024-06-20 19:53:49,773 INFO L231 Difference]: Finished difference. Result has 234 places, 345 transitions, 5315 flow [2024-06-20 19:53:49,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4938, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5315, PETRI_PLACES=234, PETRI_TRANSITIONS=345} [2024-06-20 19:53:49,774 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-20 19:53:49,774 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 345 transitions, 5315 flow [2024-06-20 19:53:49,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:53:49,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:53:49,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:53:49,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:53:49,774 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:53:49,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:53:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -317155924, now seen corresponding path program 1 times [2024-06-20 19:53:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:53:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673107109] [2024-06-20 19:53:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:53:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:53:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:53:59,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-20 19:53:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:53:59,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673107109] [2024-06-20 19:53:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673107109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:53:59,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:53:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:53:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725457129] [2024-06-20 19:53:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:53:59,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:53:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:53:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:53:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:54:00,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:54:00,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 345 transitions, 5315 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:00,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:00,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:54:00,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:01,683 INFO L124 PetriNetUnfolderBase]: 2825/4491 cut-off events. [2024-06-20 19:54:01,683 INFO L125 PetriNetUnfolderBase]: For 286676/286676 co-relation queries the response was YES. [2024-06-20 19:54:01,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39561 conditions, 4491 events. 2825/4491 cut-off events. For 286676/286676 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 26414 event pairs, 543 based on Foata normal form. 1/4490 useless extension candidates. Maximal degree in co-relation 39442. Up to 4233 conditions per place. [2024-06-20 19:54:01,728 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 326 selfloop transitions, 29 changer transitions 0/360 dead transitions. [2024-06-20 19:54:01,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 360 transitions, 6129 flow [2024-06-20 19:54:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:54:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:54:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-20 19:54:01,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-20 19:54:01,729 INFO L175 Difference]: Start difference. First operand has 234 places, 345 transitions, 5315 flow. Second operand 5 states and 100 transitions. [2024-06-20 19:54:01,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 360 transitions, 6129 flow [2024-06-20 19:54:02,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 360 transitions, 6001 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-20 19:54:02,135 INFO L231 Difference]: Finished difference. Result has 235 places, 348 transitions, 5331 flow [2024-06-20 19:54:02,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5187, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5331, PETRI_PLACES=235, PETRI_TRANSITIONS=348} [2024-06-20 19:54:02,135 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-20 19:54:02,135 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 348 transitions, 5331 flow [2024-06-20 19:54:02,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:02,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:02,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:02,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:54:02,136 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:54:02,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash -324780436, now seen corresponding path program 4 times [2024-06-20 19:54:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:02,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048569570] [2024-06-20 19:54:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048569570] [2024-06-20 19:54:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048569570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:12,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:54:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491194241] [2024-06-20 19:54:12,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:12,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:54:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:54:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:54:12,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:54:12,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 348 transitions, 5331 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:12,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:12,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:54:12,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:14,771 INFO L124 PetriNetUnfolderBase]: 2875/4557 cut-off events. [2024-06-20 19:54:14,772 INFO L125 PetriNetUnfolderBase]: For 303213/303213 co-relation queries the response was YES. [2024-06-20 19:54:14,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40474 conditions, 4557 events. 2875/4557 cut-off events. For 303213/303213 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 26760 event pairs, 557 based on Foata normal form. 6/4561 useless extension candidates. Maximal degree in co-relation 40353. Up to 4098 conditions per place. [2024-06-20 19:54:14,820 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 316 selfloop transitions, 84 changer transitions 0/405 dead transitions. [2024-06-20 19:54:14,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 405 transitions, 6970 flow [2024-06-20 19:54:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:54:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:54:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-20 19:54:14,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152439024390244 [2024-06-20 19:54:14,823 INFO L175 Difference]: Start difference. First operand has 235 places, 348 transitions, 5331 flow. Second operand 8 states and 169 transitions. [2024-06-20 19:54:14,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 405 transitions, 6970 flow [2024-06-20 19:54:15,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 405 transitions, 6902 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-20 19:54:15,277 INFO L231 Difference]: Finished difference. Result has 243 places, 375 transitions, 6090 flow [2024-06-20 19:54:15,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5263, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6090, PETRI_PLACES=243, PETRI_TRANSITIONS=375} [2024-06-20 19:54:15,277 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places. [2024-06-20 19:54:15,277 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 375 transitions, 6090 flow [2024-06-20 19:54:15,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:15,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:15,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:15,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:54:15,278 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:54:15,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:15,278 INFO L85 PathProgramCache]: Analyzing trace with hash -397058517, now seen corresponding path program 3 times [2024-06-20 19:54:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057330585] [2024-06-20 19:54:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057330585] [2024-06-20 19:54:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057330585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:25,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:54:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376709264] [2024-06-20 19:54:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:54:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:54:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:54:25,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:54:25,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 375 transitions, 6090 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:25,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:25,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:54:25,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:27,383 INFO L124 PetriNetUnfolderBase]: 2977/4728 cut-off events. [2024-06-20 19:54:27,383 INFO L125 PetriNetUnfolderBase]: For 333195/333195 co-relation queries the response was YES. [2024-06-20 19:54:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43749 conditions, 4728 events. 2977/4728 cut-off events. For 333195/333195 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 28003 event pairs, 540 based on Foata normal form. 6/4732 useless extension candidates. Maximal degree in co-relation 43624. Up to 4307 conditions per place. [2024-06-20 19:54:27,436 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 357 selfloop transitions, 42 changer transitions 0/404 dead transitions. [2024-06-20 19:54:27,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 404 transitions, 7327 flow [2024-06-20 19:54:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:54:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:54:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 19:54:27,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 19:54:27,437 INFO L175 Difference]: Start difference. First operand has 243 places, 375 transitions, 6090 flow. Second operand 8 states and 149 transitions. [2024-06-20 19:54:27,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 404 transitions, 7327 flow [2024-06-20 19:54:28,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 404 transitions, 7167 flow, removed 74 selfloop flow, removed 2 redundant places. [2024-06-20 19:54:28,042 INFO L231 Difference]: Finished difference. Result has 250 places, 383 transitions, 6239 flow [2024-06-20 19:54:28,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5930, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6239, PETRI_PLACES=250, PETRI_TRANSITIONS=383} [2024-06-20 19:54:28,043 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places. [2024-06-20 19:54:28,043 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 383 transitions, 6239 flow [2024-06-20 19:54:28,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:28,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:28,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:28,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:54:28,043 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:54:28,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash -324780281, now seen corresponding path program 4 times [2024-06-20 19:54:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808800687] [2024-06-20 19:54:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808800687] [2024-06-20 19:54:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808800687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:38,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:54:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003676578] [2024-06-20 19:54:38,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:38,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:54:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:54:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:54:38,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:54:38,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 383 transitions, 6239 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:38,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:38,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:54:38,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:40,390 INFO L124 PetriNetUnfolderBase]: 3087/4886 cut-off events. [2024-06-20 19:54:40,390 INFO L125 PetriNetUnfolderBase]: For 360883/360883 co-relation queries the response was YES. [2024-06-20 19:54:40,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46251 conditions, 4886 events. 3087/4886 cut-off events. For 360883/360883 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 29031 event pairs, 591 based on Foata normal form. 6/4890 useless extension candidates. Maximal degree in co-relation 46123. Up to 4144 conditions per place. [2024-06-20 19:54:40,444 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 315 selfloop transitions, 107 changer transitions 0/427 dead transitions. [2024-06-20 19:54:40,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 427 transitions, 7835 flow [2024-06-20 19:54:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:54:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:54:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-20 19:54:40,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030487804878049 [2024-06-20 19:54:40,446 INFO L175 Difference]: Start difference. First operand has 250 places, 383 transitions, 6239 flow. Second operand 8 states and 165 transitions. [2024-06-20 19:54:40,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 427 transitions, 7835 flow [2024-06-20 19:54:41,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 427 transitions, 7574 flow, removed 58 selfloop flow, removed 6 redundant places. [2024-06-20 19:54:41,125 INFO L231 Difference]: Finished difference. Result has 254 places, 395 transitions, 6564 flow [2024-06-20 19:54:41,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5978, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6564, PETRI_PLACES=254, PETRI_TRANSITIONS=395} [2024-06-20 19:54:41,125 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places. [2024-06-20 19:54:41,125 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 395 transitions, 6564 flow [2024-06-20 19:54:41,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:41,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:41,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:41,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:54:41,126 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:54:41,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash -583834384, now seen corresponding path program 1 times [2024-06-20 19:54:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:41,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799931388] [2024-06-20 19:54:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:54:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:54:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:54:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799931388] [2024-06-20 19:54:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799931388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:54:50,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:54:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:54:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967949509] [2024-06-20 19:54:50,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:54:50,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:54:50,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:54:50,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:54:50,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:54:50,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:54:50,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 395 transitions, 6564 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:50,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:54:50,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:54:50,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:54:52,609 INFO L124 PetriNetUnfolderBase]: 3128/4958 cut-off events. [2024-06-20 19:54:52,609 INFO L125 PetriNetUnfolderBase]: For 379661/379661 co-relation queries the response was YES. [2024-06-20 19:54:52,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46931 conditions, 4958 events. 3128/4958 cut-off events. For 379661/379661 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 29557 event pairs, 492 based on Foata normal form. 12/4960 useless extension candidates. Maximal degree in co-relation 46803. Up to 4516 conditions per place. [2024-06-20 19:54:52,664 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 399 selfloop transitions, 21 changer transitions 0/425 dead transitions. [2024-06-20 19:54:52,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 425 transitions, 7558 flow [2024-06-20 19:54:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:54:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:54:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 19:54:52,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 19:54:52,667 INFO L175 Difference]: Start difference. First operand has 254 places, 395 transitions, 6564 flow. Second operand 8 states and 149 transitions. [2024-06-20 19:54:52,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 425 transitions, 7558 flow [2024-06-20 19:54:53,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 425 transitions, 7432 flow, removed 62 selfloop flow, removed 1 redundant places. [2024-06-20 19:54:53,235 INFO L231 Difference]: Finished difference. Result has 261 places, 396 transitions, 6530 flow [2024-06-20 19:54:53,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6438, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6530, PETRI_PLACES=261, PETRI_TRANSITIONS=396} [2024-06-20 19:54:53,235 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 219 predicate places. [2024-06-20 19:54:53,236 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 396 transitions, 6530 flow [2024-06-20 19:54:53,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:54:53,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:54:53,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:54:53,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:54:53,236 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:54:53,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:54:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 987716074, now seen corresponding path program 2 times [2024-06-20 19:54:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:54:53,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819413328] [2024-06-20 19:54:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:54:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:54:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:02,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-20 19:55:02,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819413328] [2024-06-20 19:55:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819413328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:02,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:02,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:55:02,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461597876] [2024-06-20 19:55:02,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:02,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:55:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:55:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:55:02,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:55:02,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 396 transitions, 6530 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:02,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:02,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:55:02,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:04,666 INFO L124 PetriNetUnfolderBase]: 3203/5083 cut-off events. [2024-06-20 19:55:04,666 INFO L125 PetriNetUnfolderBase]: For 389349/389349 co-relation queries the response was YES. [2024-06-20 19:55:04,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47499 conditions, 5083 events. 3203/5083 cut-off events. For 389349/389349 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 30592 event pairs, 636 based on Foata normal form. 12/5085 useless extension candidates. Maximal degree in co-relation 47368. Up to 4554 conditions per place. [2024-06-20 19:55:04,725 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 386 selfloop transitions, 38 changer transitions 0/429 dead transitions. [2024-06-20 19:55:04,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 429 transitions, 7559 flow [2024-06-20 19:55:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:55:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:55:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-20 19:55:04,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46646341463414637 [2024-06-20 19:55:04,727 INFO L175 Difference]: Start difference. First operand has 261 places, 396 transitions, 6530 flow. Second operand 8 states and 153 transitions. [2024-06-20 19:55:04,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 429 transitions, 7559 flow [2024-06-20 19:55:05,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 429 transitions, 7489 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-20 19:55:05,464 INFO L231 Difference]: Finished difference. Result has 265 places, 401 transitions, 6633 flow [2024-06-20 19:55:05,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6460, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6633, PETRI_PLACES=265, PETRI_TRANSITIONS=401} [2024-06-20 19:55:05,465 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 223 predicate places. [2024-06-20 19:55:05,465 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 401 transitions, 6633 flow [2024-06-20 19:55:05,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:05,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:05,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:55:05,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:55:05,465 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:55:05,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash 729688042, now seen corresponding path program 3 times [2024-06-20 19:55:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719911968] [2024-06-20 19:55:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719911968] [2024-06-20 19:55:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719911968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:15,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:55:15,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078845001] [2024-06-20 19:55:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:15,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:55:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:55:15,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:55:15,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:55:15,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 401 transitions, 6633 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:15,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:15,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:55:15,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:17,429 INFO L124 PetriNetUnfolderBase]: 3183/5055 cut-off events. [2024-06-20 19:55:17,429 INFO L125 PetriNetUnfolderBase]: For 389886/389886 co-relation queries the response was YES. [2024-06-20 19:55:17,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46930 conditions, 5055 events. 3183/5055 cut-off events. For 389886/389886 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 30447 event pairs, 620 based on Foata normal form. 12/5061 useless extension candidates. Maximal degree in co-relation 46796. Up to 4452 conditions per place. [2024-06-20 19:55:17,480 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 383 selfloop transitions, 44 changer transitions 0/432 dead transitions. [2024-06-20 19:55:17,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 432 transitions, 7539 flow [2024-06-20 19:55:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:55:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:55:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-20 19:55:17,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2024-06-20 19:55:17,483 INFO L175 Difference]: Start difference. First operand has 265 places, 401 transitions, 6633 flow. Second operand 9 states and 168 transitions. [2024-06-20 19:55:17,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 432 transitions, 7539 flow [2024-06-20 19:55:17,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 432 transitions, 7430 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-20 19:55:18,004 INFO L231 Difference]: Finished difference. Result has 268 places, 400 transitions, 6544 flow [2024-06-20 19:55:18,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6452, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6544, PETRI_PLACES=268, PETRI_TRANSITIONS=400} [2024-06-20 19:55:18,004 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places. [2024-06-20 19:55:18,004 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 400 transitions, 6544 flow [2024-06-20 19:55:18,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:18,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:18,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:55:18,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:55:18,005 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:55:18,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:18,005 INFO L85 PathProgramCache]: Analyzing trace with hash -593926339, now seen corresponding path program 1 times [2024-06-20 19:55:18,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:18,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951057906] [2024-06-20 19:55:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951057906] [2024-06-20 19:55:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951057906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:28,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:55:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845367810] [2024-06-20 19:55:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:28,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:55:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:28,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:55:28,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:55:28,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:55:28,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 400 transitions, 6544 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:28,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:28,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:55:28,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:30,430 INFO L124 PetriNetUnfolderBase]: 3267/5189 cut-off events. [2024-06-20 19:55:30,430 INFO L125 PetriNetUnfolderBase]: For 375224/375224 co-relation queries the response was YES. [2024-06-20 19:55:30,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48211 conditions, 5189 events. 3267/5189 cut-off events. For 375224/375224 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 31399 event pairs, 659 based on Foata normal form. 4/5191 useless extension candidates. Maximal degree in co-relation 48078. Up to 4737 conditions per place. [2024-06-20 19:55:30,494 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 371 selfloop transitions, 61 changer transitions 0/437 dead transitions. [2024-06-20 19:55:30,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 437 transitions, 8021 flow [2024-06-20 19:55:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:55:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:55:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-20 19:55:30,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46646341463414637 [2024-06-20 19:55:30,495 INFO L175 Difference]: Start difference. First operand has 268 places, 400 transitions, 6544 flow. Second operand 8 states and 153 transitions. [2024-06-20 19:55:30,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 437 transitions, 8021 flow [2024-06-20 19:55:31,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 437 transitions, 7824 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-06-20 19:55:31,285 INFO L231 Difference]: Finished difference. Result has 267 places, 409 transitions, 6766 flow [2024-06-20 19:55:31,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6347, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6766, PETRI_PLACES=267, PETRI_TRANSITIONS=409} [2024-06-20 19:55:31,286 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 225 predicate places. [2024-06-20 19:55:31,286 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 409 transitions, 6766 flow [2024-06-20 19:55:31,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:31,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:31,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:55:31,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:55:31,287 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:55:31,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash 491418147, now seen corresponding path program 1 times [2024-06-20 19:55:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:31,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503435054] [2024-06-20 19:55:31,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:41,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:41,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503435054] [2024-06-20 19:55:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503435054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:55:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261071928] [2024-06-20 19:55:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:41,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:55:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:55:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:55:42,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:55:42,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 409 transitions, 6766 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:42,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:42,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:55:42,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:44,103 INFO L124 PetriNetUnfolderBase]: 3277/5195 cut-off events. [2024-06-20 19:55:44,103 INFO L125 PetriNetUnfolderBase]: For 382282/382282 co-relation queries the response was YES. [2024-06-20 19:55:44,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48128 conditions, 5195 events. 3277/5195 cut-off events. For 382282/382282 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 31356 event pairs, 659 based on Foata normal form. 2/5195 useless extension candidates. Maximal degree in co-relation 47997. Up to 4837 conditions per place. [2024-06-20 19:55:44,164 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 383 selfloop transitions, 51 changer transitions 0/439 dead transitions. [2024-06-20 19:55:44,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 439 transitions, 7951 flow [2024-06-20 19:55:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:55:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:55:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-20 19:55:44,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121951219512195 [2024-06-20 19:55:44,166 INFO L175 Difference]: Start difference. First operand has 267 places, 409 transitions, 6766 flow. Second operand 10 states and 169 transitions. [2024-06-20 19:55:44,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 439 transitions, 7951 flow [2024-06-20 19:55:44,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 439 transitions, 7814 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-20 19:55:44,871 INFO L231 Difference]: Finished difference. Result has 274 places, 417 transitions, 6913 flow [2024-06-20 19:55:44,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6631, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6913, PETRI_PLACES=274, PETRI_TRANSITIONS=417} [2024-06-20 19:55:44,871 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 232 predicate places. [2024-06-20 19:55:44,872 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 417 transitions, 6913 flow [2024-06-20 19:55:44,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:44,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:44,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:55:44,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:55:44,872 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:55:44,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 668549853, now seen corresponding path program 2 times [2024-06-20 19:55:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859279603] [2024-06-20 19:55:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:55:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:55:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:55:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859279603] [2024-06-20 19:55:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859279603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:55:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:55:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:55:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970959974] [2024-06-20 19:55:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:55:53,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:55:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:55:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:55:53,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:55:53,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:55:53,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 417 transitions, 6913 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:53,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:55:53,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:55:53,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:55:55,759 INFO L124 PetriNetUnfolderBase]: 3356/5303 cut-off events. [2024-06-20 19:55:55,759 INFO L125 PetriNetUnfolderBase]: For 406241/406241 co-relation queries the response was YES. [2024-06-20 19:55:55,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49710 conditions, 5303 events. 3356/5303 cut-off events. For 406241/406241 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 31957 event pairs, 656 based on Foata normal form. 4/5303 useless extension candidates. Maximal degree in co-relation 49577. Up to 4951 conditions per place. [2024-06-20 19:55:55,823 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 402 selfloop transitions, 49 changer transitions 0/456 dead transitions. [2024-06-20 19:55:55,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 456 transitions, 8514 flow [2024-06-20 19:55:55,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:55:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:55:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-20 19:55:55,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-20 19:55:55,824 INFO L175 Difference]: Start difference. First operand has 274 places, 417 transitions, 6913 flow. Second operand 8 states and 150 transitions. [2024-06-20 19:55:55,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 456 transitions, 8514 flow [2024-06-20 19:55:56,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 456 transitions, 8378 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-20 19:55:56,623 INFO L231 Difference]: Finished difference. Result has 279 places, 436 transitions, 7348 flow [2024-06-20 19:55:56,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6792, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7348, PETRI_PLACES=279, PETRI_TRANSITIONS=436} [2024-06-20 19:55:56,624 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 237 predicate places. [2024-06-20 19:55:56,624 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 436 transitions, 7348 flow [2024-06-20 19:55:56,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:55:56,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:55:56,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:55:56,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:55:56,625 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:55:56,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:55:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash 496059777, now seen corresponding path program 2 times [2024-06-20 19:55:56,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:55:56,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115033584] [2024-06-20 19:55:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:55:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:55:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:06,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115033584] [2024-06-20 19:56:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115033584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:06,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:56:06,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154267274] [2024-06-20 19:56:06,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:06,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:56:06,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:06,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:56:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:56:06,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:56:06,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 436 transitions, 7348 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:06,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:06,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:56:06,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:08,607 INFO L124 PetriNetUnfolderBase]: 3405/5381 cut-off events. [2024-06-20 19:56:08,607 INFO L125 PetriNetUnfolderBase]: For 419573/419573 co-relation queries the response was YES. [2024-06-20 19:56:08,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50655 conditions, 5381 events. 3405/5381 cut-off events. For 419573/419573 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 32454 event pairs, 653 based on Foata normal form. 3/5378 useless extension candidates. Maximal degree in co-relation 50519. Up to 5005 conditions per place. [2024-06-20 19:56:08,666 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 414 selfloop transitions, 56 changer transitions 0/475 dead transitions. [2024-06-20 19:56:08,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 475 transitions, 8835 flow [2024-06-20 19:56:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 19:56:08,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 19:56:08,668 INFO L175 Difference]: Start difference. First operand has 279 places, 436 transitions, 7348 flow. Second operand 8 states and 149 transitions. [2024-06-20 19:56:08,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 475 transitions, 8835 flow [2024-06-20 19:56:09,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 475 transitions, 8729 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-06-20 19:56:09,445 INFO L231 Difference]: Finished difference. Result has 287 places, 457 transitions, 7748 flow [2024-06-20 19:56:09,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7242, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7748, PETRI_PLACES=287, PETRI_TRANSITIONS=457} [2024-06-20 19:56:09,446 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places. [2024-06-20 19:56:09,446 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 457 transitions, 7748 flow [2024-06-20 19:56:09,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:09,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:09,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:56:09,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:56:09,447 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:56:09,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash -220749733, now seen corresponding path program 3 times [2024-06-20 19:56:09,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:09,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562960531] [2024-06-20 19:56:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:09,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562960531] [2024-06-20 19:56:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562960531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:19,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:56:19,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331382632] [2024-06-20 19:56:19,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:19,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:56:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:19,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:56:19,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:56:19,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:56:19,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 457 transitions, 7748 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:19,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:19,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:56:19,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:21,697 INFO L124 PetriNetUnfolderBase]: 3413/5397 cut-off events. [2024-06-20 19:56:21,697 INFO L125 PetriNetUnfolderBase]: For 433785/433785 co-relation queries the response was YES. [2024-06-20 19:56:21,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51177 conditions, 5397 events. 3413/5397 cut-off events. For 433785/433785 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 32535 event pairs, 644 based on Foata normal form. 8/5403 useless extension candidates. Maximal degree in co-relation 51036. Up to 5049 conditions per place. [2024-06-20 19:56:21,757 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 426 selfloop transitions, 46 changer transitions 0/477 dead transitions. [2024-06-20 19:56:21,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 477 transitions, 8860 flow [2024-06-20 19:56:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-20 19:56:21,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 19:56:21,758 INFO L175 Difference]: Start difference. First operand has 287 places, 457 transitions, 7748 flow. Second operand 8 states and 144 transitions. [2024-06-20 19:56:21,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 477 transitions, 8860 flow [2024-06-20 19:56:22,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 477 transitions, 8716 flow, removed 57 selfloop flow, removed 2 redundant places. [2024-06-20 19:56:22,579 INFO L231 Difference]: Finished difference. Result has 293 places, 460 transitions, 7792 flow [2024-06-20 19:56:22,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7604, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7792, PETRI_PLACES=293, PETRI_TRANSITIONS=460} [2024-06-20 19:56:22,580 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 251 predicate places. [2024-06-20 19:56:22,580 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 460 transitions, 7792 flow [2024-06-20 19:56:22,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:22,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:22,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:56:22,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:56:22,581 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:56:22,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash -220740805, now seen corresponding path program 1 times [2024-06-20 19:56:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100885451] [2024-06-20 19:56:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100885451] [2024-06-20 19:56:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100885451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:35,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:35,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:56:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413279105] [2024-06-20 19:56:35,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:35,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:56:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:35,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:56:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:56:35,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:56:35,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 460 transitions, 7792 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:35,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:35,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:56:35,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:38,159 INFO L124 PetriNetUnfolderBase]: 3457/5473 cut-off events. [2024-06-20 19:56:38,159 INFO L125 PetriNetUnfolderBase]: For 454837/454837 co-relation queries the response was YES. [2024-06-20 19:56:38,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51876 conditions, 5473 events. 3457/5473 cut-off events. For 454837/454837 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 33137 event pairs, 660 based on Foata normal form. 12/5483 useless extension candidates. Maximal degree in co-relation 51732. Up to 4992 conditions per place. [2024-06-20 19:56:38,218 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 422 selfloop transitions, 59 changer transitions 0/486 dead transitions. [2024-06-20 19:56:38,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 486 transitions, 8996 flow [2024-06-20 19:56:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 19:56:38,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 19:56:38,219 INFO L175 Difference]: Start difference. First operand has 293 places, 460 transitions, 7792 flow. Second operand 8 states and 152 transitions. [2024-06-20 19:56:38,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 486 transitions, 8996 flow [2024-06-20 19:56:39,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 486 transitions, 8804 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-20 19:56:39,092 INFO L231 Difference]: Finished difference. Result has 295 places, 461 transitions, 7743 flow [2024-06-20 19:56:39,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7600, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7743, PETRI_PLACES=295, PETRI_TRANSITIONS=461} [2024-06-20 19:56:39,093 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 253 predicate places. [2024-06-20 19:56:39,093 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 461 transitions, 7743 flow [2024-06-20 19:56:39,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:39,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:39,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:56:39,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:56:39,094 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:56:39,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 627341821, now seen corresponding path program 4 times [2024-06-20 19:56:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790534917] [2024-06-20 19:56:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:56:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:56:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:56:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790534917] [2024-06-20 19:56:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790534917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:56:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:56:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:56:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745408691] [2024-06-20 19:56:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:56:49,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:56:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:56:49,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:56:49,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:56:50,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:56:50,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 461 transitions, 7743 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:50,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:56:50,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:56:50,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:56:52,179 INFO L124 PetriNetUnfolderBase]: 3465/5510 cut-off events. [2024-06-20 19:56:52,179 INFO L125 PetriNetUnfolderBase]: For 452714/452714 co-relation queries the response was YES. [2024-06-20 19:56:52,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51916 conditions, 5510 events. 3465/5510 cut-off events. For 452714/452714 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 33661 event pairs, 610 based on Foata normal form. 8/5512 useless extension candidates. Maximal degree in co-relation 51772. Up to 4114 conditions per place. [2024-06-20 19:56:52,244 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 309 selfloop transitions, 180 changer transitions 0/494 dead transitions. [2024-06-20 19:56:52,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 494 transitions, 9403 flow [2024-06-20 19:56:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:56:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:56:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-20 19:56:52,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-20 19:56:52,245 INFO L175 Difference]: Start difference. First operand has 295 places, 461 transitions, 7743 flow. Second operand 8 states and 159 transitions. [2024-06-20 19:56:52,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 494 transitions, 9403 flow [2024-06-20 19:56:53,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 494 transitions, 9284 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:56:53,259 INFO L231 Difference]: Finished difference. Result has 297 places, 464 transitions, 8075 flow [2024-06-20 19:56:53,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7624, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8075, PETRI_PLACES=297, PETRI_TRANSITIONS=464} [2024-06-20 19:56:53,260 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places. [2024-06-20 19:56:53,260 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 464 transitions, 8075 flow [2024-06-20 19:56:53,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:56:53,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:56:53,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:56:53,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:56:53,260 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:56:53,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:56:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash 627341635, now seen corresponding path program 3 times [2024-06-20 19:56:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:56:53,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006250984] [2024-06-20 19:56:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:56:53,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:56:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:57:03,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:03,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006250984] [2024-06-20 19:57:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006250984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:03,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:57:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711483114] [2024-06-20 19:57:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:57:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:57:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:57:03,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:57:03,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 464 transitions, 8075 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:03,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:03,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:57:03,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:57:05,961 INFO L124 PetriNetUnfolderBase]: 3475/5504 cut-off events. [2024-06-20 19:57:05,961 INFO L125 PetriNetUnfolderBase]: For 456349/456349 co-relation queries the response was YES. [2024-06-20 19:57:05,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52912 conditions, 5504 events. 3475/5504 cut-off events. For 456349/456349 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 33448 event pairs, 681 based on Foata normal form. 2/5499 useless extension candidates. Maximal degree in co-relation 52767. Up to 4887 conditions per place. [2024-06-20 19:57:06,022 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 369 selfloop transitions, 117 changer transitions 0/491 dead transitions. [2024-06-20 19:57:06,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 491 transitions, 9577 flow [2024-06-20 19:57:06,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:57:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:57:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 19:57:06,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 19:57:06,023 INFO L175 Difference]: Start difference. First operand has 297 places, 464 transitions, 8075 flow. Second operand 8 states and 152 transitions. [2024-06-20 19:57:06,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 491 transitions, 9577 flow [2024-06-20 19:57:06,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 491 transitions, 8943 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-20 19:57:06,941 INFO L231 Difference]: Finished difference. Result has 297 places, 469 transitions, 7805 flow [2024-06-20 19:57:06,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7447, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7805, PETRI_PLACES=297, PETRI_TRANSITIONS=469} [2024-06-20 19:57:06,942 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places. [2024-06-20 19:57:06,942 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 469 transitions, 7805 flow [2024-06-20 19:57:06,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:06,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:06,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:57:06,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:57:06,942 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:57:06,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash -506817275, now seen corresponding path program 4 times [2024-06-20 19:57:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843099586] [2024-06-20 19:57:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:17,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-20 19:57:17,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843099586] [2024-06-20 19:57:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843099586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:17,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:17,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:57:17,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441228588] [2024-06-20 19:57:17,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:17,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:57:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:57:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:57:17,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:57:17,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 469 transitions, 7805 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:17,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:17,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:57:17,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:57:19,999 INFO L124 PetriNetUnfolderBase]: 3469/5486 cut-off events. [2024-06-20 19:57:19,999 INFO L125 PetriNetUnfolderBase]: For 457773/457773 co-relation queries the response was YES. [2024-06-20 19:57:20,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51550 conditions, 5486 events. 3469/5486 cut-off events. For 457773/457773 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 33299 event pairs, 664 based on Foata normal form. 2/5481 useless extension candidates. Maximal degree in co-relation 51406. Up to 4882 conditions per place. [2024-06-20 19:57:20,062 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 352 selfloop transitions, 130 changer transitions 0/487 dead transitions. [2024-06-20 19:57:20,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 487 transitions, 8976 flow [2024-06-20 19:57:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:57:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:57:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-20 19:57:20,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-20 19:57:20,063 INFO L175 Difference]: Start difference. First operand has 297 places, 469 transitions, 7805 flow. Second operand 8 states and 151 transitions. [2024-06-20 19:57:20,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 487 transitions, 8976 flow [2024-06-20 19:57:20,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 487 transitions, 8610 flow, removed 66 selfloop flow, removed 6 redundant places. [2024-06-20 19:57:20,919 INFO L231 Difference]: Finished difference. Result has 299 places, 469 transitions, 7723 flow [2024-06-20 19:57:20,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7455, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7723, PETRI_PLACES=299, PETRI_TRANSITIONS=469} [2024-06-20 19:57:20,920 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2024-06-20 19:57:20,920 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 469 transitions, 7723 flow [2024-06-20 19:57:20,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:20,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:20,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:57:20,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:57:20,920 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:57:20,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash -764478239, now seen corresponding path program 5 times [2024-06-20 19:57:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807248202] [2024-06-20 19:57:20,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:57:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807248202] [2024-06-20 19:57:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807248202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:57:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647391810] [2024-06-20 19:57:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:31,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:57:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:57:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:57:31,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:57:31,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 469 transitions, 7723 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:31,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:31,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:57:31,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:57:34,007 INFO L124 PetriNetUnfolderBase]: 3477/5508 cut-off events. [2024-06-20 19:57:34,008 INFO L125 PetriNetUnfolderBase]: For 472012/472012 co-relation queries the response was YES. [2024-06-20 19:57:34,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51392 conditions, 5508 events. 3477/5508 cut-off events. For 472012/472012 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 33448 event pairs, 618 based on Foata normal form. 8/5514 useless extension candidates. Maximal degree in co-relation 51247. Up to 4998 conditions per place. [2024-06-20 19:57:34,068 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 434 selfloop transitions, 59 changer transitions 0/498 dead transitions. [2024-06-20 19:57:34,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 498 transitions, 9245 flow [2024-06-20 19:57:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:57:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:57:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-20 19:57:34,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-20 19:57:34,069 INFO L175 Difference]: Start difference. First operand has 299 places, 469 transitions, 7723 flow. Second operand 9 states and 169 transitions. [2024-06-20 19:57:34,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 498 transitions, 9245 flow [2024-06-20 19:57:34,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 498 transitions, 8999 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-20 19:57:34,978 INFO L231 Difference]: Finished difference. Result has 303 places, 472 transitions, 7657 flow [2024-06-20 19:57:34,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7477, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7657, PETRI_PLACES=303, PETRI_TRANSITIONS=472} [2024-06-20 19:57:34,979 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 261 predicate places. [2024-06-20 19:57:34,979 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 472 transitions, 7657 flow [2024-06-20 19:57:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:34,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:34,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:57:34,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:57:34,980 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:57:34,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash 575634819, now seen corresponding path program 6 times [2024-06-20 19:57:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:34,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650396619] [2024-06-20 19:57:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:57:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:57:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:57:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650396619] [2024-06-20 19:57:45,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650396619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:57:45,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:57:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:57:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756824250] [2024-06-20 19:57:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:57:45,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:57:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:57:45,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:57:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:57:45,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 19:57:45,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 472 transitions, 7657 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:45,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:57:45,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 19:57:45,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:57:48,038 INFO L124 PetriNetUnfolderBase]: 3485/5521 cut-off events. [2024-06-20 19:57:48,038 INFO L125 PetriNetUnfolderBase]: For 475588/475588 co-relation queries the response was YES. [2024-06-20 19:57:48,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51363 conditions, 5521 events. 3485/5521 cut-off events. For 475588/475588 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 33493 event pairs, 609 based on Foata normal form. 8/5527 useless extension candidates. Maximal degree in co-relation 51217. Up to 4703 conditions per place. [2024-06-20 19:57:48,097 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 394 selfloop transitions, 109 changer transitions 0/508 dead transitions. [2024-06-20 19:57:48,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 508 transitions, 9306 flow [2024-06-20 19:57:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:57:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:57:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-20 19:57:48,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 19:57:48,098 INFO L175 Difference]: Start difference. First operand has 303 places, 472 transitions, 7657 flow. Second operand 8 states and 164 transitions. [2024-06-20 19:57:48,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 508 transitions, 9306 flow [2024-06-20 19:57:48,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 508 transitions, 9151 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-20 19:57:48,940 INFO L231 Difference]: Finished difference. Result has 304 places, 475 transitions, 7804 flow [2024-06-20 19:57:48,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7502, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7804, PETRI_PLACES=304, PETRI_TRANSITIONS=475} [2024-06-20 19:57:48,941 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 262 predicate places. [2024-06-20 19:57:48,941 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 475 transitions, 7804 flow [2024-06-20 19:57:48,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:57:48,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:57:48,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:57:48,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:57:48,942 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:57:48,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:57:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1685187621, now seen corresponding path program 7 times [2024-06-20 19:57:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:57:48,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599406527] [2024-06-20 19:57:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:57:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:57:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15