./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.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/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/safe031_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe031_power.oepc_pso.oepc_rmo.oepc.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-cde23df-m [2024-06-14 16:08:17,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 16:08:17,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 16:08:17,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 16:08:17,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 16:08:17,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 16:08:17,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 16:08:17,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 16:08:17,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 16:08:17,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 16:08:17,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 16:08:17,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 16:08:17,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 16:08:17,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 16:08:17,306 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 16:08:17,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 16:08:17,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 16:08:17,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 16:08:17,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 16:08:17,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 16:08:17,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 16:08:17,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 16:08:17,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 16:08:17,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 16:08:17,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 16:08:17,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 16:08:17,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 16:08:17,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 16:08:17,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 16:08:17,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 16:08:17,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 16:08:17,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 16:08:17,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:08:17,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 16:08:17,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 16:08:17,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 16:08:17,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 16:08:17,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 16:08:17,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 16:08:17,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 16:08:17,311 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 16:08:17,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 16:08:17,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 16:08:17,312 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-14 16:08:17,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 16:08:17,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 16:08:17,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 16:08:17,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 16:08:17,569 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 16:08:17,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 16:08:18,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 16:08:18,867 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 16:08:18,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 16:08:18,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1c079e2/5f939b97b514439d9e247faeb4dbf3c6/FLAGea0ffc47d [2024-06-14 16:08:18,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1c079e2/5f939b97b514439d9e247faeb4dbf3c6 [2024-06-14 16:08:18,900 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 16:08:18,901 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 16:08:18,902 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/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-14 16:08:19,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 16:08:19,042 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 16:08:19,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 16:08:19,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 16:08:19,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 16:08:19,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:08:18" (1/2) ... [2024-06-14 16:08:19,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350923a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:19, skipping insertion in model container [2024-06-14 16:08:19,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:08:18" (1/2) ... [2024-06-14 16:08:19,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b0ba696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:19, skipping insertion in model container [2024-06-14 16:08:19,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:19" (2/2) ... [2024-06-14 16:08:19,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350923a1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19, skipping insertion in model container [2024-06-14 16:08:19,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:19" (2/2) ... [2024-06-14 16:08:19,052 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 16:08:19,114 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 16:08:19,115 INFO L97 edCorrectnessWitness]: Location invariant before [L832-L832] (((((((((((((((((! 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 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 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 )z >= 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 )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 )z >= 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 )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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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 )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 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 )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 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 )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 || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 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)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-14 16:08:19,116 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! 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 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 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 )z >= 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 )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 )z >= 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 )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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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 )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 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 )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 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 )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 || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 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)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-14 16:08:19,116 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] (((((((((((((((((! 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 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 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$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 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 )z >= 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 )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 )z >= 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 )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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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 )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 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 )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 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 )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 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 )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 || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 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)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-06-14 16:08:19,117 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 16:08:19,117 INFO L106 edCorrectnessWitness]: ghost_update [L830-L830] multithreaded = 1; [2024-06-14 16:08:19,171 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 16:08:19,474 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:08:19,490 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 16:08:19,771 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:08:19,807 INFO L206 MainTranslator]: Completed translation [2024-06-14 16:08:19,808 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19 WrapperNode [2024-06-14 16:08:19,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 16:08:19,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 16:08:19,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 16:08:19,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 16:08:19,816 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 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:19,863 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 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:19,965 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 124 [2024-06-14 16:08:19,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 16:08:19,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 16:08:19,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 16:08:19,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 16:08:20,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,098 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-14 16:08:20,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 16:08:20,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 16:08:20,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 16:08:20,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 16:08:20,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (1/1) ... [2024-06-14 16:08:20,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:08:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 16:08:20,245 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-14 16:08:20,268 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-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 16:08:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 16:08:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 16:08:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 16:08:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 16:08:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 16:08:20,299 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 16:08:20,468 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 16:08:20,470 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 16:08:21,510 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 16:08:21,512 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 16:08:21,771 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 16:08:21,771 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 16:08:21,772 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:08:21 BoogieIcfgContainer [2024-06-14 16:08:21,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 16:08:21,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 16:08:21,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 16:08:21,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 16:08:21,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 04:08:18" (1/4) ... [2024-06-14 16:08:21,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d29aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:08:21, skipping insertion in model container [2024-06-14 16:08:21,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:19" (2/4) ... [2024-06-14 16:08:21,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d29aa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:08:21, skipping insertion in model container [2024-06-14 16:08:21,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:19" (3/4) ... [2024-06-14 16:08:21,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d29aa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:08:21, skipping insertion in model container [2024-06-14 16:08:21,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:08:21" (4/4) ... [2024-06-14 16:08:21,780 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 16:08:21,793 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 16:08:21,793 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 16:08:21,793 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 16:08:21,893 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 16:08:21,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 16:08:21,957 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-14 16:08:21,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 16:08:21,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 16:08:21,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 16:08:21,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-14 16:08:21,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 16:08:21,973 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;@5532d4be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 16:08:21,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 16:08:21,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 16:08:21,979 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 16:08:21,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 16:08:21,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:21,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 16:08:21,980 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-14 16:08:21,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1673967918, now seen corresponding path program 1 times [2024-06-14 16:08:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154450548] [2024-06-14 16:08:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:26,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:26,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154450548] [2024-06-14 16:08:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154450548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:26,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:26,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 16:08:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908048176] [2024-06-14 16:08:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:26,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 16:08:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:26,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 16:08:26,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 16:08:26,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 16:08:26,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:26,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:26,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 16:08:26,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:27,696 INFO L124 PetriNetUnfolderBase]: 1359/2058 cut-off events. [2024-06-14 16:08:27,697 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-14 16:08:27,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4174 conditions, 2058 events. 1359/2058 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9772 event pairs, 941 based on Foata normal form. 1/2024 useless extension candidates. Maximal degree in co-relation 4159. Up to 2029 conditions per place. [2024-06-14 16:08:27,711 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-14 16:08:27,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 177 flow [2024-06-14 16:08:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 16:08:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 16:08:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-14 16:08:27,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-06-14 16:08:27,721 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 74 transitions. [2024-06-14 16:08:27,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 177 flow [2024-06-14 16:08:27,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 16:08:27,725 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-14 16:08:27,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-14 16:08:27,729 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-14 16:08:27,729 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-14 16:08:27,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:27,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:27,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:27,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 16:08:27,730 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-14 16:08:27,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1929611761, now seen corresponding path program 1 times [2024-06-14 16:08:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127353260] [2024-06-14 16:08:27,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:27,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:30,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127353260] [2024-06-14 16:08:30,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127353260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:30,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 16:08:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156196669] [2024-06-14 16:08:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:30,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 16:08:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 16:08:31,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 16:08:31,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 16:08:31,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:31,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:31,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 16:08:31,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:31,782 INFO L124 PetriNetUnfolderBase]: 1353/2049 cut-off events. [2024-06-14 16:08:31,782 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2024-06-14 16:08:31,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4707 conditions, 2049 events. 1353/2049 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9796 event pairs, 795 based on Foata normal form. 3/2051 useless extension candidates. Maximal degree in co-relation 4692. Up to 2005 conditions per place. [2024-06-14 16:08:31,793 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-14 16:08:31,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 244 flow [2024-06-14 16:08:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 16:08:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 16:08:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-14 16:08:31,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2024-06-14 16:08:31,797 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 95 transitions. [2024-06-14 16:08:31,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 244 flow [2024-06-14 16:08:31,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 16:08:31,800 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-14 16:08:31,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-14 16:08:31,801 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-14 16:08:31,801 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-14 16:08:31,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:31,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:31,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:31,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 16:08:31,804 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-14 16:08:31,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1068922608, now seen corresponding path program 1 times [2024-06-14 16:08:31,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:31,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008558162] [2024-06-14 16:08:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008558162] [2024-06-14 16:08:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008558162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:36,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:36,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 16:08:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951671708] [2024-06-14 16:08:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:36,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 16:08:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 16:08:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 16:08:36,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 16:08:36,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:36,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:36,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 16:08:36,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:36,984 INFO L124 PetriNetUnfolderBase]: 1347/2040 cut-off events. [2024-06-14 16:08:36,984 INFO L125 PetriNetUnfolderBase]: For 1131/1131 co-relation queries the response was YES. [2024-06-14 16:08:36,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 2040 events. 1347/2040 cut-off events. For 1131/1131 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9801 event pairs, 649 based on Foata normal form. 3/2042 useless extension candidates. Maximal degree in co-relation 5206. Up to 1981 conditions per place. [2024-06-14 16:08:36,997 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-14 16:08:36,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 322 flow [2024-06-14 16:08:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:08:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:08:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-14 16:08:37,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-06-14 16:08:37,001 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 116 transitions. [2024-06-14 16:08:37,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 322 flow [2024-06-14 16:08:37,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 16:08:37,005 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow [2024-06-14 16:08:37,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-14 16:08:37,006 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-06-14 16:08:37,006 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow [2024-06-14 16:08:37,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:37,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:37,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:37,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 16:08:37,007 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-14 16:08:37,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:37,008 INFO L85 PathProgramCache]: Analyzing trace with hash 267149839, now seen corresponding path program 1 times [2024-06-14 16:08:37,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590786756] [2024-06-14 16:08:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:43,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590786756] [2024-06-14 16:08:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590786756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:08:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734948461] [2024-06-14 16:08:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:08:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:08:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:08:43,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:08:43,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:43,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:43,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:08:43,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:44,595 INFO L124 PetriNetUnfolderBase]: 1342/2033 cut-off events. [2024-06-14 16:08:44,596 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-06-14 16:08:44,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 2033 events. 1342/2033 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9648 event pairs, 631 based on Foata normal form. 2/2034 useless extension candidates. Maximal degree in co-relation 5713. Up to 1995 conditions per place. [2024-06-14 16:08:44,606 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-06-14 16:08:44,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 318 flow [2024-06-14 16:08:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:08:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:08:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-06-14 16:08:44,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-14 16:08:44,609 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 5 states and 97 transitions. [2024-06-14 16:08:44,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 318 flow [2024-06-14 16:08:44,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 294 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 16:08:44,613 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 194 flow [2024-06-14 16:08:44,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-14 16:08:44,615 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-14 16:08:44,615 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 194 flow [2024-06-14 16:08:44,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:44,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:44,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:44,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 16:08:44,616 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-14 16:08:44,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash -737393617, now seen corresponding path program 1 times [2024-06-14 16:08:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:44,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600481660] [2024-06-14 16:08:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:49,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:49,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600481660] [2024-06-14 16:08:49,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600481660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:49,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:49,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:08:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018615165] [2024-06-14 16:08:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:49,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:08:49,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:08:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:08:49,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 16:08:49,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:49,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:49,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 16:08:49,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:49,962 INFO L124 PetriNetUnfolderBase]: 1333/2018 cut-off events. [2024-06-14 16:08:49,963 INFO L125 PetriNetUnfolderBase]: For 3143/3143 co-relation queries the response was YES. [2024-06-14 16:08:49,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 2018 events. 1333/2018 cut-off events. For 3143/3143 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9611 event pairs, 467 based on Foata normal form. 6/2023 useless extension candidates. Maximal degree in co-relation 6130. Up to 1929 conditions per place. [2024-06-14 16:08:49,975 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2024-06-14 16:08:49,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 404 flow [2024-06-14 16:08:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:08:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:08:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-14 16:08:49,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-14 16:08:49,979 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 194 flow. Second operand 6 states and 133 transitions. [2024-06-14 16:08:49,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 404 flow [2024-06-14 16:08:49,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 384 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 16:08:49,986 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 219 flow [2024-06-14 16:08:49,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-14 16:08:49,988 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2024-06-14 16:08:49,988 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 219 flow [2024-06-14 16:08:49,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:49,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:49,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 16:08:49,990 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-14 16:08:49,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash -299350990, now seen corresponding path program 1 times [2024-06-14 16:08:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095756614] [2024-06-14 16:08:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:08:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095756614] [2024-06-14 16:08:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095756614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:56,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:56,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:08:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411492838] [2024-06-14 16:08:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:56,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:08:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:08:56,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:08:56,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:08:56,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-14 16:08:56,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:56,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:08:56,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:57,222 INFO L124 PetriNetUnfolderBase]: 1335/2021 cut-off events. [2024-06-14 16:08:57,223 INFO L125 PetriNetUnfolderBase]: For 4349/4349 co-relation queries the response was YES. [2024-06-14 16:08:57,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6528 conditions, 2021 events. 1335/2021 cut-off events. For 4349/4349 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9543 event pairs, 569 based on Foata normal form. 3/2023 useless extension candidates. Maximal degree in co-relation 6508. Up to 1955 conditions per place. [2024-06-14 16:08:57,235 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 52 selfloop transitions, 17 changer transitions 0/74 dead transitions. [2024-06-14 16:08:57,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 473 flow [2024-06-14 16:08:57,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:08:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:08:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-14 16:08:57,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-14 16:08:57,237 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 219 flow. Second operand 6 states and 119 transitions. [2024-06-14 16:08:57,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 473 flow [2024-06-14 16:08:57,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 438 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 16:08:57,241 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 309 flow [2024-06-14 16:08:57,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2024-06-14 16:08:57,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-06-14 16:08:57,243 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 309 flow [2024-06-14 16:08:57,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-14 16:08:57,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:57,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:57,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 16:08:57,244 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-14 16:08:57,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -973676242, now seen corresponding path program 1 times [2024-06-14 16:08:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396159212] [2024-06-14 16:08:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:03,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396159212] [2024-06-14 16:09:03,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396159212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:03,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:09:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548983335] [2024-06-14 16:09:03,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:03,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:09:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:09:03,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:09:03,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:09:03,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 309 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-14 16:09:03,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:03,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:09:03,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:04,209 INFO L124 PetriNetUnfolderBase]: 1357/2063 cut-off events. [2024-06-14 16:09:04,210 INFO L125 PetriNetUnfolderBase]: For 6614/6614 co-relation queries the response was YES. [2024-06-14 16:09:04,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 2063 events. 1357/2063 cut-off events. For 6614/6614 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9748 event pairs, 556 based on Foata normal form. 4/2066 useless extension candidates. Maximal degree in co-relation 7405. Up to 1991 conditions per place. [2024-06-14 16:09:04,232 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2024-06-14 16:09:04,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 531 flow [2024-06-14 16:09:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:09:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:09:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 16:09:04,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 16:09:04,234 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 309 flow. Second operand 6 states and 117 transitions. [2024-06-14 16:09:04,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 531 flow [2024-06-14 16:09:04,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 515 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-14 16:09:04,239 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 353 flow [2024-06-14 16:09:04,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2024-06-14 16:09:04,240 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2024-06-14 16:09:04,241 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 353 flow [2024-06-14 16:09:04,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-14 16:09:04,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:04,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:04,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 16:09:04,241 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-14 16:09:04,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash -967010002, now seen corresponding path program 2 times [2024-06-14 16:09:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627879255] [2024-06-14 16:09:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627879255] [2024-06-14 16:09:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627879255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:09:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564722316] [2024-06-14 16:09:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:09:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:09:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:09:10,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:09:10,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-14 16:09:10,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:10,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:09:10,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:11,827 INFO L124 PetriNetUnfolderBase]: 1363/2067 cut-off events. [2024-06-14 16:09:11,827 INFO L125 PetriNetUnfolderBase]: For 8943/8943 co-relation queries the response was YES. [2024-06-14 16:09:11,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 2067 events. 1363/2067 cut-off events. For 8943/8943 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10002 event pairs, 552 based on Foata normal form. 4/2068 useless extension candidates. Maximal degree in co-relation 7962. Up to 1947 conditions per place. [2024-06-14 16:09:11,838 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 59 selfloop transitions, 21 changer transitions 0/85 dead transitions. [2024-06-14 16:09:11,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 651 flow [2024-06-14 16:09:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:09:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:09:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-14 16:09:11,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-14 16:09:11,841 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 353 flow. Second operand 6 states and 120 transitions. [2024-06-14 16:09:11,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 651 flow [2024-06-14 16:09:11,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 617 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 16:09:11,846 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 435 flow [2024-06-14 16:09:11,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2024-06-14 16:09:11,847 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-14 16:09:11,847 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 435 flow [2024-06-14 16:09:11,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-14 16:09:11,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:11,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:11,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 16:09:11,847 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-14 16:09:11,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash -967001074, now seen corresponding path program 1 times [2024-06-14 16:09:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:11,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392543880] [2024-06-14 16:09:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:19,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392543880] [2024-06-14 16:09:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392543880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:19,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:19,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:09:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083411581] [2024-06-14 16:09:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:19,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:09:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:09:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:09:19,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:09:19,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 435 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-14 16:09:19,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:19,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:09:19,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:20,450 INFO L124 PetriNetUnfolderBase]: 1365/2080 cut-off events. [2024-06-14 16:09:20,450 INFO L125 PetriNetUnfolderBase]: For 10835/10835 co-relation queries the response was YES. [2024-06-14 16:09:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8475 conditions, 2080 events. 1365/2080 cut-off events. For 10835/10835 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9966 event pairs, 518 based on Foata normal form. 3/2082 useless extension candidates. Maximal degree in co-relation 8447. Up to 1986 conditions per place. [2024-06-14 16:09:20,462 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 65 selfloop transitions, 21 changer transitions 0/91 dead transitions. [2024-06-14 16:09:20,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 723 flow [2024-06-14 16:09:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:09:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:09:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 16:09:20,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-14 16:09:20,463 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 435 flow. Second operand 7 states and 137 transitions. [2024-06-14 16:09:20,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 723 flow [2024-06-14 16:09:20,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 691 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-14 16:09:20,471 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 494 flow [2024-06-14 16:09:20,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-06-14 16:09:20,472 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-14 16:09:20,472 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 494 flow [2024-06-14 16:09:20,474 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-14 16:09:20,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:20,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:20,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 16:09:20,474 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-14 16:09:20,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash -119191137, now seen corresponding path program 1 times [2024-06-14 16:09:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:20,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915389760] [2024-06-14 16:09:20,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:20,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:26,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:26,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915389760] [2024-06-14 16:09:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915389760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:26,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:09:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119900220] [2024-06-14 16:09:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:26,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:09:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:09:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:09:27,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:09:27,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 494 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-14 16:09:27,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:27,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:09:27,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:27,961 INFO L124 PetriNetUnfolderBase]: 1501/2282 cut-off events. [2024-06-14 16:09:27,961 INFO L125 PetriNetUnfolderBase]: For 13201/13201 co-relation queries the response was YES. [2024-06-14 16:09:27,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9835 conditions, 2282 events. 1501/2282 cut-off events. For 13201/13201 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11087 event pairs, 506 based on Foata normal form. 10/2291 useless extension candidates. Maximal degree in co-relation 9805. Up to 2058 conditions per place. [2024-06-14 16:09:27,974 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 85 selfloop transitions, 29 changer transitions 0/119 dead transitions. [2024-06-14 16:09:27,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 994 flow [2024-06-14 16:09:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:09:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:09:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-14 16:09:27,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-14 16:09:27,976 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 494 flow. Second operand 8 states and 164 transitions. [2024-06-14 16:09:27,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 994 flow [2024-06-14 16:09:27,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 933 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 16:09:27,984 INFO L231 Difference]: Finished difference. Result has 75 places, 88 transitions, 673 flow [2024-06-14 16:09:27,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=75, PETRI_TRANSITIONS=88} [2024-06-14 16:09:27,985 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2024-06-14 16:09:27,985 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 88 transitions, 673 flow [2024-06-14 16:09:27,985 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-14 16:09:27,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:27,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:27,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 16:09:27,986 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-14 16:09:27,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 86539921, now seen corresponding path program 2 times [2024-06-14 16:09:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407096194] [2024-06-14 16:09:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:34,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:34,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407096194] [2024-06-14 16:09:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407096194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:34,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:34,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:09:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098415973] [2024-06-14 16:09:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:34,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:09:34,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:09:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:09:34,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:09:34,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 88 transitions, 673 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-14 16:09:34,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:34,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:09:34,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:36,024 INFO L124 PetriNetUnfolderBase]: 1725/2622 cut-off events. [2024-06-14 16:09:36,025 INFO L125 PetriNetUnfolderBase]: For 19890/19890 co-relation queries the response was YES. [2024-06-14 16:09:36,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13082 conditions, 2622 events. 1725/2622 cut-off events. For 19890/19890 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13069 event pairs, 520 based on Foata normal form. 10/2631 useless extension candidates. Maximal degree in co-relation 13048. Up to 2028 conditions per place. [2024-06-14 16:09:36,041 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 90 selfloop transitions, 47 changer transitions 0/142 dead transitions. [2024-06-14 16:09:36,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 142 transitions, 1329 flow [2024-06-14 16:09:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:09:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:09:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-14 16:09:36,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-06-14 16:09:36,043 INFO L175 Difference]: Start difference. First operand has 75 places, 88 transitions, 673 flow. Second operand 8 states and 174 transitions. [2024-06-14 16:09:36,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 142 transitions, 1329 flow [2024-06-14 16:09:36,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 142 transitions, 1271 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-14 16:09:36,060 INFO L231 Difference]: Finished difference. Result has 82 places, 102 transitions, 913 flow [2024-06-14 16:09:36,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=913, PETRI_PLACES=82, PETRI_TRANSITIONS=102} [2024-06-14 16:09:36,061 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2024-06-14 16:09:36,061 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 102 transitions, 913 flow [2024-06-14 16:09:36,061 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-14 16:09:36,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:36,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:36,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 16:09:36,062 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-14 16:09:36,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:36,062 INFO L85 PathProgramCache]: Analyzing trace with hash 86273011, now seen corresponding path program 3 times [2024-06-14 16:09:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:36,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547313718] [2024-06-14 16:09:36,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:42,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547313718] [2024-06-14 16:09:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547313718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:42,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:09:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471844922] [2024-06-14 16:09:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:42,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:09:42,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:09:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:09:42,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:09:42,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 102 transitions, 913 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-14 16:09:42,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:42,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:09:42,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:43,840 INFO L124 PetriNetUnfolderBase]: 1805/2754 cut-off events. [2024-06-14 16:09:43,840 INFO L125 PetriNetUnfolderBase]: For 25073/25073 co-relation queries the response was YES. [2024-06-14 16:09:43,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15112 conditions, 2754 events. 1805/2754 cut-off events. For 25073/25073 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13907 event pairs, 563 based on Foata normal form. 10/2763 useless extension candidates. Maximal degree in co-relation 15075. Up to 2082 conditions per place. [2024-06-14 16:09:43,858 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 92 selfloop transitions, 51 changer transitions 0/148 dead transitions. [2024-06-14 16:09:43,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 148 transitions, 1511 flow [2024-06-14 16:09:43,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:09:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:09:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-06-14 16:09:43,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2024-06-14 16:09:43,860 INFO L175 Difference]: Start difference. First operand has 82 places, 102 transitions, 913 flow. Second operand 8 states and 173 transitions. [2024-06-14 16:09:43,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 148 transitions, 1511 flow [2024-06-14 16:09:43,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1446 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-14 16:09:43,881 INFO L231 Difference]: Finished difference. Result has 89 places, 112 transitions, 1120 flow [2024-06-14 16:09:43,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1120, PETRI_PLACES=89, PETRI_TRANSITIONS=112} [2024-06-14 16:09:43,882 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2024-06-14 16:09:43,882 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 112 transitions, 1120 flow [2024-06-14 16:09:43,882 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-14 16:09:43,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:43,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:43,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 16:09:43,883 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-14 16:09:43,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash 86549841, now seen corresponding path program 1 times [2024-06-14 16:09:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988534897] [2024-06-14 16:09:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988534897] [2024-06-14 16:09:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988534897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:09:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400234753] [2024-06-14 16:09:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:51,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:09:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:09:51,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:09:51,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:09:51,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 112 transitions, 1120 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-14 16:09:51,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:51,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:09:51,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:52,631 INFO L124 PetriNetUnfolderBase]: 1808/2759 cut-off events. [2024-06-14 16:09:52,631 INFO L125 PetriNetUnfolderBase]: For 29045/29045 co-relation queries the response was YES. [2024-06-14 16:09:52,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16099 conditions, 2759 events. 1808/2759 cut-off events. For 29045/29045 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13872 event pairs, 601 based on Foata normal form. 6/2764 useless extension candidates. Maximal degree in co-relation 16058. Up to 2581 conditions per place. [2024-06-14 16:09:52,650 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 112 selfloop transitions, 24 changer transitions 0/141 dead transitions. [2024-06-14 16:09:52,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 141 transitions, 1556 flow [2024-06-14 16:09:52,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:09:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:09:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 16:09:52,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-14 16:09:52,651 INFO L175 Difference]: Start difference. First operand has 89 places, 112 transitions, 1120 flow. Second operand 8 states and 155 transitions. [2024-06-14 16:09:52,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 141 transitions, 1556 flow [2024-06-14 16:09:52,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 141 transitions, 1485 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-14 16:09:52,680 INFO L231 Difference]: Finished difference. Result has 94 places, 115 transitions, 1163 flow [2024-06-14 16:09:52,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1163, PETRI_PLACES=94, PETRI_TRANSITIONS=115} [2024-06-14 16:09:52,681 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2024-06-14 16:09:52,681 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1163 flow [2024-06-14 16:09:52,681 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-14 16:09:52,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:52,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:52,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 16:09:52,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:09:52,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -698979012, now seen corresponding path program 1 times [2024-06-14 16:09:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000720361] [2024-06-14 16:09:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:52,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000720361] [2024-06-14 16:10:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000720361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:01,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:10:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536554374] [2024-06-14 16:10:01,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:10:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:10:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:10:01,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:10:01,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1163 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:01,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:01,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:10:01,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:02,913 INFO L124 PetriNetUnfolderBase]: 1805/2753 cut-off events. [2024-06-14 16:10:02,913 INFO L125 PetriNetUnfolderBase]: For 30835/30835 co-relation queries the response was YES. [2024-06-14 16:10:02,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16319 conditions, 2753 events. 1805/2753 cut-off events. For 30835/30835 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13850 event pairs, 624 based on Foata normal form. 1/2753 useless extension candidates. Maximal degree in co-relation 16276. Up to 2650 conditions per place. [2024-06-14 16:10:02,931 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 110 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2024-06-14 16:10:02,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 1419 flow [2024-06-14 16:10:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:10:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:10:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-14 16:10:02,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-14 16:10:02,932 INFO L175 Difference]: Start difference. First operand has 94 places, 115 transitions, 1163 flow. Second operand 5 states and 92 transitions. [2024-06-14 16:10:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 1419 flow [2024-06-14 16:10:02,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 123 transitions, 1321 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:02,958 INFO L231 Difference]: Finished difference. Result has 93 places, 115 transitions, 1087 flow [2024-06-14 16:10:02,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1087, PETRI_PLACES=93, PETRI_TRANSITIONS=115} [2024-06-14 16:10:02,958 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-14 16:10:02,959 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 115 transitions, 1087 flow [2024-06-14 16:10:02,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:02,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:02,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:02,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 16:10:02,960 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-14 16:10:02,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 595274829, now seen corresponding path program 1 times [2024-06-14 16:10:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:02,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697623708] [2024-06-14 16:10:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697623708] [2024-06-14 16:10:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697623708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:09,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:09,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:10:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141480757] [2024-06-14 16:10:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:09,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:10:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:09,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:10:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:10:09,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:10:09,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 115 transitions, 1087 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-14 16:10:09,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:09,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:10:09,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:10,284 INFO L124 PetriNetUnfolderBase]: 1800/2746 cut-off events. [2024-06-14 16:10:10,284 INFO L125 PetriNetUnfolderBase]: For 32503/32503 co-relation queries the response was YES. [2024-06-14 16:10:10,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16183 conditions, 2746 events. 1800/2746 cut-off events. For 32503/32503 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13788 event pairs, 621 based on Foata normal form. 2/2747 useless extension candidates. Maximal degree in co-relation 16139. Up to 2607 conditions per place. [2024-06-14 16:10:10,301 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 121 selfloop transitions, 14 changer transitions 0/140 dead transitions. [2024-06-14 16:10:10,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 140 transitions, 1421 flow [2024-06-14 16:10:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:10:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:10:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-14 16:10:10,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-14 16:10:10,304 INFO L175 Difference]: Start difference. First operand has 93 places, 115 transitions, 1087 flow. Second operand 7 states and 136 transitions. [2024-06-14 16:10:10,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 140 transitions, 1421 flow [2024-06-14 16:10:10,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 1389 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 16:10:10,328 INFO L231 Difference]: Finished difference. Result has 96 places, 115 transitions, 1091 flow [2024-06-14 16:10:10,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1091, PETRI_PLACES=96, PETRI_TRANSITIONS=115} [2024-06-14 16:10:10,329 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2024-06-14 16:10:10,329 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 115 transitions, 1091 flow [2024-06-14 16:10:10,329 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-14 16:10:10,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:10,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:10,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 16:10:10,330 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:10:10,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1848403781, now seen corresponding path program 1 times [2024-06-14 16:10:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089519987] [2024-06-14 16:10:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:17,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089519987] [2024-06-14 16:10:17,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089519987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:17,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:17,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692851515] [2024-06-14 16:10:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:17,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:17,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:17,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:18,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:10:18,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 115 transitions, 1091 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-14 16:10:18,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:18,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:10:18,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:19,165 INFO L124 PetriNetUnfolderBase]: 1864/2840 cut-off events. [2024-06-14 16:10:19,165 INFO L125 PetriNetUnfolderBase]: For 36258/36258 co-relation queries the response was YES. [2024-06-14 16:10:19,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16870 conditions, 2840 events. 1864/2840 cut-off events. For 36258/36258 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14361 event pairs, 548 based on Foata normal form. 10/2849 useless extension candidates. Maximal degree in co-relation 16826. Up to 2524 conditions per place. [2024-06-14 16:10:19,182 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 116 selfloop transitions, 34 changer transitions 0/155 dead transitions. [2024-06-14 16:10:19,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 155 transitions, 1657 flow [2024-06-14 16:10:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-14 16:10:19,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2024-06-14 16:10:19,183 INFO L175 Difference]: Start difference. First operand has 96 places, 115 transitions, 1091 flow. Second operand 8 states and 171 transitions. [2024-06-14 16:10:19,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 155 transitions, 1657 flow [2024-06-14 16:10:19,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 155 transitions, 1607 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:19,212 INFO L231 Difference]: Finished difference. Result has 98 places, 121 transitions, 1202 flow [2024-06-14 16:10:19,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1202, PETRI_PLACES=98, PETRI_TRANSITIONS=121} [2024-06-14 16:10:19,212 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-06-14 16:10:19,212 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 121 transitions, 1202 flow [2024-06-14 16:10:19,213 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-14 16:10:19,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:19,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:19,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 16:10:19,213 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-14 16:10:19,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1620502631, now seen corresponding path program 2 times [2024-06-14 16:10:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073417299] [2024-06-14 16:10:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073417299] [2024-06-14 16:10:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073417299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:26,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:26,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551548060] [2024-06-14 16:10:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:26,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:26,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:10:26,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 121 transitions, 1202 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-14 16:10:26,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:26,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:10:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:27,953 INFO L124 PetriNetUnfolderBase]: 1928/2931 cut-off events. [2024-06-14 16:10:27,954 INFO L125 PetriNetUnfolderBase]: For 41369/41369 co-relation queries the response was YES. [2024-06-14 16:10:27,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18465 conditions, 2931 events. 1928/2931 cut-off events. For 41369/41369 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14796 event pairs, 547 based on Foata normal form. 10/2939 useless extension candidates. Maximal degree in co-relation 18420. Up to 2216 conditions per place. [2024-06-14 16:10:27,972 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 101 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2024-06-14 16:10:27,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 160 transitions, 1808 flow [2024-06-14 16:10:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-14 16:10:27,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-06-14 16:10:27,974 INFO L175 Difference]: Start difference. First operand has 98 places, 121 transitions, 1202 flow. Second operand 8 states and 172 transitions. [2024-06-14 16:10:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 160 transitions, 1808 flow [2024-06-14 16:10:28,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 160 transitions, 1691 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:28,004 INFO L231 Difference]: Finished difference. Result has 100 places, 127 transitions, 1298 flow [2024-06-14 16:10:28,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1298, PETRI_PLACES=100, PETRI_TRANSITIONS=127} [2024-06-14 16:10:28,005 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-14 16:10:28,005 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 127 transitions, 1298 flow [2024-06-14 16:10:28,005 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-14 16:10:28,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:28,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:28,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 16:10:28,006 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-14 16:10:28,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1611931751, now seen corresponding path program 3 times [2024-06-14 16:10:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549030641] [2024-06-14 16:10:28,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:35,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549030641] [2024-06-14 16:10:35,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549030641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:35,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:35,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:35,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838239557] [2024-06-14 16:10:35,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:35,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:35,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:35,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:35,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:10:35,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 127 transitions, 1298 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-14 16:10:35,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:35,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:10:35,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:36,940 INFO L124 PetriNetUnfolderBase]: 2024/3063 cut-off events. [2024-06-14 16:10:36,940 INFO L125 PetriNetUnfolderBase]: For 48245/48245 co-relation queries the response was YES. [2024-06-14 16:10:36,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20252 conditions, 3063 events. 2024/3063 cut-off events. For 48245/48245 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15526 event pairs, 529 based on Foata normal form. 10/3071 useless extension candidates. Maximal degree in co-relation 20206. Up to 2168 conditions per place. [2024-06-14 16:10:36,961 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 97 selfloop transitions, 75 changer transitions 0/177 dead transitions. [2024-06-14 16:10:36,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 177 transitions, 2078 flow [2024-06-14 16:10:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:10:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:10:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-14 16:10:36,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-14 16:10:36,963 INFO L175 Difference]: Start difference. First operand has 100 places, 127 transitions, 1298 flow. Second operand 9 states and 195 transitions. [2024-06-14 16:10:36,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 177 transitions, 2078 flow [2024-06-14 16:10:37,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 177 transitions, 1911 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:37,003 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 1491 flow [2024-06-14 16:10:37,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1491, PETRI_PLACES=104, PETRI_TRANSITIONS=138} [2024-06-14 16:10:37,003 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2024-06-14 16:10:37,003 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 1491 flow [2024-06-14 16:10:37,004 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-14 16:10:37,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:37,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:37,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 16:10:37,004 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:10:37,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -193511713, now seen corresponding path program 1 times [2024-06-14 16:10:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946668711] [2024-06-14 16:10:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946668711] [2024-06-14 16:10:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946668711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:10:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924882166] [2024-06-14 16:10:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:10:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:10:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:10:48,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:10:48,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 1491 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-14 16:10:48,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:48,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:10:48,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:49,285 INFO L124 PetriNetUnfolderBase]: 2038/3112 cut-off events. [2024-06-14 16:10:49,286 INFO L125 PetriNetUnfolderBase]: For 54419/54419 co-relation queries the response was YES. [2024-06-14 16:10:49,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21703 conditions, 3112 events. 2038/3112 cut-off events. For 54419/54419 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15896 event pairs, 611 based on Foata normal form. 6/3117 useless extension candidates. Maximal degree in co-relation 21655. Up to 2888 conditions per place. [2024-06-14 16:10:49,308 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 138 selfloop transitions, 25 changer transitions 0/168 dead transitions. [2024-06-14 16:10:49,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 168 transitions, 2065 flow [2024-06-14 16:10:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 16:10:49,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 16:10:49,311 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 1491 flow. Second operand 8 states and 148 transitions. [2024-06-14 16:10:49,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 168 transitions, 2065 flow [2024-06-14 16:10:49,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 168 transitions, 1884 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-14 16:10:49,358 INFO L231 Difference]: Finished difference. Result has 108 places, 146 transitions, 1516 flow [2024-06-14 16:10:49,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1516, PETRI_PLACES=108, PETRI_TRANSITIONS=146} [2024-06-14 16:10:49,359 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2024-06-14 16:10:49,359 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 146 transitions, 1516 flow [2024-06-14 16:10:49,359 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-14 16:10:49,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:49,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:49,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 16:10:49,359 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:10:49,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1094257098, now seen corresponding path program 1 times [2024-06-14 16:10:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956831436] [2024-06-14 16:10:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:49,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:56,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-14 16:10:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956831436] [2024-06-14 16:10:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956831436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829494493] [2024-06-14 16:10:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:56,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:56,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:10:56,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 146 transitions, 1516 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-14 16:10:56,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:56,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:10:56,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:57,342 INFO L124 PetriNetUnfolderBase]: 2070/3149 cut-off events. [2024-06-14 16:10:57,342 INFO L125 PetriNetUnfolderBase]: For 58366/58366 co-relation queries the response was YES. [2024-06-14 16:10:57,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22207 conditions, 3149 events. 2070/3149 cut-off events. For 58366/58366 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16056 event pairs, 594 based on Foata normal form. 5/3153 useless extension candidates. Maximal degree in co-relation 22156. Up to 2908 conditions per place. [2024-06-14 16:10:57,367 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 155 selfloop transitions, 36 changer transitions 0/196 dead transitions. [2024-06-14 16:10:57,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 196 transitions, 2358 flow [2024-06-14 16:10:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-14 16:10:57,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2024-06-14 16:10:57,368 INFO L175 Difference]: Start difference. First operand has 108 places, 146 transitions, 1516 flow. Second operand 8 states and 171 transitions. [2024-06-14 16:10:57,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 196 transitions, 2358 flow [2024-06-14 16:10:57,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 196 transitions, 2298 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 16:10:57,412 INFO L231 Difference]: Finished difference. Result has 115 places, 162 transitions, 1848 flow [2024-06-14 16:10:57,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1848, PETRI_PLACES=115, PETRI_TRANSITIONS=162} [2024-06-14 16:10:57,412 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-14 16:10:57,412 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 162 transitions, 1848 flow [2024-06-14 16:10:57,413 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-14 16:10:57,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:57,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:57,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 16:10:57,413 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-14 16:10:57,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -621969168, now seen corresponding path program 1 times [2024-06-14 16:10:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:57,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791547952] [2024-06-14 16:10:57,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:05,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-14 16:11:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791547952] [2024-06-14 16:11:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791547952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444901073] [2024-06-14 16:11:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:05,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:05,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:11:05,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 162 transitions, 1848 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-14 16:11:05,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:05,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:11:05,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:07,072 INFO L124 PetriNetUnfolderBase]: 2382/3659 cut-off events. [2024-06-14 16:11:07,072 INFO L125 PetriNetUnfolderBase]: For 86781/86781 co-relation queries the response was YES. [2024-06-14 16:11:07,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26476 conditions, 3659 events. 2382/3659 cut-off events. For 86781/86781 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 19280 event pairs, 626 based on Foata normal form. 74/3732 useless extension candidates. Maximal degree in co-relation 26420. Up to 2868 conditions per place. [2024-06-14 16:11:07,100 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 167 selfloop transitions, 38 changer transitions 0/210 dead transitions. [2024-06-14 16:11:07,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 210 transitions, 2620 flow [2024-06-14 16:11:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:11:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:11:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2024-06-14 16:11:07,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-14 16:11:07,102 INFO L175 Difference]: Start difference. First operand has 115 places, 162 transitions, 1848 flow. Second operand 10 states and 207 transitions. [2024-06-14 16:11:07,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 210 transitions, 2620 flow [2024-06-14 16:11:07,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 210 transitions, 2467 flow, removed 71 selfloop flow, removed 2 redundant places. [2024-06-14 16:11:07,166 INFO L231 Difference]: Finished difference. Result has 123 places, 165 transitions, 1861 flow [2024-06-14 16:11:07,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1861, PETRI_PLACES=123, PETRI_TRANSITIONS=165} [2024-06-14 16:11:07,166 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places. [2024-06-14 16:11:07,167 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 165 transitions, 1861 flow [2024-06-14 16:11:07,167 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-14 16:11:07,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:07,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:07,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 16:11:07,167 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:11:07,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1779152757, now seen corresponding path program 1 times [2024-06-14 16:11:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527990773] [2024-06-14 16:11:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:11:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527990773] [2024-06-14 16:11:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527990773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:11:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392534186] [2024-06-14 16:11:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:11:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:11:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:11:18,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:11:18,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 165 transitions, 1861 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-14 16:11:18,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:18,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:11:18,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:19,984 INFO L124 PetriNetUnfolderBase]: 2392/3677 cut-off events. [2024-06-14 16:11:19,984 INFO L125 PetriNetUnfolderBase]: For 78939/78939 co-relation queries the response was YES. [2024-06-14 16:11:19,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27179 conditions, 3677 events. 2392/3677 cut-off events. For 78939/78939 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19438 event pairs, 712 based on Foata normal form. 2/3678 useless extension candidates. Maximal degree in co-relation 27120. Up to 3463 conditions per place. [2024-06-14 16:11:20,012 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 152 selfloop transitions, 33 changer transitions 0/190 dead transitions. [2024-06-14 16:11:20,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 190 transitions, 2460 flow [2024-06-14 16:11:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:11:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:11:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-14 16:11:20,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-14 16:11:20,013 INFO L175 Difference]: Start difference. First operand has 123 places, 165 transitions, 1861 flow. Second operand 7 states and 136 transitions. [2024-06-14 16:11:20,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 190 transitions, 2460 flow [2024-06-14 16:11:20,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 190 transitions, 2348 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 16:11:20,074 INFO L231 Difference]: Finished difference. Result has 122 places, 170 transitions, 1921 flow [2024-06-14 16:11:20,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1921, PETRI_PLACES=122, PETRI_TRANSITIONS=170} [2024-06-14 16:11:20,075 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-06-14 16:11:20,075 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 170 transitions, 1921 flow [2024-06-14 16:11:20,075 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-14 16:11:20,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:20,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:20,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 16:11:20,075 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-14 16:11:20,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1304027346, now seen corresponding path program 2 times [2024-06-14 16:11:20,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:20,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195030765] [2024-06-14 16:11:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:11:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195030765] [2024-06-14 16:11:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195030765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:27,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668934208] [2024-06-14 16:11:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:27,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:27,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:11:27,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 170 transitions, 1921 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-14 16:11:27,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:27,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:11:27,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:29,339 INFO L124 PetriNetUnfolderBase]: 2500/3907 cut-off events. [2024-06-14 16:11:29,339 INFO L125 PetriNetUnfolderBase]: For 84937/84937 co-relation queries the response was YES. [2024-06-14 16:11:29,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27995 conditions, 3907 events. 2500/3907 cut-off events. For 84937/84937 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21437 event pairs, 565 based on Foata normal form. 17/3922 useless extension candidates. Maximal degree in co-relation 27935. Up to 3252 conditions per place. [2024-06-14 16:11:29,369 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 196 selfloop transitions, 65 changer transitions 0/266 dead transitions. [2024-06-14 16:11:29,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 266 transitions, 3504 flow [2024-06-14 16:11:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-14 16:11:29,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105820105820106 [2024-06-14 16:11:29,372 INFO L175 Difference]: Start difference. First operand has 122 places, 170 transitions, 1921 flow. Second operand 9 states and 193 transitions. [2024-06-14 16:11:29,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 266 transitions, 3504 flow [2024-06-14 16:11:29,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 266 transitions, 3422 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 16:11:29,436 INFO L231 Difference]: Finished difference. Result has 132 places, 217 transitions, 2780 flow [2024-06-14 16:11:29,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2780, PETRI_PLACES=132, PETRI_TRANSITIONS=217} [2024-06-14 16:11:29,437 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places. [2024-06-14 16:11:29,437 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 217 transitions, 2780 flow [2024-06-14 16:11:29,437 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-14 16:11:29,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:29,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:29,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 16:11:29,437 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-14 16:11:29,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1560527856, now seen corresponding path program 3 times [2024-06-14 16:11:29,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:29,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660576007] [2024-06-14 16:11:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:11:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660576007] [2024-06-14 16:11:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660576007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:37,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425941420] [2024-06-14 16:11:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:37,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:37,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:11:37,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 217 transitions, 2780 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-14 16:11:37,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:37,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:11:37,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:38,827 INFO L124 PetriNetUnfolderBase]: 2616/4075 cut-off events. [2024-06-14 16:11:38,827 INFO L125 PetriNetUnfolderBase]: For 103499/103499 co-relation queries the response was YES. [2024-06-14 16:11:38,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31315 conditions, 4075 events. 2616/4075 cut-off events. For 103499/103499 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22385 event pairs, 575 based on Foata normal form. 17/4090 useless extension candidates. Maximal degree in co-relation 31249. Up to 3431 conditions per place. [2024-06-14 16:11:38,863 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 205 selfloop transitions, 73 changer transitions 0/283 dead transitions. [2024-06-14 16:11:38,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 283 transitions, 4067 flow [2024-06-14 16:11:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-14 16:11:38,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105820105820106 [2024-06-14 16:11:38,866 INFO L175 Difference]: Start difference. First operand has 132 places, 217 transitions, 2780 flow. Second operand 9 states and 193 transitions. [2024-06-14 16:11:38,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 283 transitions, 4067 flow [2024-06-14 16:11:39,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 283 transitions, 3923 flow, removed 71 selfloop flow, removed 1 redundant places. [2024-06-14 16:11:39,025 INFO L231 Difference]: Finished difference. Result has 144 places, 239 transitions, 3263 flow [2024-06-14 16:11:39,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2652, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3263, PETRI_PLACES=144, PETRI_TRANSITIONS=239} [2024-06-14 16:11:39,025 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2024-06-14 16:11:39,025 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 239 transitions, 3263 flow [2024-06-14 16:11:39,025 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-14 16:11:39,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:39,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:39,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 16:11:39,026 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:11:39,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1570051056, now seen corresponding path program 4 times [2024-06-14 16:11:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:39,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278448293] [2024-06-14 16:11:39,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:11:46,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:46,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278448293] [2024-06-14 16:11:46,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278448293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:46,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:46,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:46,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494174261] [2024-06-14 16:11:46,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:46,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:46,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:11:46,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 239 transitions, 3263 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-14 16:11:46,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:46,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:11:46,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:47,782 INFO L124 PetriNetUnfolderBase]: 2840/4455 cut-off events. [2024-06-14 16:11:47,782 INFO L125 PetriNetUnfolderBase]: For 130333/130333 co-relation queries the response was YES. [2024-06-14 16:11:47,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36020 conditions, 4455 events. 2840/4455 cut-off events. For 130333/130333 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25137 event pairs, 564 based on Foata normal form. 16/4469 useless extension candidates. Maximal degree in co-relation 35947. Up to 3090 conditions per place. [2024-06-14 16:11:47,823 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 205 selfloop transitions, 102 changer transitions 0/312 dead transitions. [2024-06-14 16:11:47,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 312 transitions, 4809 flow [2024-06-14 16:11:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-14 16:11:47,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-14 16:11:47,824 INFO L175 Difference]: Start difference. First operand has 144 places, 239 transitions, 3263 flow. Second operand 9 states and 198 transitions. [2024-06-14 16:11:47,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 312 transitions, 4809 flow [2024-06-14 16:11:47,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 312 transitions, 4702 flow, removed 45 selfloop flow, removed 2 redundant places. [2024-06-14 16:11:47,943 INFO L231 Difference]: Finished difference. Result has 153 places, 257 transitions, 3784 flow [2024-06-14 16:11:47,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3156, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3784, PETRI_PLACES=153, PETRI_TRANSITIONS=257} [2024-06-14 16:11:47,943 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places. [2024-06-14 16:11:47,943 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 257 transitions, 3784 flow [2024-06-14 16:11:47,944 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-14 16:11:47,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:47,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:47,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 16:11:47,944 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-14 16:11:47,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1569724626, now seen corresponding path program 5 times [2024-06-14 16:11:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10991649] [2024-06-14 16:11:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:11:55,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10991649] [2024-06-14 16:11:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10991649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:55,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:55,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653638813] [2024-06-14 16:11:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:55,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:55,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:55,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:55,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:11:55,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 257 transitions, 3784 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-14 16:11:55,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:55,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:11:55,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:57,244 INFO L124 PetriNetUnfolderBase]: 2879/4478 cut-off events. [2024-06-14 16:11:57,245 INFO L125 PetriNetUnfolderBase]: For 144410/144410 co-relation queries the response was YES. [2024-06-14 16:11:57,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38276 conditions, 4478 events. 2879/4478 cut-off events. For 144410/144410 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24996 event pairs, 683 based on Foata normal form. 16/4492 useless extension candidates. Maximal degree in co-relation 38199. Up to 3426 conditions per place. [2024-06-14 16:11:57,287 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 187 selfloop transitions, 113 changer transitions 0/305 dead transitions. [2024-06-14 16:11:57,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 305 transitions, 4953 flow [2024-06-14 16:11:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-14 16:11:57,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-14 16:11:57,289 INFO L175 Difference]: Start difference. First operand has 153 places, 257 transitions, 3784 flow. Second operand 9 states and 195 transitions. [2024-06-14 16:11:57,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 305 transitions, 4953 flow [2024-06-14 16:11:57,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 305 transitions, 4784 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-14 16:11:57,440 INFO L231 Difference]: Finished difference. Result has 159 places, 260 transitions, 3933 flow [2024-06-14 16:11:57,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3622, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3933, PETRI_PLACES=159, PETRI_TRANSITIONS=260} [2024-06-14 16:11:57,440 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places. [2024-06-14 16:11:57,440 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 260 transitions, 3933 flow [2024-06-14 16:11:57,441 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-14 16:11:57,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:57,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:57,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 16:11:57,441 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:11:57,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1703909477, now seen corresponding path program 2 times [2024-06-14 16:11:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375251617] [2024-06-14 16:11:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:12:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:08,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375251617] [2024-06-14 16:12:08,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375251617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:08,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:08,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:12:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636903698] [2024-06-14 16:12:08,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:08,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:12:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:12:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:12:08,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:12:08,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 260 transitions, 3933 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-14 16:12:08,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:08,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:12:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:09,817 INFO L124 PetriNetUnfolderBase]: 2853/4446 cut-off events. [2024-06-14 16:12:09,817 INFO L125 PetriNetUnfolderBase]: For 140875/140875 co-relation queries the response was YES. [2024-06-14 16:12:09,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38286 conditions, 4446 events. 2853/4446 cut-off events. For 140875/140875 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24727 event pairs, 803 based on Foata normal form. 6/4451 useless extension candidates. Maximal degree in co-relation 38206. Up to 4196 conditions per place. [2024-06-14 16:12:09,857 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 238 selfloop transitions, 36 changer transitions 0/279 dead transitions. [2024-06-14 16:12:09,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 279 transitions, 4565 flow [2024-06-14 16:12:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:12:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:12:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 16:12:09,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 16:12:09,859 INFO L175 Difference]: Start difference. First operand has 159 places, 260 transitions, 3933 flow. Second operand 8 states and 148 transitions. [2024-06-14 16:12:09,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 279 transitions, 4565 flow [2024-06-14 16:12:09,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 279 transitions, 4249 flow, removed 72 selfloop flow, removed 5 redundant places. [2024-06-14 16:12:10,003 INFO L231 Difference]: Finished difference. Result has 162 places, 260 transitions, 3714 flow [2024-06-14 16:12:10,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3627, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3714, PETRI_PLACES=162, PETRI_TRANSITIONS=260} [2024-06-14 16:12:10,004 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places. [2024-06-14 16:12:10,004 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 260 transitions, 3714 flow [2024-06-14 16:12:10,004 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-14 16:12:10,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:12:10,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:12:10,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 16:12:10,004 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-14 16:12:10,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:12:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1354684633, now seen corresponding path program 1 times [2024-06-14 16:12:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:12:10,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225981093] [2024-06-14 16:12:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:12:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:12:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:12:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225981093] [2024-06-14 16:12:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225981093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:12:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666356833] [2024-06-14 16:12:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:18,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:12:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:12:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:12:18,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:12:18,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 260 transitions, 3714 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:12:18,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:18,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:12:18,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:19,584 INFO L124 PetriNetUnfolderBase]: 2855/4449 cut-off events. [2024-06-14 16:12:19,584 INFO L125 PetriNetUnfolderBase]: For 137580/137580 co-relation queries the response was YES. [2024-06-14 16:12:19,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37515 conditions, 4449 events. 2855/4449 cut-off events. For 137580/137580 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24813 event pairs, 799 based on Foata normal form. 2/4450 useless extension candidates. Maximal degree in co-relation 37434. Up to 4251 conditions per place. [2024-06-14 16:12:19,630 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 252 selfloop transitions, 19 changer transitions 0/276 dead transitions. [2024-06-14 16:12:19,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 276 transitions, 4384 flow [2024-06-14 16:12:19,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:12:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:12:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-14 16:12:19,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 16:12:19,631 INFO L175 Difference]: Start difference. First operand has 162 places, 260 transitions, 3714 flow. Second operand 6 states and 114 transitions. [2024-06-14 16:12:19,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 276 transitions, 4384 flow [2024-06-14 16:12:19,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 276 transitions, 4268 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 16:12:19,814 INFO L231 Difference]: Finished difference. Result has 160 places, 263 transitions, 3684 flow [2024-06-14 16:12:19,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3598, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3684, PETRI_PLACES=160, PETRI_TRANSITIONS=263} [2024-06-14 16:12:19,815 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-14 16:12:19,815 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 263 transitions, 3684 flow [2024-06-14 16:12:19,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:12:19,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:12:19,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:12:19,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 16:12:19,816 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-14 16:12:19,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:12:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1703902533, now seen corresponding path program 2 times [2024-06-14 16:12:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:12:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413634621] [2024-06-14 16:12:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:12:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:12:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:12:28,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413634621] [2024-06-14 16:12:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413634621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:28,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:12:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34507957] [2024-06-14 16:12:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:28,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:12:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:28,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:12:28,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:12:28,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:12:28,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 263 transitions, 3684 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:12:28,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:28,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:12:28,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:29,890 INFO L124 PetriNetUnfolderBase]: 2826/4400 cut-off events. [2024-06-14 16:12:29,890 INFO L125 PetriNetUnfolderBase]: For 141605/141605 co-relation queries the response was YES. [2024-06-14 16:12:29,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37276 conditions, 4400 events. 2826/4400 cut-off events. For 141605/141605 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24473 event pairs, 797 based on Foata normal form. 1/4400 useless extension candidates. Maximal degree in co-relation 37194. Up to 4237 conditions per place. [2024-06-14 16:12:29,931 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 256 selfloop transitions, 11 changer transitions 0/272 dead transitions. [2024-06-14 16:12:29,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 272 transitions, 4240 flow [2024-06-14 16:12:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:12:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:12:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-14 16:12:29,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-14 16:12:29,932 INFO L175 Difference]: Start difference. First operand has 160 places, 263 transitions, 3684 flow. Second operand 6 states and 106 transitions. [2024-06-14 16:12:29,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 272 transitions, 4240 flow [2024-06-14 16:12:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 272 transitions, 4211 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 16:12:30,091 INFO L231 Difference]: Finished difference. Result has 163 places, 263 transitions, 3683 flow [2024-06-14 16:12:30,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3655, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3683, PETRI_PLACES=163, PETRI_TRANSITIONS=263} [2024-06-14 16:12:30,092 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2024-06-14 16:12:30,092 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 263 transitions, 3683 flow [2024-06-14 16:12:30,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:12:30,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:12:30,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:12:30,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 16:12:30,093 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:12:30,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:12:30,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1903326266, now seen corresponding path program 1 times [2024-06-14 16:12:30,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:12:30,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539874490] [2024-06-14 16:12:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:12:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:12:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:12:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539874490] [2024-06-14 16:12:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539874490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:12:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074206226] [2024-06-14 16:12:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:36,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:12:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:12:36,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:12:36,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:12:36,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 263 transitions, 3683 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-14 16:12:36,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:36,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:12:36,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:38,473 INFO L124 PetriNetUnfolderBase]: 2843/4427 cut-off events. [2024-06-14 16:12:38,474 INFO L125 PetriNetUnfolderBase]: For 149571/149571 co-relation queries the response was YES. [2024-06-14 16:12:38,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37676 conditions, 4427 events. 2843/4427 cut-off events. For 149571/149571 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24668 event pairs, 638 based on Foata normal form. 4/4430 useless extension candidates. Maximal degree in co-relation 37593. Up to 4187 conditions per place. [2024-06-14 16:12:38,523 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 276 selfloop transitions, 15 changer transitions 0/296 dead transitions. [2024-06-14 16:12:38,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 296 transitions, 4401 flow [2024-06-14 16:12:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:12:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:12:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 16:12:38,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-14 16:12:38,526 INFO L175 Difference]: Start difference. First operand has 163 places, 263 transitions, 3683 flow. Second operand 8 states and 153 transitions. [2024-06-14 16:12:38,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 296 transitions, 4401 flow [2024-06-14 16:12:38,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 296 transitions, 4354 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 16:12:38,718 INFO L231 Difference]: Finished difference. Result has 165 places, 265 transitions, 3735 flow [2024-06-14 16:12:38,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3636, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3735, PETRI_PLACES=165, PETRI_TRANSITIONS=265} [2024-06-14 16:12:38,719 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places. [2024-06-14 16:12:38,719 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 265 transitions, 3735 flow [2024-06-14 16:12:38,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-14 16:12:38,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:12:38,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:12:38,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 16:12:38,720 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:12:38,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:12:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 828496748, now seen corresponding path program 2 times [2024-06-14 16:12:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:12:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342271783] [2024-06-14 16:12:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:12:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:12:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:12:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342271783] [2024-06-14 16:12:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342271783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:46,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:46,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:12:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029300863] [2024-06-14 16:12:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:46,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:12:46,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:12:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:12:46,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:12:46,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 265 transitions, 3735 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-14 16:12:46,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:46,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:12:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:47,832 INFO L124 PetriNetUnfolderBase]: 2860/4454 cut-off events. [2024-06-14 16:12:47,832 INFO L125 PetriNetUnfolderBase]: For 158016/158016 co-relation queries the response was YES. [2024-06-14 16:12:47,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38274 conditions, 4454 events. 2860/4454 cut-off events. For 158016/158016 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24807 event pairs, 757 based on Foata normal form. 4/4457 useless extension candidates. Maximal degree in co-relation 38190. Up to 4240 conditions per place. [2024-06-14 16:12:47,880 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 276 selfloop transitions, 16 changer transitions 0/297 dead transitions. [2024-06-14 16:12:47,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 297 transitions, 4457 flow [2024-06-14 16:12:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:12:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:12:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 16:12:47,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-14 16:12:47,882 INFO L175 Difference]: Start difference. First operand has 165 places, 265 transitions, 3735 flow. Second operand 8 states and 153 transitions. [2024-06-14 16:12:47,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 297 transitions, 4457 flow [2024-06-14 16:12:48,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 297 transitions, 4376 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 16:12:48,093 INFO L231 Difference]: Finished difference. Result has 167 places, 267 transitions, 3759 flow [2024-06-14 16:12:48,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3654, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3759, PETRI_PLACES=167, PETRI_TRANSITIONS=267} [2024-06-14 16:12:48,094 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places. [2024-06-14 16:12:48,094 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 267 transitions, 3759 flow [2024-06-14 16:12:48,094 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-14 16:12:48,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:12:48,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-14 16:12:48,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 16:12:48,094 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:12:48,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:12:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1906188186, now seen corresponding path program 1 times [2024-06-14 16:12:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:12:48,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944576763] [2024-06-14 16:12:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:12:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:12:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:12:55,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:55,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944576763] [2024-06-14 16:12:55,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944576763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:55,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:55,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:12:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110948019] [2024-06-14 16:12:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:55,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:12:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:12:55,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:12:56,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:12:56,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 267 transitions, 3759 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-14 16:12:56,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:56,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:12:56,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:57,753 INFO L124 PetriNetUnfolderBase]: 2892/4505 cut-off events. [2024-06-14 16:12:57,753 INFO L125 PetriNetUnfolderBase]: For 168542/168542 co-relation queries the response was YES. [2024-06-14 16:12:57,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38955 conditions, 4505 events. 2892/4505 cut-off events. For 168542/168542 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25095 event pairs, 738 based on Foata normal form. 5/4509 useless extension candidates. Maximal degree in co-relation 38870. Up to 4197 conditions per place. [2024-06-14 16:12:57,797 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 258 selfloop transitions, 46 changer transitions 0/309 dead transitions. [2024-06-14 16:12:57,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 309 transitions, 4689 flow [2024-06-14 16:12:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:12:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:12:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-06-14 16:12:57,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 16:12:57,798 INFO L175 Difference]: Start difference. First operand has 167 places, 267 transitions, 3759 flow. Second operand 9 states and 189 transitions. [2024-06-14 16:12:57,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 309 transitions, 4689 flow [2024-06-14 16:12:57,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 309 transitions, 4602 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-14 16:12:58,003 INFO L231 Difference]: Finished difference. Result has 170 places, 272 transitions, 3924 flow [2024-06-14 16:12:58,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3672, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3924, PETRI_PLACES=170, PETRI_TRANSITIONS=272} [2024-06-14 16:12:58,004 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2024-06-14 16:12:58,004 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 272 transitions, 3924 flow [2024-06-14 16:12:58,004 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-14 16:12:58,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:12:58,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:12:58,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 16:12:58,004 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-14 16:12:58,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:12:58,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2107853766, now seen corresponding path program 3 times [2024-06-14 16:12:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:12:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481166833] [2024-06-14 16:12:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:12:58,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:12:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:13:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:13:05,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:13:05,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481166833] [2024-06-14 16:13:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481166833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:13:05,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:13:05,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:13:05,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290076849] [2024-06-14 16:13:05,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:13:05,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:13:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:13:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:13:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:13:05,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:13:05,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 272 transitions, 3924 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-14 16:13:05,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:13:05,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:13:05,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:13:06,894 INFO L124 PetriNetUnfolderBase]: 2909/4538 cut-off events. [2024-06-14 16:13:06,894 INFO L125 PetriNetUnfolderBase]: For 177329/177329 co-relation queries the response was YES. [2024-06-14 16:13:06,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40005 conditions, 4538 events. 2909/4538 cut-off events. For 177329/177329 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25344 event pairs, 726 based on Foata normal form. 4/4541 useless extension candidates. Maximal degree in co-relation 39919. Up to 4319 conditions per place. [2024-06-14 16:13:06,949 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 282 selfloop transitions, 16 changer transitions 0/303 dead transitions. [2024-06-14 16:13:06,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 303 transitions, 4686 flow [2024-06-14 16:13:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:13:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:13:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 16:13:06,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 16:13:06,952 INFO L175 Difference]: Start difference. First operand has 170 places, 272 transitions, 3924 flow. Second operand 8 states and 150 transitions. [2024-06-14 16:13:06,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 303 transitions, 4686 flow [2024-06-14 16:13:07,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 303 transitions, 4470 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-14 16:13:07,220 INFO L231 Difference]: Finished difference. Result has 172 places, 276 transitions, 3855 flow [2024-06-14 16:13:07,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3708, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3855, PETRI_PLACES=172, PETRI_TRANSITIONS=276} [2024-06-14 16:13:07,220 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places. [2024-06-14 16:13:07,220 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 276 transitions, 3855 flow [2024-06-14 16:13:07,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-14 16:13:07,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:13:07,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:13:07,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 16:13:07,221 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-14 16:13:07,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:13:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1116098252, now seen corresponding path program 2 times [2024-06-14 16:13:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:13:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525842675] [2024-06-14 16:13:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:13:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:13:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:13:15,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-14 16:13:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:13:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525842675] [2024-06-14 16:13:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525842675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:13:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:13:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:13:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935921014] [2024-06-14 16:13:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:13:15,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:13:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:13:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:13:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:13:15,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:13:15,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 276 transitions, 3855 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-14 16:13:15,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:13:15,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:13:15,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:13:17,433 INFO L124 PetriNetUnfolderBase]: 2989/4672 cut-off events. [2024-06-14 16:13:17,434 INFO L125 PetriNetUnfolderBase]: For 193181/193181 co-relation queries the response was YES. [2024-06-14 16:13:17,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41305 conditions, 4672 events. 2989/4672 cut-off events. For 193181/193181 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26291 event pairs, 697 based on Foata normal form. 5/4676 useless extension candidates. Maximal degree in co-relation 41217. Up to 4078 conditions per place. [2024-06-14 16:13:17,478 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 232 selfloop transitions, 100 changer transitions 0/337 dead transitions. [2024-06-14 16:13:17,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 337 transitions, 5391 flow [2024-06-14 16:13:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:13:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:13:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-14 16:13:17,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-14 16:13:17,479 INFO L175 Difference]: Start difference. First operand has 172 places, 276 transitions, 3855 flow. Second operand 9 states and 195 transitions. [2024-06-14 16:13:17,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 337 transitions, 5391 flow [2024-06-14 16:13:17,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 337 transitions, 5280 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-14 16:13:17,672 INFO L231 Difference]: Finished difference. Result has 179 places, 297 transitions, 4545 flow [2024-06-14 16:13:17,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3744, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4545, PETRI_PLACES=179, PETRI_TRANSITIONS=297} [2024-06-14 16:13:17,672 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 136 predicate places. [2024-06-14 16:13:17,672 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 297 transitions, 4545 flow [2024-06-14 16:13:17,673 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-14 16:13:17,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:13:17,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:13:17,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 16:13:17,673 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-14 16:13:17,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:13:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1461044372, now seen corresponding path program 4 times [2024-06-14 16:13:17,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:13:17,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260160241] [2024-06-14 16:13:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:13:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:13:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:13:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:13:25,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:13:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260160241] [2024-06-14 16:13:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260160241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:13:25,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:13:25,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:13:25,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780328649] [2024-06-14 16:13:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:13:25,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:13:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:13:25,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:13:25,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:13:25,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:13:25,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 297 transitions, 4545 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-14 16:13:25,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:13:25,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:13:25,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:13:26,976 INFO L124 PetriNetUnfolderBase]: 2981/4661 cut-off events. [2024-06-14 16:13:26,977 INFO L125 PetriNetUnfolderBase]: For 203121/203121 co-relation queries the response was YES. [2024-06-14 16:13:27,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42641 conditions, 4661 events. 2981/4661 cut-off events. For 203121/203121 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26315 event pairs, 735 based on Foata normal form. 4/4663 useless extension candidates. Maximal degree in co-relation 42549. Up to 4392 conditions per place. [2024-06-14 16:13:27,025 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 297 selfloop transitions, 23 changer transitions 0/325 dead transitions. [2024-06-14 16:13:27,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 325 transitions, 5351 flow [2024-06-14 16:13:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:13:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:13:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 16:13:27,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 16:13:27,028 INFO L175 Difference]: Start difference. First operand has 179 places, 297 transitions, 4545 flow. Second operand 8 states and 150 transitions. [2024-06-14 16:13:27,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 325 transitions, 5351 flow [2024-06-14 16:13:27,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 325 transitions, 5114 flow, removed 97 selfloop flow, removed 3 redundant places. [2024-06-14 16:13:27,289 INFO L231 Difference]: Finished difference. Result has 185 places, 301 transitions, 4477 flow [2024-06-14 16:13:27,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4310, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4477, PETRI_PLACES=185, PETRI_TRANSITIONS=301} [2024-06-14 16:13:27,290 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places. [2024-06-14 16:13:27,290 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 301 transitions, 4477 flow [2024-06-14 16:13:27,290 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-14 16:13:27,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:13:27,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:13:27,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 16:13:27,290 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-14 16:13:27,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:13:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1416815608, now seen corresponding path program 3 times [2024-06-14 16:13:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:13:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438811] [2024-06-14 16:13:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:13:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:13:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:13:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:13:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:13:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438811] [2024-06-14 16:13:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:13:35,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:13:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:13:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731219401] [2024-06-14 16:13:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:13:35,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:13:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:13:35,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:13:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:13:35,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:13:35,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 301 transitions, 4477 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-14 16:13:35,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:13:35,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:13:35,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:13:37,512 INFO L124 PetriNetUnfolderBase]: 3059/4780 cut-off events. [2024-06-14 16:13:37,512 INFO L125 PetriNetUnfolderBase]: For 219224/219224 co-relation queries the response was YES. [2024-06-14 16:13:37,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43943 conditions, 4780 events. 3059/4780 cut-off events. For 219224/219224 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 27135 event pairs, 623 based on Foata normal form. 5/4782 useless extension candidates. Maximal degree in co-relation 43848. Up to 3383 conditions per place. [2024-06-14 16:13:37,566 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 165 selfloop transitions, 189 changer transitions 0/359 dead transitions. [2024-06-14 16:13:37,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 359 transitions, 6242 flow [2024-06-14 16:13:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:13:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:13:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2024-06-14 16:13:37,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-14 16:13:37,570 INFO L175 Difference]: Start difference. First operand has 185 places, 301 transitions, 4477 flow. Second operand 9 states and 196 transitions. [2024-06-14 16:13:37,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 359 transitions, 6242 flow [2024-06-14 16:13:37,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 359 transitions, 6111 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-14 16:13:37,840 INFO L231 Difference]: Finished difference. Result has 192 places, 321 transitions, 5445 flow [2024-06-14 16:13:37,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4346, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5445, PETRI_PLACES=192, PETRI_TRANSITIONS=321} [2024-06-14 16:13:37,841 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places. [2024-06-14 16:13:37,841 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 321 transitions, 5445 flow [2024-06-14 16:13:37,841 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-14 16:13:37,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:13:37,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:13:37,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 16:13:37,841 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:13:37,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:13:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2092791954, now seen corresponding path program 4 times [2024-06-14 16:13:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:13:37,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624835443] [2024-06-14 16:13:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:13:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:13:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:13:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:13:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:13:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624835443] [2024-06-14 16:13:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624835443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:13:45,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:13:45,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:13:45,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689647484] [2024-06-14 16:13:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:13:45,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:13:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:13:45,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:13:45,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:13:45,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:13:45,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 321 transitions, 5445 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-14 16:13:45,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:13:45,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:13:45,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:13:47,268 INFO L124 PetriNetUnfolderBase]: 3105/4865 cut-off events. [2024-06-14 16:13:47,268 INFO L125 PetriNetUnfolderBase]: For 240315/240315 co-relation queries the response was YES. [2024-06-14 16:13:47,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47317 conditions, 4865 events. 3105/4865 cut-off events. For 240315/240315 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27828 event pairs, 627 based on Foata normal form. 5/4867 useless extension candidates. Maximal degree in co-relation 47218. Up to 3785 conditions per place. [2024-06-14 16:13:47,330 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 212 selfloop transitions, 151 changer transitions 0/368 dead transitions. [2024-06-14 16:13:47,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 368 transitions, 6933 flow [2024-06-14 16:13:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:13:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:13:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-14 16:13:47,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-14 16:13:47,332 INFO L175 Difference]: Start difference. First operand has 192 places, 321 transitions, 5445 flow. Second operand 9 states and 195 transitions. [2024-06-14 16:13:47,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 368 transitions, 6933 flow [2024-06-14 16:13:47,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 368 transitions, 6650 flow, removed 128 selfloop flow, removed 2 redundant places. [2024-06-14 16:13:47,688 INFO L231 Difference]: Finished difference. Result has 199 places, 332 transitions, 5817 flow [2024-06-14 16:13:47,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5194, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5817, PETRI_PLACES=199, PETRI_TRANSITIONS=332} [2024-06-14 16:13:47,688 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2024-06-14 16:13:47,689 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 332 transitions, 5817 flow [2024-06-14 16:13:47,689 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-14 16:13:47,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:13:47,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:13:47,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 16:13:47,689 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:13:47,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:13:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1454373172, now seen corresponding path program 5 times [2024-06-14 16:13:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:13:47,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389889602] [2024-06-14 16:13:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:13:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:13:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:13:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:13:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:13:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389889602] [2024-06-14 16:13:55,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389889602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:13:55,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:13:55,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:13:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741587974] [2024-06-14 16:13:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:13:55,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:13:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:13:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:13:55,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:13:55,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:13:55,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 332 transitions, 5817 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-14 16:13:55,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:13:55,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:13:55,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:13:57,176 INFO L124 PetriNetUnfolderBase]: 3137/4938 cut-off events. [2024-06-14 16:13:57,176 INFO L125 PetriNetUnfolderBase]: For 242340/242340 co-relation queries the response was YES. [2024-06-14 16:13:57,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47547 conditions, 4938 events. 3137/4938 cut-off events. For 242340/242340 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 28446 event pairs, 634 based on Foata normal form. 5/4940 useless extension candidates. Maximal degree in co-relation 47446. Up to 3820 conditions per place. [2024-06-14 16:13:57,332 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 231 selfloop transitions, 145 changer transitions 0/381 dead transitions. [2024-06-14 16:13:57,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 381 transitions, 7359 flow [2024-06-14 16:13:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:13:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:13:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-14 16:13:57,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-14 16:13:57,334 INFO L175 Difference]: Start difference. First operand has 199 places, 332 transitions, 5817 flow. Second operand 9 states and 195 transitions. [2024-06-14 16:13:57,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 381 transitions, 7359 flow [2024-06-14 16:13:57,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 381 transitions, 6997 flow, removed 90 selfloop flow, removed 5 redundant places. [2024-06-14 16:13:57,626 INFO L231 Difference]: Finished difference. Result has 204 places, 345 transitions, 6157 flow [2024-06-14 16:13:57,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5462, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6157, PETRI_PLACES=204, PETRI_TRANSITIONS=345} [2024-06-14 16:13:57,627 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2024-06-14 16:13:57,627 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 345 transitions, 6157 flow [2024-06-14 16:13:57,627 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-14 16:13:57,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:13:57,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:13:57,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 16:13:57,627 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:13:57,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:13:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -954448158, now seen corresponding path program 1 times [2024-06-14 16:13:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:13:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590386991] [2024-06-14 16:13:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:13:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:13:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:14:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:06,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590386991] [2024-06-14 16:14:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590386991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:06,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:06,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:14:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251468542] [2024-06-14 16:14:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:06,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:14:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:14:06,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:14:06,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:14:06,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 345 transitions, 6157 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-14 16:14:06,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:06,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:14:06,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:08,258 INFO L124 PetriNetUnfolderBase]: 3229/5077 cut-off events. [2024-06-14 16:14:08,258 INFO L125 PetriNetUnfolderBase]: For 258956/258956 co-relation queries the response was YES. [2024-06-14 16:14:08,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49862 conditions, 5077 events. 3229/5077 cut-off events. For 258956/258956 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29281 event pairs, 650 based on Foata normal form. 12/5088 useless extension candidates. Maximal degree in co-relation 49759. Up to 4162 conditions per place. [2024-06-14 16:14:08,320 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 304 selfloop transitions, 86 changer transitions 0/395 dead transitions. [2024-06-14 16:14:08,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 395 transitions, 7750 flow [2024-06-14 16:14:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:14:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:14:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-14 16:14:08,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-14 16:14:08,321 INFO L175 Difference]: Start difference. First operand has 204 places, 345 transitions, 6157 flow. Second operand 8 states and 164 transitions. [2024-06-14 16:14:08,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 395 transitions, 7750 flow [2024-06-14 16:14:08,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 395 transitions, 7517 flow, removed 103 selfloop flow, removed 2 redundant places. [2024-06-14 16:14:08,685 INFO L231 Difference]: Finished difference. Result has 211 places, 362 transitions, 6536 flow [2024-06-14 16:14:08,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5924, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6536, PETRI_PLACES=211, PETRI_TRANSITIONS=362} [2024-06-14 16:14:08,686 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places. [2024-06-14 16:14:08,686 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 362 transitions, 6536 flow [2024-06-14 16:14:08,686 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-14 16:14:08,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:08,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 16:14:08,686 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:14:08,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1281369792, now seen corresponding path program 2 times [2024-06-14 16:14:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040430714] [2024-06-14 16:14:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:14:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:17,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040430714] [2024-06-14 16:14:17,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040430714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:17,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:17,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:14:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187689822] [2024-06-14 16:14:17,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:17,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:14:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:17,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:14:17,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:14:17,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:14:17,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 362 transitions, 6536 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-14 16:14:17,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:17,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:14:17,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:18,938 INFO L124 PetriNetUnfolderBase]: 3267/5128 cut-off events. [2024-06-14 16:14:18,938 INFO L125 PetriNetUnfolderBase]: For 263460/263460 co-relation queries the response was YES. [2024-06-14 16:14:18,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51008 conditions, 5128 events. 3267/5128 cut-off events. For 263460/263460 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 29578 event pairs, 743 based on Foata normal form. 6/5133 useless extension candidates. Maximal degree in co-relation 50902. Up to 4698 conditions per place. [2024-06-14 16:14:19,004 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 343 selfloop transitions, 44 changer transitions 0/392 dead transitions. [2024-06-14 16:14:19,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 392 transitions, 7682 flow [2024-06-14 16:14:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:14:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:14:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-14 16:14:19,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2024-06-14 16:14:19,006 INFO L175 Difference]: Start difference. First operand has 211 places, 362 transitions, 6536 flow. Second operand 9 states and 164 transitions. [2024-06-14 16:14:19,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 392 transitions, 7682 flow [2024-06-14 16:14:19,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 392 transitions, 7533 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-14 16:14:19,393 INFO L231 Difference]: Finished difference. Result has 216 places, 368 transitions, 6638 flow [2024-06-14 16:14:19,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6390, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6638, PETRI_PLACES=216, PETRI_TRANSITIONS=368} [2024-06-14 16:14:19,393 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places. [2024-06-14 16:14:19,393 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 368 transitions, 6638 flow [2024-06-14 16:14:19,394 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-14 16:14:19,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:19,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:19,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 16:14:19,394 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:14:19,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1794786934, now seen corresponding path program 3 times [2024-06-14 16:14:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512416178] [2024-06-14 16:14:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:14:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512416178] [2024-06-14 16:14:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512416178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:14:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400135731] [2024-06-14 16:14:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:27,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:14:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:27,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:14:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:14:28,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:14:28,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 368 transitions, 6638 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-14 16:14:28,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:28,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:14:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:29,727 INFO L124 PetriNetUnfolderBase]: 3249/5108 cut-off events. [2024-06-14 16:14:29,727 INFO L125 PetriNetUnfolderBase]: For 266232/266232 co-relation queries the response was YES. [2024-06-14 16:14:29,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50293 conditions, 5108 events. 3249/5108 cut-off events. For 266232/266232 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 29533 event pairs, 754 based on Foata normal form. 6/5113 useless extension candidates. Maximal degree in co-relation 50186. Up to 4794 conditions per place. [2024-06-14 16:14:29,792 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 356 selfloop transitions, 27 changer transitions 0/388 dead transitions. [2024-06-14 16:14:29,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 388 transitions, 7483 flow [2024-06-14 16:14:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:14:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:14:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-14 16:14:29,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-14 16:14:29,793 INFO L175 Difference]: Start difference. First operand has 216 places, 368 transitions, 6638 flow. Second operand 9 states and 159 transitions. [2024-06-14 16:14:29,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 388 transitions, 7483 flow [2024-06-14 16:14:30,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 388 transitions, 7199 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-14 16:14:30,186 INFO L231 Difference]: Finished difference. Result has 217 places, 368 transitions, 6417 flow [2024-06-14 16:14:30,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6354, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6417, PETRI_PLACES=217, PETRI_TRANSITIONS=368} [2024-06-14 16:14:30,187 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places. [2024-06-14 16:14:30,187 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 368 transitions, 6417 flow [2024-06-14 16:14:30,187 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-14 16:14:30,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:30,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:14:30,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 16:14:30,188 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:14:30,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1794795862, now seen corresponding path program 1 times [2024-06-14 16:14:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:30,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577171590] [2024-06-14 16:14:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:14:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577171590] [2024-06-14 16:14:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577171590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:14:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425254120] [2024-06-14 16:14:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:41,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:14:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:14:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:14:41,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:14:41,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 368 transitions, 6417 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-14 16:14:41,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:41,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:14:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:43,224 INFO L124 PetriNetUnfolderBase]: 3288/5163 cut-off events. [2024-06-14 16:14:43,225 INFO L125 PetriNetUnfolderBase]: For 276995/276995 co-relation queries the response was YES. [2024-06-14 16:14:43,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50251 conditions, 5163 events. 3288/5163 cut-off events. For 276995/276995 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29775 event pairs, 756 based on Foata normal form. 14/5176 useless extension candidates. Maximal degree in co-relation 50144. Up to 4763 conditions per place. [2024-06-14 16:14:43,280 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 350 selfloop transitions, 40 changer transitions 0/395 dead transitions. [2024-06-14 16:14:43,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 7384 flow [2024-06-14 16:14:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:14:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:14:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-14 16:14:43,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-14 16:14:43,281 INFO L175 Difference]: Start difference. First operand has 217 places, 368 transitions, 6417 flow. Second operand 9 states and 166 transitions. [2024-06-14 16:14:43,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 7384 flow [2024-06-14 16:14:43,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 395 transitions, 7215 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-14 16:14:43,618 INFO L231 Difference]: Finished difference. Result has 216 places, 370 transitions, 6382 flow [2024-06-14 16:14:43,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6248, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6382, PETRI_PLACES=216, PETRI_TRANSITIONS=370} [2024-06-14 16:14:43,619 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places. [2024-06-14 16:14:43,619 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 370 transitions, 6382 flow [2024-06-14 16:14:43,619 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-14 16:14:43,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:43,620 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-14 16:14:43,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 16:14:43,620 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-14 16:14:43,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -967967907, now seen corresponding path program 1 times [2024-06-14 16:14:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:43,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122667289] [2024-06-14 16:14:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:14:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:14:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:14:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122667289] [2024-06-14 16:14:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122667289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:14:51,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:14:51,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:14:51,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500550358] [2024-06-14 16:14:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:14:51,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:14:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:14:51,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:14:51,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:14:51,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:14:51,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 370 transitions, 6382 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-14 16:14:51,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:14:51,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:14:51,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:14:53,360 INFO L124 PetriNetUnfolderBase]: 3403/5350 cut-off events. [2024-06-14 16:14:53,360 INFO L125 PetriNetUnfolderBase]: For 293402/293402 co-relation queries the response was YES. [2024-06-14 16:14:53,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52144 conditions, 5350 events. 3403/5350 cut-off events. For 293402/293402 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31159 event pairs, 623 based on Foata normal form. 10/5359 useless extension candidates. Maximal degree in co-relation 52039. Up to 4822 conditions per place. [2024-06-14 16:14:53,413 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 374 selfloop transitions, 42 changer transitions 0/421 dead transitions. [2024-06-14 16:14:53,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 421 transitions, 7814 flow [2024-06-14 16:14:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:14:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:14:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-06-14 16:14:53,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 16:14:53,414 INFO L175 Difference]: Start difference. First operand has 216 places, 370 transitions, 6382 flow. Second operand 9 states and 189 transitions. [2024-06-14 16:14:53,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 421 transitions, 7814 flow [2024-06-14 16:14:53,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 421 transitions, 7714 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 16:14:53,804 INFO L231 Difference]: Finished difference. Result has 220 places, 381 transitions, 6715 flow [2024-06-14 16:14:53,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6282, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6715, PETRI_PLACES=220, PETRI_TRANSITIONS=381} [2024-06-14 16:14:53,805 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places. [2024-06-14 16:14:53,805 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 381 transitions, 6715 flow [2024-06-14 16:14:53,805 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-14 16:14:53,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:14:53,806 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-14 16:14:53,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 16:14:53,806 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:14:53,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:14:53,806 INFO L85 PathProgramCache]: Analyzing trace with hash -86403295, now seen corresponding path program 2 times [2024-06-14 16:14:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:14:53,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121546466] [2024-06-14 16:14:53,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:14:53,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:14:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:15:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:15:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:15:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121546466] [2024-06-14 16:15:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121546466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:15:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:15:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:15:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366911853] [2024-06-14 16:15:00,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:15:00,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:15:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:15:00,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:15:00,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:15:00,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:15:00,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 381 transitions, 6715 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-14 16:15:00,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:15:00,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:15:00,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:15:02,728 INFO L124 PetriNetUnfolderBase]: 3649/5720 cut-off events. [2024-06-14 16:15:02,729 INFO L125 PetriNetUnfolderBase]: For 351462/351462 co-relation queries the response was YES. [2024-06-14 16:15:02,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57390 conditions, 5720 events. 3649/5720 cut-off events. For 351462/351462 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 33699 event pairs, 775 based on Foata normal form. 16/5735 useless extension candidates. Maximal degree in co-relation 57282. Up to 5011 conditions per place. [2024-06-14 16:15:02,798 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 385 selfloop transitions, 45 changer transitions 0/435 dead transitions. [2024-06-14 16:15:02,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 435 transitions, 8321 flow [2024-06-14 16:15:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:15:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:15:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2024-06-14 16:15:02,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-14 16:15:02,799 INFO L175 Difference]: Start difference. First operand has 220 places, 381 transitions, 6715 flow. Second operand 9 states and 196 transitions. [2024-06-14 16:15:02,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 435 transitions, 8321 flow [2024-06-14 16:15:03,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 435 transitions, 8088 flow, removed 97 selfloop flow, removed 4 redundant places. [2024-06-14 16:15:03,410 INFO L231 Difference]: Finished difference. Result has 226 places, 387 transitions, 6803 flow [2024-06-14 16:15:03,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6482, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6803, PETRI_PLACES=226, PETRI_TRANSITIONS=387} [2024-06-14 16:15:03,411 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-06-14 16:15:03,411 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 387 transitions, 6803 flow [2024-06-14 16:15:03,411 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-14 16:15:03,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:15:03,411 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-14 16:15:03,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 16:15:03,412 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:15:03,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:15:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash -86255425, now seen corresponding path program 3 times [2024-06-14 16:15:03,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:15:03,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877550304] [2024-06-14 16:15:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:15:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:15:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:15:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:15:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:15:10,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877550304] [2024-06-14 16:15:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877550304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:15:10,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:15:10,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:15:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723353274] [2024-06-14 16:15:10,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:15:10,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:15:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:15:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:15:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:15:11,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:15:11,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 387 transitions, 6803 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-14 16:15:11,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:15:11,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:15:11,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:15:13,051 INFO L124 PetriNetUnfolderBase]: 3642/5715 cut-off events. [2024-06-14 16:15:13,051 INFO L125 PetriNetUnfolderBase]: For 353255/353255 co-relation queries the response was YES. [2024-06-14 16:15:13,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57056 conditions, 5715 events. 3642/5715 cut-off events. For 353255/353255 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33690 event pairs, 818 based on Foata normal form. 16/5730 useless extension candidates. Maximal degree in co-relation 56945. Up to 5250 conditions per place. [2024-06-14 16:15:13,117 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 382 selfloop transitions, 44 changer transitions 0/431 dead transitions. [2024-06-14 16:15:13,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 431 transitions, 8053 flow [2024-06-14 16:15:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:15:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:15:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-14 16:15:13,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052910052910053 [2024-06-14 16:15:13,122 INFO L175 Difference]: Start difference. First operand has 226 places, 387 transitions, 6803 flow. Second operand 9 states and 191 transitions. [2024-06-14 16:15:13,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 431 transitions, 8053 flow [2024-06-14 16:15:13,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 431 transitions, 7906 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-06-14 16:15:13,608 INFO L231 Difference]: Finished difference. Result has 230 places, 390 transitions, 6887 flow [2024-06-14 16:15:13,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6664, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6887, PETRI_PLACES=230, PETRI_TRANSITIONS=390} [2024-06-14 16:15:13,609 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places. [2024-06-14 16:15:13,609 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 390 transitions, 6887 flow [2024-06-14 16:15:13,609 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-14 16:15:13,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:15:13,609 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-14 16:15:13,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 16:15:13,609 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:15:13,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:15:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1037707023, now seen corresponding path program 1 times [2024-06-14 16:15:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:15:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352053860] [2024-06-14 16:15:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:15:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:15:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:15:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:15:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:15:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352053860] [2024-06-14 16:15:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352053860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:15:20,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:15:20,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:15:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286746144] [2024-06-14 16:15:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:15:20,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:15:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:15:20,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:15:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:15:20,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:15:20,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 390 transitions, 6887 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:15:20,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:15:20,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:15:20,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:15:23,043 INFO L124 PetriNetUnfolderBase]: 3877/6126 cut-off events. [2024-06-14 16:15:23,043 INFO L125 PetriNetUnfolderBase]: For 420005/420005 co-relation queries the response was YES. [2024-06-14 16:15:23,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60357 conditions, 6126 events. 3877/6126 cut-off events. For 420005/420005 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 36725 event pairs, 898 based on Foata normal form. 58/6183 useless extension candidates. Maximal degree in co-relation 60244. Up to 5319 conditions per place. [2024-06-14 16:15:23,113 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 387 selfloop transitions, 48 changer transitions 0/440 dead transitions. [2024-06-14 16:15:23,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 440 transitions, 8181 flow [2024-06-14 16:15:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:15:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:15:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-14 16:15:23,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-14 16:15:23,114 INFO L175 Difference]: Start difference. First operand has 230 places, 390 transitions, 6887 flow. Second operand 10 states and 212 transitions. [2024-06-14 16:15:23,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 440 transitions, 8181 flow [2024-06-14 16:15:23,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 440 transitions, 8030 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-14 16:15:23,647 INFO L231 Difference]: Finished difference. Result has 233 places, 392 transitions, 6955 flow [2024-06-14 16:15:23,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6736, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6955, PETRI_PLACES=233, PETRI_TRANSITIONS=392} [2024-06-14 16:15:23,648 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places. [2024-06-14 16:15:23,648 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 392 transitions, 6955 flow [2024-06-14 16:15:23,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:15:23,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:15:23,648 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-14 16:15:23,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 16:15:23,649 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:15:23,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:15:23,649 INFO L85 PathProgramCache]: Analyzing trace with hash -27625649, now seen corresponding path program 4 times [2024-06-14 16:15:23,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:15:23,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366923834] [2024-06-14 16:15:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:15:23,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:15:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:15:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:15:30,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:15:30,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366923834] [2024-06-14 16:15:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366923834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:15:30,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:15:30,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:15:30,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954352940] [2024-06-14 16:15:30,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:15:30,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:15:30,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:15:30,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:15:30,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:15:30,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:15:30,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 392 transitions, 6955 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-14 16:15:30,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:15:30,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:15:30,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:15:33,238 INFO L124 PetriNetUnfolderBase]: 3986/6288 cut-off events. [2024-06-14 16:15:33,238 INFO L125 PetriNetUnfolderBase]: For 397763/397763 co-relation queries the response was YES. [2024-06-14 16:15:33,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62227 conditions, 6288 events. 3986/6288 cut-off events. For 397763/397763 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 37881 event pairs, 905 based on Foata normal form. 16/6303 useless extension candidates. Maximal degree in co-relation 62113. Up to 5754 conditions per place. [2024-06-14 16:15:33,307 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 386 selfloop transitions, 50 changer transitions 0/441 dead transitions. [2024-06-14 16:15:33,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 441 transitions, 8383 flow [2024-06-14 16:15:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:15:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:15:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-14 16:15:33,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026455026455027 [2024-06-14 16:15:33,308 INFO L175 Difference]: Start difference. First operand has 233 places, 392 transitions, 6955 flow. Second operand 9 states and 190 transitions. [2024-06-14 16:15:33,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 441 transitions, 8383 flow [2024-06-14 16:15:33,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 441 transitions, 8218 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-14 16:15:33,845 INFO L231 Difference]: Finished difference. Result has 235 places, 401 transitions, 7175 flow [2024-06-14 16:15:33,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6790, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7175, PETRI_PLACES=235, PETRI_TRANSITIONS=401} [2024-06-14 16:15:33,845 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places. [2024-06-14 16:15:33,845 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 401 transitions, 7175 flow [2024-06-14 16:15:33,845 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-14 16:15:33,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:15:33,846 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-14 16:15:33,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 16:15:33,846 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:15:33,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:15:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash 32649407, now seen corresponding path program 5 times [2024-06-14 16:15:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:15:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502544726] [2024-06-14 16:15:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:15:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:15:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:15:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:15:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:15:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502544726] [2024-06-14 16:15:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502544726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:15:41,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:15:41,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:15:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956004091] [2024-06-14 16:15:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:15:41,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:15:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:15:41,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:15:41,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:15:41,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:15:41,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 401 transitions, 7175 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-14 16:15:41,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:15:41,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:15:41,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:15:43,436 INFO L124 PetriNetUnfolderBase]: 4063/6416 cut-off events. [2024-06-14 16:15:43,436 INFO L125 PetriNetUnfolderBase]: For 407617/407617 co-relation queries the response was YES. [2024-06-14 16:15:43,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63266 conditions, 6416 events. 4063/6416 cut-off events. For 407617/407617 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 38835 event pairs, 914 based on Foata normal form. 16/6431 useless extension candidates. Maximal degree in co-relation 63150. Up to 5877 conditions per place. [2024-06-14 16:15:43,515 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 393 selfloop transitions, 50 changer transitions 0/448 dead transitions. [2024-06-14 16:15:43,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 448 transitions, 8643 flow [2024-06-14 16:15:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:15:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:15:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-14 16:15:43,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026455026455027 [2024-06-14 16:15:43,517 INFO L175 Difference]: Start difference. First operand has 235 places, 401 transitions, 7175 flow. Second operand 9 states and 190 transitions. [2024-06-14 16:15:43,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 448 transitions, 8643 flow [2024-06-14 16:15:44,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 448 transitions, 8459 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-14 16:15:44,047 INFO L231 Difference]: Finished difference. Result has 240 places, 408 transitions, 7323 flow [2024-06-14 16:15:44,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6995, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7323, PETRI_PLACES=240, PETRI_TRANSITIONS=408} [2024-06-14 16:15:44,047 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places. [2024-06-14 16:15:44,047 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 408 transitions, 7323 flow [2024-06-14 16:15:44,048 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-14 16:15:44,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:15:44,048 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-14 16:15:44,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 16:15:44,048 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:15:44,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:15:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash -918956013, now seen corresponding path program 6 times [2024-06-14 16:15:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:15:44,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634566321] [2024-06-14 16:15:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:15:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:15:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:15:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:15:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:15:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634566321] [2024-06-14 16:15:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634566321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:15:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:15:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:15:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723198374] [2024-06-14 16:15:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:15:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:15:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:15:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:15:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:15:52,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:15:52,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 408 transitions, 7323 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-14 16:15:52,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:15:52,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:15:52,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:15:54,525 INFO L124 PetriNetUnfolderBase]: 4225/6666 cut-off events. [2024-06-14 16:15:54,525 INFO L125 PetriNetUnfolderBase]: For 444351/444351 co-relation queries the response was YES. [2024-06-14 16:15:54,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66556 conditions, 6666 events. 4225/6666 cut-off events. For 444351/444351 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 40683 event pairs, 920 based on Foata normal form. 16/6681 useless extension candidates. Maximal degree in co-relation 66438. Up to 5805 conditions per place. [2024-06-14 16:15:54,603 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 400 selfloop transitions, 54 changer transitions 0/459 dead transitions. [2024-06-14 16:15:54,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 459 transitions, 9017 flow [2024-06-14 16:15:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:15:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:15:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-06-14 16:15:54,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132275132275133 [2024-06-14 16:15:54,604 INFO L175 Difference]: Start difference. First operand has 240 places, 408 transitions, 7323 flow. Second operand 9 states and 194 transitions. [2024-06-14 16:15:54,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 459 transitions, 9017 flow [2024-06-14 16:15:55,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 459 transitions, 8853 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-14 16:15:55,294 INFO L231 Difference]: Finished difference. Result has 246 places, 414 transitions, 7545 flow [2024-06-14 16:15:55,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7159, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7545, PETRI_PLACES=246, PETRI_TRANSITIONS=414} [2024-06-14 16:15:55,294 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places. [2024-06-14 16:15:55,295 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 414 transitions, 7545 flow [2024-06-14 16:15:55,295 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-14 16:15:55,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:15:55,295 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-14 16:15:55,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 16:15:55,295 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:15:55,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:15:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash -711881841, now seen corresponding path program 2 times [2024-06-14 16:15:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:15:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016906084] [2024-06-14 16:15:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:15:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:15:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:16:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:16:02,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:16:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016906084] [2024-06-14 16:16:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016906084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:16:02,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:16:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:16:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205020383] [2024-06-14 16:16:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:16:02,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:16:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:16:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:16:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:16:03,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:16:03,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 414 transitions, 7545 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:16:03,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:16:03,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:16:03,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:16:05,838 INFO L124 PetriNetUnfolderBase]: 4761/7576 cut-off events. [2024-06-14 16:16:05,839 INFO L125 PetriNetUnfolderBase]: For 617888/617888 co-relation queries the response was YES. [2024-06-14 16:16:05,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77332 conditions, 7576 events. 4761/7576 cut-off events. For 617888/617888 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 47666 event pairs, 969 based on Foata normal form. 48/7623 useless extension candidates. Maximal degree in co-relation 77212. Up to 5074 conditions per place. [2024-06-14 16:16:05,931 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 352 selfloop transitions, 121 changer transitions 0/478 dead transitions. [2024-06-14 16:16:05,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 478 transitions, 9627 flow [2024-06-14 16:16:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:16:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:16:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 224 transitions. [2024-06-14 16:16:05,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-14 16:16:05,932 INFO L175 Difference]: Start difference. First operand has 246 places, 414 transitions, 7545 flow. Second operand 10 states and 224 transitions. [2024-06-14 16:16:05,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 478 transitions, 9627 flow [2024-06-14 16:16:06,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 478 transitions, 9467 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-06-14 16:16:06,756 INFO L231 Difference]: Finished difference. Result has 253 places, 419 transitions, 7943 flow [2024-06-14 16:16:06,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7385, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7943, PETRI_PLACES=253, PETRI_TRANSITIONS=419} [2024-06-14 16:16:06,757 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-14 16:16:06,757 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 419 transitions, 7943 flow [2024-06-14 16:16:06,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:16:06,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:16:06,757 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-14 16:16:06,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 16:16:06,757 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:16:06,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:16:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash 239308799, now seen corresponding path program 3 times [2024-06-14 16:16:06,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:16:06,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159955829] [2024-06-14 16:16:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:16:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:16:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:16:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:16:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:16:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159955829] [2024-06-14 16:16:14,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159955829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:16:14,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:16:14,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:16:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734139514] [2024-06-14 16:16:14,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:16:14,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:16:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:16:14,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:16:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:16:14,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:16:14,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 419 transitions, 7943 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:16:14,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:16:14,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:16:14,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:16:16,842 INFO L124 PetriNetUnfolderBase]: 4818/7674 cut-off events. [2024-06-14 16:16:16,842 INFO L125 PetriNetUnfolderBase]: For 609842/609842 co-relation queries the response was YES. [2024-06-14 16:16:16,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77186 conditions, 7674 events. 4818/7674 cut-off events. For 609842/609842 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 48620 event pairs, 1179 based on Foata normal form. 58/7731 useless extension candidates. Maximal degree in co-relation 77063. Up to 6563 conditions per place. [2024-06-14 16:16:16,930 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 351 selfloop transitions, 114 changer transitions 0/470 dead transitions. [2024-06-14 16:16:16,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 470 transitions, 9478 flow [2024-06-14 16:16:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:16:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:16:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-06-14 16:16:16,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-06-14 16:16:16,931 INFO L175 Difference]: Start difference. First operand has 253 places, 419 transitions, 7943 flow. Second operand 10 states and 218 transitions. [2024-06-14 16:16:16,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 470 transitions, 9478 flow [2024-06-14 16:16:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 470 transitions, 9207 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-14 16:16:17,941 INFO L231 Difference]: Finished difference. Result has 256 places, 419 transitions, 7909 flow [2024-06-14 16:16:17,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7672, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7909, PETRI_PLACES=256, PETRI_TRANSITIONS=419} [2024-06-14 16:16:17,942 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places. [2024-06-14 16:16:17,942 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 419 transitions, 7909 flow [2024-06-14 16:16:17,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:16:17,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:16:17,943 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-14 16:16:17,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 16:16:17,943 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-14 16:16:17,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:16:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1302972174, now seen corresponding path program 1 times [2024-06-14 16:16:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:16:17,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351035169] [2024-06-14 16:16:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:16:17,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:16:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:16:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:16:25,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:16:25,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351035169] [2024-06-14 16:16:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351035169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:16:25,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:16:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:16:25,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682333658] [2024-06-14 16:16:25,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:16:25,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:16:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:16:25,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:16:25,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:16:25,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:16:25,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 419 transitions, 7909 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-14 16:16:25,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:16:25,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:16:25,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:16:28,458 INFO L124 PetriNetUnfolderBase]: 4806/7670 cut-off events. [2024-06-14 16:16:28,458 INFO L125 PetriNetUnfolderBase]: For 538102/538102 co-relation queries the response was YES. [2024-06-14 16:16:28,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76661 conditions, 7670 events. 4806/7670 cut-off events. For 538102/538102 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 48729 event pairs, 1317 based on Foata normal form. 4/7673 useless extension candidates. Maximal degree in co-relation 76537. Up to 7202 conditions per place. [2024-06-14 16:16:28,541 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 389 selfloop transitions, 48 changer transitions 0/442 dead transitions. [2024-06-14 16:16:28,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 442 transitions, 8982 flow [2024-06-14 16:16:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:16:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:16:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 16:16:28,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-14 16:16:28,542 INFO L175 Difference]: Start difference. First operand has 256 places, 419 transitions, 7909 flow. Second operand 8 states and 155 transitions. [2024-06-14 16:16:28,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 442 transitions, 8982 flow [2024-06-14 16:16:29,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 442 transitions, 8739 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-14 16:16:29,313 INFO L231 Difference]: Finished difference. Result has 258 places, 419 transitions, 7776 flow [2024-06-14 16:16:29,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7666, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7776, PETRI_PLACES=258, PETRI_TRANSITIONS=419} [2024-06-14 16:16:29,313 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places. [2024-06-14 16:16:29,313 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 419 transitions, 7776 flow [2024-06-14 16:16:29,313 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-14 16:16:29,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:16:29,313 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-14 16:16:29,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 16:16:29,313 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-14 16:16:29,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:16:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1646655270, now seen corresponding path program 2 times [2024-06-14 16:16:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:16:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138536204] [2024-06-14 16:16:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:16:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:16:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:16:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:16:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:16:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138536204] [2024-06-14 16:16:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138536204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:16:37,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:16:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:16:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713274263] [2024-06-14 16:16:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:16:37,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:16:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:16:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:16:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:16:37,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:16:37,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 419 transitions, 7776 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-14 16:16:37,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:16:37,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:16:37,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:16:39,708 INFO L124 PetriNetUnfolderBase]: 4816/7694 cut-off events. [2024-06-14 16:16:39,708 INFO L125 PetriNetUnfolderBase]: For 533730/533730 co-relation queries the response was YES. [2024-06-14 16:16:39,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76171 conditions, 7694 events. 4816/7694 cut-off events. For 533730/533730 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 48982 event pairs, 1337 based on Foata normal form. 2/7695 useless extension candidates. Maximal degree in co-relation 76046. Up to 7355 conditions per place. [2024-06-14 16:16:39,795 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 412 selfloop transitions, 26 changer transitions 0/443 dead transitions. [2024-06-14 16:16:39,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 443 transitions, 8862 flow [2024-06-14 16:16:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:16:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:16:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 16:16:39,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-14 16:16:39,796 INFO L175 Difference]: Start difference. First operand has 258 places, 419 transitions, 7776 flow. Second operand 8 states and 145 transitions. [2024-06-14 16:16:39,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 443 transitions, 8862 flow [2024-06-14 16:16:40,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 443 transitions, 8784 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 16:16:40,618 INFO L231 Difference]: Finished difference. Result has 261 places, 425 transitions, 7907 flow [2024-06-14 16:16:40,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7703, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7907, PETRI_PLACES=261, PETRI_TRANSITIONS=425} [2024-06-14 16:16:40,618 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 218 predicate places. [2024-06-14 16:16:40,619 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 425 transitions, 7907 flow [2024-06-14 16:16:40,619 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-14 16:16:40,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:16:40,619 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-14 16:16:40,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 16:16:40,619 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:16:40,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:16:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1161700385, now seen corresponding path program 7 times [2024-06-14 16:16:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:16:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302273077] [2024-06-14 16:16:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:16:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:16:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:16:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:16:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:16:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302273077] [2024-06-14 16:16:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302273077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:16:47,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:16:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:16:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770120588] [2024-06-14 16:16:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:16:47,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:16:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:16:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:16:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:16:48,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:16:48,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 425 transitions, 7907 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-14 16:16:48,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:16:48,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:16:48,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:16:50,683 INFO L124 PetriNetUnfolderBase]: 4925/7869 cut-off events. [2024-06-14 16:16:50,683 INFO L125 PetriNetUnfolderBase]: For 579135/579135 co-relation queries the response was YES. [2024-06-14 16:16:50,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78038 conditions, 7869 events. 4925/7869 cut-off events. For 579135/579135 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 50225 event pairs, 1178 based on Foata normal form. 16/7883 useless extension candidates. Maximal degree in co-relation 77912. Up to 6773 conditions per place. [2024-06-14 16:16:50,785 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 371 selfloop transitions, 100 changer transitions 0/476 dead transitions. [2024-06-14 16:16:50,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 476 transitions, 9610 flow [2024-06-14 16:16:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:16:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:16:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-14 16:16:50,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-14 16:16:50,787 INFO L175 Difference]: Start difference. First operand has 261 places, 425 transitions, 7907 flow. Second operand 9 states and 192 transitions. [2024-06-14 16:16:50,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 476 transitions, 9610 flow [2024-06-14 16:16:51,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 476 transitions, 9562 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 16:16:51,533 INFO L231 Difference]: Finished difference. Result has 267 places, 434 transitions, 8347 flow [2024-06-14 16:16:51,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7859, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8347, PETRI_PLACES=267, PETRI_TRANSITIONS=434} [2024-06-14 16:16:51,534 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 224 predicate places. [2024-06-14 16:16:51,534 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 434 transitions, 8347 flow [2024-06-14 16:16:51,534 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-14 16:16:51,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:16:51,534 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-14 16:16:51,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 16:16:51,534 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:16:51,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:16:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -123840773, now seen corresponding path program 8 times [2024-06-14 16:16:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:16:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258445687] [2024-06-14 16:16:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:16:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:16:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:16:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:16:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:16:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258445687] [2024-06-14 16:16:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258445687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:16:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:16:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:16:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324075507] [2024-06-14 16:16:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:16:58,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:16:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:16:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:16:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:16:58,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:16:58,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 434 transitions, 8347 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-14 16:16:58,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:16:58,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:16:58,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:17:01,487 INFO L124 PetriNetUnfolderBase]: 5002/7987 cut-off events. [2024-06-14 16:17:01,488 INFO L125 PetriNetUnfolderBase]: For 608164/608164 co-relation queries the response was YES. [2024-06-14 16:17:01,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80479 conditions, 7987 events. 5002/7987 cut-off events. For 608164/608164 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 51128 event pairs, 1175 based on Foata normal form. 16/8001 useless extension candidates. Maximal degree in co-relation 80351. Up to 6896 conditions per place. [2024-06-14 16:17:01,575 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 377 selfloop transitions, 98 changer transitions 0/480 dead transitions. [2024-06-14 16:17:01,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 480 transitions, 10079 flow [2024-06-14 16:17:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:17:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:17:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-14 16:17:01,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-14 16:17:01,576 INFO L175 Difference]: Start difference. First operand has 267 places, 434 transitions, 8347 flow. Second operand 9 states and 192 transitions. [2024-06-14 16:17:01,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 480 transitions, 10079 flow [2024-06-14 16:17:02,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 480 transitions, 9813 flow, removed 65 selfloop flow, removed 5 redundant places. [2024-06-14 16:17:02,315 INFO L231 Difference]: Finished difference. Result has 272 places, 439 transitions, 8525 flow [2024-06-14 16:17:02,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8081, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8525, PETRI_PLACES=272, PETRI_TRANSITIONS=439} [2024-06-14 16:17:02,316 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 229 predicate places. [2024-06-14 16:17:02,316 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 439 transitions, 8525 flow [2024-06-14 16:17:02,316 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-14 16:17:02,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:17:02,316 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-14 16:17:02,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 16:17:02,316 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:17:02,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:17:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash 716093263, now seen corresponding path program 9 times [2024-06-14 16:17:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:17:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098690771] [2024-06-14 16:17:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:17:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:17:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:17:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:17:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:17:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098690771] [2024-06-14 16:17:09,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098690771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:17:09,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:17:09,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:17:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770136292] [2024-06-14 16:17:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:17:09,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:17:09,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:17:09,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:17:09,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:17:09,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:17:09,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 439 transitions, 8525 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-14 16:17:09,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:17:09,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:17:09,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:17:12,204 INFO L124 PetriNetUnfolderBase]: 5076/8108 cut-off events. [2024-06-14 16:17:12,204 INFO L125 PetriNetUnfolderBase]: For 631570/631570 co-relation queries the response was YES. [2024-06-14 16:17:12,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81911 conditions, 8108 events. 5076/8108 cut-off events. For 631570/631570 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 52046 event pairs, 1194 based on Foata normal form. 16/8122 useless extension candidates. Maximal degree in co-relation 81781. Up to 7016 conditions per place. [2024-06-14 16:17:12,310 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 367 selfloop transitions, 110 changer transitions 0/482 dead transitions. [2024-06-14 16:17:12,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 482 transitions, 10109 flow [2024-06-14 16:17:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:17:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:17:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-14 16:17:12,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052910052910053 [2024-06-14 16:17:12,311 INFO L175 Difference]: Start difference. First operand has 272 places, 439 transitions, 8525 flow. Second operand 9 states and 191 transitions. [2024-06-14 16:17:12,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 482 transitions, 10109 flow [2024-06-14 16:17:13,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 482 transitions, 9762 flow, removed 71 selfloop flow, removed 6 redundant places. [2024-06-14 16:17:13,312 INFO L231 Difference]: Finished difference. Result has 275 places, 442 transitions, 8577 flow [2024-06-14 16:17:13,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8178, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8577, PETRI_PLACES=275, PETRI_TRANSITIONS=442} [2024-06-14 16:17:13,312 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 232 predicate places. [2024-06-14 16:17:13,312 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 442 transitions, 8577 flow [2024-06-14 16:17:13,312 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-14 16:17:13,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:17:13,312 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-14 16:17:13,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 16:17:13,312 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-14 16:17:13,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:17:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1167210635, now seen corresponding path program 10 times [2024-06-14 16:17:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:17:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746593365] [2024-06-14 16:17:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:17:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:17:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:17:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:17:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:17:20,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746593365] [2024-06-14 16:17:20,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746593365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:17:20,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:17:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:17:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191984894] [2024-06-14 16:17:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:17:20,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:17:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:17:20,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:17:20,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:17:20,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:17:20,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 442 transitions, 8577 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-14 16:17:20,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:17:20,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:17:20,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:17:23,560 INFO L124 PetriNetUnfolderBase]: 5246/8367 cut-off events. [2024-06-14 16:17:23,561 INFO L125 PetriNetUnfolderBase]: For 680575/680575 co-relation queries the response was YES. [2024-06-14 16:17:23,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85204 conditions, 8367 events. 5246/8367 cut-off events. For 680575/680575 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 53974 event pairs, 1189 based on Foata normal form. 16/8381 useless extension candidates. Maximal degree in co-relation 85074. Up to 6791 conditions per place. [2024-06-14 16:17:23,666 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 385 selfloop transitions, 104 changer transitions 0/494 dead transitions. [2024-06-14 16:17:23,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 494 transitions, 10605 flow [2024-06-14 16:17:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:17:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:17:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2024-06-14 16:17:23,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-14 16:17:23,673 INFO L175 Difference]: Start difference. First operand has 275 places, 442 transitions, 8577 flow. Second operand 9 states and 196 transitions. [2024-06-14 16:17:23,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 494 transitions, 10605 flow [2024-06-14 16:17:24,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 494 transitions, 10303 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-06-14 16:17:24,594 INFO L231 Difference]: Finished difference. Result has 279 places, 448 transitions, 8810 flow [2024-06-14 16:17:24,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8275, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8810, PETRI_PLACES=279, PETRI_TRANSITIONS=448} [2024-06-14 16:17:24,595 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places. [2024-06-14 16:17:24,595 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 448 transitions, 8810 flow [2024-06-14 16:17:24,595 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-14 16:17:24,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:17:24,595 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-14 16:17:24,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 16:17:24,595 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-14 16:17:24,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:17:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -967755023, now seen corresponding path program 4 times [2024-06-14 16:17:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:17:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738771667] [2024-06-14 16:17:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:17:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:17:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:17:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:17:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:17:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738771667] [2024-06-14 16:17:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738771667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:17:32,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:17:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:17:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061132582] [2024-06-14 16:17:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:17:32,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:17:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:17:32,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:17:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:17:32,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:17:32,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 448 transitions, 8810 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:17:32,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:17:32,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:17:32,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:17:35,416 INFO L124 PetriNetUnfolderBase]: 5513/8807 cut-off events. [2024-06-14 16:17:35,416 INFO L125 PetriNetUnfolderBase]: For 793664/793664 co-relation queries the response was YES. [2024-06-14 16:17:35,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89556 conditions, 8807 events. 5513/8807 cut-off events. For 793664/793664 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 57427 event pairs, 1307 based on Foata normal form. 58/8863 useless extension candidates. Maximal degree in co-relation 89425. Up to 7391 conditions per place. [2024-06-14 16:17:35,528 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 393 selfloop transitions, 104 changer transitions 0/502 dead transitions. [2024-06-14 16:17:35,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 502 transitions, 10530 flow [2024-06-14 16:17:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:17:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:17:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-14 16:17:35,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-14 16:17:35,529 INFO L175 Difference]: Start difference. First operand has 279 places, 448 transitions, 8810 flow. Second operand 10 states and 213 transitions. [2024-06-14 16:17:35,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 502 transitions, 10530 flow [2024-06-14 16:17:36,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 502 transitions, 10194 flow, removed 77 selfloop flow, removed 6 redundant places. [2024-06-14 16:17:36,681 INFO L231 Difference]: Finished difference. Result has 284 places, 455 transitions, 8921 flow [2024-06-14 16:17:36,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8476, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8921, PETRI_PLACES=284, PETRI_TRANSITIONS=455} [2024-06-14 16:17:36,682 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 241 predicate places. [2024-06-14 16:17:36,682 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 455 transitions, 8921 flow [2024-06-14 16:17:36,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:17:36,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:17:36,682 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-14 16:17:36,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 16:17:36,682 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-14 16:17:36,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:17:36,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1615625571, now seen corresponding path program 5 times [2024-06-14 16:17:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:17:36,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247462029] [2024-06-14 16:17:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:17:36,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:17:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:17:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:17:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:17:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247462029] [2024-06-14 16:17:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247462029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:17:44,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:17:44,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:17:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780838143] [2024-06-14 16:17:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:17:44,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:17:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:17:44,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:17:44,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:17:44,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:17:44,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 455 transitions, 8921 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:17:44,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:17:44,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:17:44,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:17:47,244 INFO L124 PetriNetUnfolderBase]: 5745/9217 cut-off events. [2024-06-14 16:17:47,245 INFO L125 PetriNetUnfolderBase]: For 826392/826392 co-relation queries the response was YES. [2024-06-14 16:17:47,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92370 conditions, 9217 events. 5745/9217 cut-off events. For 826392/826392 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 60904 event pairs, 1392 based on Foata normal form. 58/9273 useless extension candidates. Maximal degree in co-relation 92237. Up to 7751 conditions per place. [2024-06-14 16:17:47,363 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 379 selfloop transitions, 123 changer transitions 0/507 dead transitions. [2024-06-14 16:17:47,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 507 transitions, 10615 flow [2024-06-14 16:17:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:17:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:17:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-06-14 16:17:47,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2024-06-14 16:17:47,364 INFO L175 Difference]: Start difference. First operand has 284 places, 455 transitions, 8921 flow. Second operand 10 states and 214 transitions. [2024-06-14 16:17:47,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 507 transitions, 10615 flow [2024-06-14 16:17:48,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 507 transitions, 10320 flow, removed 57 selfloop flow, removed 6 redundant places. [2024-06-14 16:17:48,486 INFO L231 Difference]: Finished difference. Result has 289 places, 460 transitions, 9067 flow [2024-06-14 16:17:48,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8626, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9067, PETRI_PLACES=289, PETRI_TRANSITIONS=460} [2024-06-14 16:17:48,487 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places. [2024-06-14 16:17:48,487 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 460 transitions, 9067 flow [2024-06-14 16:17:48,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:17:48,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:17:48,487 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-14 16:17:48,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 16:17:48,487 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:17:48,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:17:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 971879153, now seen corresponding path program 6 times [2024-06-14 16:17:48,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:17:48,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659807042] [2024-06-14 16:17:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:17:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:17:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:17:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:17:56,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:17:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659807042] [2024-06-14 16:17:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659807042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:17:56,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:17:56,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:17:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000162489] [2024-06-14 16:17:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:17:56,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:17:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:17:56,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:17:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:17:56,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:17:56,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 460 transitions, 9067 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:17:56,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:17:56,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:17:56,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:18:00,323 INFO L124 PetriNetUnfolderBase]: 6376/10290 cut-off events. [2024-06-14 16:18:00,323 INFO L125 PetriNetUnfolderBase]: For 985819/985819 co-relation queries the response was YES. [2024-06-14 16:18:00,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104494 conditions, 10290 events. 6376/10290 cut-off events. For 985819/985819 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 69907 event pairs, 1486 based on Foata normal form. 54/10342 useless extension candidates. Maximal degree in co-relation 104359. Up to 7173 conditions per place. [2024-06-14 16:18:00,446 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 353 selfloop transitions, 183 changer transitions 0/541 dead transitions. [2024-06-14 16:18:00,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 541 transitions, 11659 flow [2024-06-14 16:18:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:18:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:18:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 245 transitions. [2024-06-14 16:18:00,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-06-14 16:18:00,448 INFO L175 Difference]: Start difference. First operand has 289 places, 460 transitions, 9067 flow. Second operand 11 states and 245 transitions. [2024-06-14 16:18:00,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 541 transitions, 11659 flow [2024-06-14 16:18:01,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 541 transitions, 11257 flow, removed 55 selfloop flow, removed 8 redundant places. [2024-06-14 16:18:01,676 INFO L231 Difference]: Finished difference. Result has 295 places, 479 transitions, 9706 flow [2024-06-14 16:18:01,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8665, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9706, PETRI_PLACES=295, PETRI_TRANSITIONS=479} [2024-06-14 16:18:01,677 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 252 predicate places. [2024-06-14 16:18:01,677 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 479 transitions, 9706 flow [2024-06-14 16:18:01,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:01,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:18:01,677 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-14 16:18:01,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 16:18:01,677 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:18:01,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:18:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash -960136463, now seen corresponding path program 7 times [2024-06-14 16:18:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:18:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216576091] [2024-06-14 16:18:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:18:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:18:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:18:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:18:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:18:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216576091] [2024-06-14 16:18:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216576091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:18:09,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:18:09,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:18:09,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631845557] [2024-06-14 16:18:09,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:18:09,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:18:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:18:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:18:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:18:09,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:18:09,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 479 transitions, 9706 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:09,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:18:09,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:18:09,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:18:13,829 INFO L124 PetriNetUnfolderBase]: 6904/11196 cut-off events. [2024-06-14 16:18:13,829 INFO L125 PetriNetUnfolderBase]: For 1146434/1146434 co-relation queries the response was YES. [2024-06-14 16:18:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116217 conditions, 11196 events. 6904/11196 cut-off events. For 1146434/1146434 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 77877 event pairs, 1783 based on Foata normal form. 48/11242 useless extension candidates. Maximal degree in co-relation 116078. Up to 8686 conditions per place. [2024-06-14 16:18:13,968 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 411 selfloop transitions, 124 changer transitions 0/540 dead transitions. [2024-06-14 16:18:13,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 540 transitions, 11938 flow [2024-06-14 16:18:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:18:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:18:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions. [2024-06-14 16:18:13,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-14 16:18:13,969 INFO L175 Difference]: Start difference. First operand has 295 places, 479 transitions, 9706 flow. Second operand 10 states and 220 transitions. [2024-06-14 16:18:13,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 540 transitions, 11938 flow [2024-06-14 16:18:15,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 540 transitions, 11645 flow, removed 72 selfloop flow, removed 5 redundant places. [2024-06-14 16:18:15,381 INFO L231 Difference]: Finished difference. Result has 301 places, 484 transitions, 10016 flow [2024-06-14 16:18:15,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9413, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10016, PETRI_PLACES=301, PETRI_TRANSITIONS=484} [2024-06-14 16:18:15,382 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 258 predicate places. [2024-06-14 16:18:15,382 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 484 transitions, 10016 flow [2024-06-14 16:18:15,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:15,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:18:15,382 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-14 16:18:15,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 16:18:15,383 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:18:15,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:18:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -960403373, now seen corresponding path program 8 times [2024-06-14 16:18:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:18:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693626559] [2024-06-14 16:18:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:18:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:18:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:18:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:18:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:18:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693626559] [2024-06-14 16:18:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693626559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:18:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:18:23,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:18:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572216044] [2024-06-14 16:18:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:18:23,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:18:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:18:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:18:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:18:23,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:18:23,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 484 transitions, 10016 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:23,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:18:23,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:18:23,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:18:27,642 INFO L124 PetriNetUnfolderBase]: 7139/11594 cut-off events. [2024-06-14 16:18:27,642 INFO L125 PetriNetUnfolderBase]: For 1213121/1213121 co-relation queries the response was YES. [2024-06-14 16:18:27,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120375 conditions, 11594 events. 7139/11594 cut-off events. For 1213121/1213121 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 81375 event pairs, 1960 based on Foata normal form. 58/11650 useless extension candidates. Maximal degree in co-relation 120233. Up to 10011 conditions per place. [2024-06-14 16:18:27,805 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 410 selfloop transitions, 118 changer transitions 0/533 dead transitions. [2024-06-14 16:18:27,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 533 transitions, 11764 flow [2024-06-14 16:18:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:18:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:18:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-06-14 16:18:27,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2024-06-14 16:18:27,814 INFO L175 Difference]: Start difference. First operand has 301 places, 484 transitions, 10016 flow. Second operand 10 states and 214 transitions. [2024-06-14 16:18:27,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 533 transitions, 11764 flow [2024-06-14 16:18:29,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 533 transitions, 11485 flow, removed 75 selfloop flow, removed 5 redundant places. [2024-06-14 16:18:29,856 INFO L231 Difference]: Finished difference. Result has 306 places, 486 transitions, 10146 flow [2024-06-14 16:18:29,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9753, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10146, PETRI_PLACES=306, PETRI_TRANSITIONS=486} [2024-06-14 16:18:29,856 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 263 predicate places. [2024-06-14 16:18:29,856 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 486 transitions, 10146 flow [2024-06-14 16:18:29,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:29,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:18:29,857 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-14 16:18:29,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 16:18:29,857 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:18:29,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:18:29,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1167056813, now seen corresponding path program 9 times [2024-06-14 16:18:29,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:18:29,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334400882] [2024-06-14 16:18:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:18:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:18:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:18:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:18:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:18:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334400882] [2024-06-14 16:18:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334400882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:18:37,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:18:37,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:18:37,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331490525] [2024-06-14 16:18:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:18:37,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:18:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:18:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:18:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:18:37,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:18:37,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 486 transitions, 10146 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:37,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:18:37,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:18:37,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:18:41,978 INFO L124 PetriNetUnfolderBase]: 7069/11503 cut-off events. [2024-06-14 16:18:41,978 INFO L125 PetriNetUnfolderBase]: For 1112359/1112359 co-relation queries the response was YES. [2024-06-14 16:18:42,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116093 conditions, 11503 events. 7069/11503 cut-off events. For 1112359/1112359 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 80988 event pairs, 1931 based on Foata normal form. 58/11559 useless extension candidates. Maximal degree in co-relation 115949. Up to 9997 conditions per place. [2024-06-14 16:18:42,142 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 427 selfloop transitions, 102 changer transitions 0/534 dead transitions. [2024-06-14 16:18:42,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 534 transitions, 11870 flow [2024-06-14 16:18:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:18:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:18:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-14 16:18:42,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-14 16:18:42,144 INFO L175 Difference]: Start difference. First operand has 306 places, 486 transitions, 10146 flow. Second operand 10 states and 213 transitions. [2024-06-14 16:18:42,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 534 transitions, 11870 flow [2024-06-14 16:18:44,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 534 transitions, 11447 flow, removed 97 selfloop flow, removed 7 redundant places. [2024-06-14 16:18:44,518 INFO L231 Difference]: Finished difference. Result has 309 places, 486 transitions, 9936 flow [2024-06-14 16:18:44,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9723, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9936, PETRI_PLACES=309, PETRI_TRANSITIONS=486} [2024-06-14 16:18:44,518 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 266 predicate places. [2024-06-14 16:18:44,519 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 486 transitions, 9936 flow [2024-06-14 16:18:44,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:44,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:18:44,519 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-14 16:18:44,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 16:18:44,519 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:18:44,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:18:44,520 INFO L85 PathProgramCache]: Analyzing trace with hash 716099215, now seen corresponding path program 10 times [2024-06-14 16:18:44,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:18:44,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706215023] [2024-06-14 16:18:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:18:44,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:18:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:18:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:18:52,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:18:52,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706215023] [2024-06-14 16:18:52,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706215023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:18:52,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:18:52,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:18:52,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436667790] [2024-06-14 16:18:52,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:18:52,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:18:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:18:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:18:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:18:52,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:18:52,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 486 transitions, 9936 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:52,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:18:52,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:18:52,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:18:56,801 INFO L124 PetriNetUnfolderBase]: 7294/11883 cut-off events. [2024-06-14 16:18:56,801 INFO L125 PetriNetUnfolderBase]: For 1124130/1124130 co-relation queries the response was YES. [2024-06-14 16:18:56,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117900 conditions, 11883 events. 7294/11883 cut-off events. For 1124130/1124130 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 84273 event pairs, 2025 based on Foata normal form. 58/11939 useless extension candidates. Maximal degree in co-relation 117755. Up to 10393 conditions per place. [2024-06-14 16:18:56,965 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 416 selfloop transitions, 114 changer transitions 0/535 dead transitions. [2024-06-14 16:18:56,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 535 transitions, 11688 flow [2024-06-14 16:18:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:18:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:18:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-14 16:18:56,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-14 16:18:56,966 INFO L175 Difference]: Start difference. First operand has 309 places, 486 transitions, 9936 flow. Second operand 10 states and 212 transitions. [2024-06-14 16:18:56,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 535 transitions, 11688 flow [2024-06-14 16:18:59,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 535 transitions, 11480 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 16:18:59,153 INFO L231 Difference]: Finished difference. Result has 312 places, 488 transitions, 10121 flow [2024-06-14 16:18:59,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9728, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10121, PETRI_PLACES=312, PETRI_TRANSITIONS=488} [2024-06-14 16:18:59,154 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 269 predicate places. [2024-06-14 16:18:59,154 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 488 transitions, 10121 flow [2024-06-14 16:18:59,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:18:59,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:18:59,154 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-14 16:18:59,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 16:18:59,154 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:18:59,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:18:59,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1386769063, now seen corresponding path program 11 times [2024-06-14 16:18:59,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:18:59,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048988122] [2024-06-14 16:18:59,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:18:59,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:18:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:19:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:19:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:19:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048988122] [2024-06-14 16:19:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048988122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:19:06,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:19:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:19:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266722661] [2024-06-14 16:19:06,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:19:06,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:19:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:19:06,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:19:06,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:19:06,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:19:06,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 488 transitions, 10121 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:19:06,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:19:06,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:19:06,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:19:11,104 INFO L124 PetriNetUnfolderBase]: 7556/12326 cut-off events. [2024-06-14 16:19:11,105 INFO L125 PetriNetUnfolderBase]: For 1206073/1206073 co-relation queries the response was YES. [2024-06-14 16:19:11,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120867 conditions, 12326 events. 7556/12326 cut-off events. For 1206073/1206073 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 88127 event pairs, 2021 based on Foata normal form. 84/12407 useless extension candidates. Maximal degree in co-relation 120722. Up to 9969 conditions per place. [2024-06-14 16:19:11,256 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 271 selfloop transitions, 261 changer transitions 0/537 dead transitions. [2024-06-14 16:19:11,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 537 transitions, 12103 flow [2024-06-14 16:19:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:19:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:19:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-06-14 16:19:11,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-06-14 16:19:11,258 INFO L175 Difference]: Start difference. First operand has 312 places, 488 transitions, 10121 flow. Second operand 10 states and 218 transitions. [2024-06-14 16:19:11,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 537 transitions, 12103 flow [2024-06-14 16:19:13,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 537 transitions, 11762 flow, removed 62 selfloop flow, removed 7 redundant places. [2024-06-14 16:19:13,314 INFO L231 Difference]: Finished difference. Result has 315 places, 490 transitions, 10474 flow [2024-06-14 16:19:13,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9780, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10474, PETRI_PLACES=315, PETRI_TRANSITIONS=490} [2024-06-14 16:19:13,314 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 272 predicate places. [2024-06-14 16:19:13,314 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 490 transitions, 10474 flow [2024-06-14 16:19:13,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:19:13,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:19:13,314 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-14 16:19:13,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 16:19:13,315 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:19:13,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:19:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1377564853, now seen corresponding path program 12 times [2024-06-14 16:19:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:19:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89691023] [2024-06-14 16:19:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:19:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:19:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:19:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:19:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:19:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89691023] [2024-06-14 16:19:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89691023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:19:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:19:20,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:19:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213371496] [2024-06-14 16:19:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:19:20,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:19:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:19:20,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:19:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:19:20,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:19:20,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 490 transitions, 10474 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:19:20,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:19:20,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:19:20,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:19:25,082 INFO L124 PetriNetUnfolderBase]: 8266/13651 cut-off events. [2024-06-14 16:19:25,082 INFO L125 PetriNetUnfolderBase]: For 1274087/1274087 co-relation queries the response was YES. [2024-06-14 16:19:25,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132131 conditions, 13651 events. 8266/13651 cut-off events. For 1274087/1274087 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 100759 event pairs, 2397 based on Foata normal form. 48/13697 useless extension candidates. Maximal degree in co-relation 131985. Up to 6399 conditions per place. [2024-06-14 16:19:25,261 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 371 selfloop transitions, 179 changer transitions 0/555 dead transitions. [2024-06-14 16:19:25,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 555 transitions, 12746 flow [2024-06-14 16:19:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:19:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:19:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-06-14 16:19:25,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530952380952381 [2024-06-14 16:19:25,262 INFO L175 Difference]: Start difference. First operand has 315 places, 490 transitions, 10474 flow. Second operand 10 states and 223 transitions. [2024-06-14 16:19:25,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 555 transitions, 12746 flow [2024-06-14 16:19:27,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 555 transitions, 12223 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-14 16:19:27,471 INFO L231 Difference]: Finished difference. Result has 320 places, 494 transitions, 10581 flow [2024-06-14 16:19:27,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9951, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10581, PETRI_PLACES=320, PETRI_TRANSITIONS=494} [2024-06-14 16:19:27,472 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 277 predicate places. [2024-06-14 16:19:27,472 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 494 transitions, 10581 flow [2024-06-14 16:19:27,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:19:27,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:19:27,472 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-14 16:19:27,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 16:19:27,472 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-14 16:19:27,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:19:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 464484344, now seen corresponding path program 3 times [2024-06-14 16:19:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:19:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013934323] [2024-06-14 16:19:27,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:19:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:19:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:19:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:19:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:19:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013934323] [2024-06-14 16:19:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013934323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:19:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:19:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:19:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339819870] [2024-06-14 16:19:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:19:36,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:19:36,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:19:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:19:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:19:36,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:19:36,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 494 transitions, 10581 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-14 16:19:36,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:19:36,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:19:36,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:19:40,652 INFO L124 PetriNetUnfolderBase]: 8286/13694 cut-off events. [2024-06-14 16:19:40,653 INFO L125 PetriNetUnfolderBase]: For 1199552/1199552 co-relation queries the response was YES. [2024-06-14 16:19:40,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132489 conditions, 13694 events. 8286/13694 cut-off events. For 1199552/1199552 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 102081 event pairs, 2599 based on Foata normal form. 4/13697 useless extension candidates. Maximal degree in co-relation 132340. Up to 12476 conditions per place. [2024-06-14 16:19:40,848 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 422 selfloop transitions, 104 changer transitions 0/531 dead transitions. [2024-06-14 16:19:40,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 531 transitions, 12239 flow [2024-06-14 16:19:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:19:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:19:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-14 16:19:40,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2024-06-14 16:19:40,849 INFO L175 Difference]: Start difference. First operand has 320 places, 494 transitions, 10581 flow. Second operand 8 states and 165 transitions. [2024-06-14 16:19:40,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 531 transitions, 12239 flow [2024-06-14 16:19:43,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 531 transitions, 11792 flow, removed 61 selfloop flow, removed 7 redundant places. [2024-06-14 16:19:43,036 INFO L231 Difference]: Finished difference. Result has 321 places, 501 transitions, 10531 flow [2024-06-14 16:19:43,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10144, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10531, PETRI_PLACES=321, PETRI_TRANSITIONS=501} [2024-06-14 16:19:43,037 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 278 predicate places. [2024-06-14 16:19:43,037 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 501 transitions, 10531 flow [2024-06-14 16:19:43,037 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-14 16:19:43,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:19:43,037 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-14 16:19:43,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 16:19:43,038 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-14 16:19:43,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:19:43,038 INFO L85 PathProgramCache]: Analyzing trace with hash 476864504, now seen corresponding path program 4 times [2024-06-14 16:19:43,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:19:43,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411360920] [2024-06-14 16:19:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:19:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:19:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat